#include <DGtal/helpers/StdDefs.h>
#include <DGtal/base/BasicFunctors.h>
#include <DGtal/topology/DigitalSurface.h>
#include <DGtal/topology/SetOfSurfels.h>
#include <DGtal/topology/CanonicCellEmbedder.h>
#include <DGtal/topology/LightImplicitDigitalSurface.h>
#include <DGtal/io/colormaps/ColorBrightnessColorMap.h>
#include <DGtal/geometry/surfaces/estimation/LocalEstimatorFromSurfelFunctorAdapter.h>
#include <DGtal/geometry/surfaces/estimation/IIGeometricFunctors.h>
#include <DGtal/geometry/surfaces/estimation/IntegralInvariantCovarianceEstimator.h>
#include <DGtal/shapes/parametric/Ball3D.h>
#include <DGtal/shapes/Shapes.h>
#include <DGtal/shapes/GaussDigitizer.h>
#include <DGtal/shapes/Mesh.h>
#include <DGtal/shapes/MeshHelpers.h>
#include "DGtal/shapes/TriangulatedSurface.h"
#include <DGtal/io/viewers/Viewer3D.h>
#include <DGtal/math/linalg/EigenSupport.h>

Typedefs
typedef Z3i::RealVector	RealVector3D

typedef Z3i::RealPoint	RealPoint3D

Functions
RealPoint	cartesian_to_spherical (const RealPoint3D &a)

template<typename Shape >
void	laplacian (Shape &shape, const Options &options, std::function< double(const RealPoint3D &)> input_function, std::function< double(const RealPoint3D &)> target_function, int argc, char **argv)

int	main (int argc, char **argv)

Detailed Description

This program is free software : you can redistribuate it and/or modify it under the terms of the GNU Lesser General Public License as published by the Free Software Foundation, either version 3 of the License, or (at you option) any later version.

This program is distributed int the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details.

You should have received a copy of the GNU General Public License along with this program. If not, set http://www.gnu.org/license/.

Author: Thomas Caissard (thoma.nosp@m.s.ca.nosp@m.issar.nosp@m.d@li.nosp@m.ris.c.nosp@m.nrs..nosp@m.fr ) Laboratoire d'InfoRmatique en Image et Systèmes d'information - LIRIS (CNRS, UMR 5205), INSA-Lyon, France LAboratoire de MAthématiques - LAMA (CNRS, UMR 5127), Université de Savoie, France

Date: 2017/06/20

An example file named exampleTriangulatedSurface.

This file is part of the DGtal library.

Definition in file sphereCotangentLaplaceOperator.cpp.

Typedef Documentation

◆ RealPoint3D

typedef Z3i::RealPoint RealPoint3D

Definition at line 70 of file sphereCotangentLaplaceOperator.cpp.

◆ RealVector3D

typedef Z3i::RealVector RealVector3D

Definition at line 69 of file sphereCotangentLaplaceOperator.cpp.

Function Documentation

◆ cartesian_to_spherical()

RealPoint cartesian_to_spherical ( const RealPoint3D & a )

Definition at line 72 of file sphereCotangentLaplaceOperator.cpp.

{
  return RealPoint3D(a.norm(), atan2(a[1], a[0]), acos(a[2]));
}

Referenced by laplacian(), and main().

◆ laplacian()

template<typename Shape >

void laplacian	(	Shape &	shape,
		const Options &	options,
		std::function< double(const RealPoint3D &)>	input_function,
		std::function< double(const RealPoint3D &)>	target_function,
		int	argc,
		char **	argv
	)

Definition at line 87 of file sphereCotangentLaplaceOperator.cpp.

{
  trace.beginBlock("Laplacian");
  typedef GaussDigitizer<Z3i::Space, Shape> Digitizer;
 
  trace.beginBlock("Digitizing the shape");
  Digitizer digitizer;
  digitizer.attach(shape);
  digitizer.init(shape.getLowerBound() + Z3i::Vector(-1,-1,-1), shape.getUpperBound() + Z3i::Vector(1,1,1), options.h);
 
  Z3i::Domain domain = digitizer.getDomain();
  trace.endBlock();
 
  trace.beginBlock( "Construct the Khalimsky space from the image domain." );
  Z3i::KSpace kspace;
  bool space_ok = kspace.init( domain.lowerBound(),
                 domain.upperBound(), true );
  if (!space_ok)
  {
    trace.error() << "Error in the Khamisky space construction."<<std::endl;
    return;
  }
  trace.endBlock();
 
  trace.beginBlock( "Extracting boundary by scanning the space. " );
 
  typedef SurfelAdjacency<Z3i::KSpace::dimension> MySurfelAdjacency;
  MySurfelAdjacency surfAdj( true ); // interior in all directions.
 
  typedef Z3i::KSpace::SurfelSet SurfelSet;
  typedef SetOfSurfels< KSpace, SurfelSet > MySetOfSurfels;
  typedef DigitalSurface< MySetOfSurfels > MyDigitalSurface;
  MySetOfSurfels theSetOfSurfels( kspace, surfAdj );
  Surfaces<Z3i::KSpace>::sMakeBoundary( theSetOfSurfels.surfelSet(),
                  kspace, digitizer,
                  domain.lowerBound(),
                  domain.upperBound() );
  MyDigitalSurface digSurf( theSetOfSurfels );
  trace.info() << "Digital surface has " << digSurf.size() << " surfels."
         << std::endl;
  trace.endBlock();
 
  trace.beginBlock( "Making triangulated surface. " );
  typedef CanonicCellEmbedder<KSpace>      CanonicCellEmbedder;
  typedef TriangulatedSurface< RealPoint > TriMesh;
  typedef std::map< MyDigitalSurface::Vertex, TriMesh::Index > VertexMap;
  TriMesh trimesh;
  CanonicCellEmbedder canonicCellembedder(kspace);
 
  VertexMap vmap; // stores the map Vertex -> Index
  MeshHelpers::digitalSurface2DualTriangulatedSurface
    ( digSurf, canonicCellembedder, trimesh, vmap );
 
  trace.info() << "Triangulated surface is " << trimesh << std::endl;
 
  trace.endBlock();
  trace.beginBlock("Computing Laplacian");
  typedef TriangulatedSurface< CanonicCellEmbedder::Value > TriangulatedSurface;
  TriangulatedSurface::VertexRange vertices = trimesh.allVertices();
 
  //Grid scaling factor and sphere projection
  for(auto v : vertices)
  {
    trimesh.position( v ) *= options.h;
    if(options.smooth == 1)
      trimesh.position( v ) /= trimesh.position( v ).norm();
  }
 
  std::ofstream error_out(options.error_output, std::ofstream::app);
  std::ofstream function_out("function.dat");
 
  Eigen::VectorXd laplacian_result( trimesh.nbVertices() );
  Eigen::VectorXd error( trimesh.nbVertices() );
  Eigen::VectorXd error_faces( trimesh.nbFaces() );
  int i = 0;
  double total_area = 0.;
 
  // Iteration over all vertices
  for(auto v : vertices)
  {
    const RealPoint3D p_i = trimesh.position(v);
    const TriangulatedSurface::ArcRange out_arcs = trimesh.outArcs(v);
    double accum = 0.;
 
    // We compute here \Delta f(p_i) by iteration over arcs going out from p_i
    for(auto a : out_arcs)
    {
      // The point p_i -----> p_j
      const RealPoint3D p_j = trimesh.position( trimesh.head(a) );
 
      const TriangulatedSurface::Arc next_left_arc = trimesh.next( a );
      const TriangulatedSurface::Arc next_right_arc = trimesh.next( trimesh.opposite(a) );
 
      // Three points of the left triangle
      const RealPoint3D p1 = p_j;
      const RealPoint3D p2 = trimesh.position( trimesh.head( next_left_arc ) );
      const RealPoint3D p3 = p_i;
 
      // Three points of the right triangle
      const RealPoint3D pp1 = p_j;
      const RealPoint3D pp2 = trimesh.position(trimesh.head( next_right_arc ));
      const RealPoint3D pp3 = p_i;
 
      // Left and right angles
      const RealPoint3D v1 =  (p1 - p2)   / (p1 - p2).norm();
      const RealPoint3D v2 =  (p3 - p2)   / (p3 - p2).norm();
      const RealPoint3D vv1 = (pp1 - pp2) / (pp1 - pp2).norm();
      const RealPoint3D vv2 = (pp3 - pp2) / (pp3 - pp2).norm();
 
      const double alpha = acos( v1.dot(v2) );
      const double beta  = acos( vv1.dot(vv2) );
 
      // Cotan accumulator
      accum += (tan(M_PI_2 - alpha) + tan(M_PI_2 - beta)) * (input_function(p_j) - input_function(p_i));
    }
 
    double accum_area = 0.;
    const TriangulatedSurface::FaceRange faces_around = trimesh.facesAroundVertex( v );
    for(auto f : faces_around)
    {
      const TriangulatedSurface::VertexRange vr = trimesh.verticesAroundFace(f);
      RealPoint3D p = trimesh.position(vr[0]);
      RealPoint3D q = trimesh.position(vr[1]);
      RealPoint3D r = trimesh.position(vr[2]);
 
      const RealPoint3D cross = (r - p).crossProduct(r - q);
      const double faceArea = .5 * cross.norm();
 
      accum_area += faceArea / 3.;
    }
 
    total_area += accum_area;
 
      (options.smooth == 1)
          ? laplacian_result(i) = (1 / (2. * accum_area)) * accum
          : laplacian_result(i) = .5 * accum;
 
    const RealPoint3D w_projected = p_i / p_i.norm();
    const double real_laplacian_value = target_function(w_projected);
 
    const RealPoint3D w_s = cartesian_to_spherical(w_projected);
 
    function_out << w_s[1] << " "
        << w_s[2] << " "
        << laplacian_result(i) << " "
        << real_laplacian_value << " "
        << input_function(p_i) << std::endl;
 
    error(i) = laplacian_result(i) - real_laplacian_value;
    for(auto f : faces_around)
        error_faces( f ) += error(i) / faces_around.size();
 
    i++;
  }
 
  int max_index;
 
  trace.info() << "Computed Area / Real Area : " << total_area << " " << 4 * M_PI << std::endl;
  trace.info() << "Mean Error / Max Error : "
               << error.array().abs().mean() << " / " << error.array().abs().maxCoeff(&max_index) << std::endl;
  error_out << options.h << " "
            << error.array().abs().mean() << " "
            << error.array().abs().maxCoeff() << std::endl;
 
  trace.endBlock();
 
  typedef Mesh< CanonicCellEmbedder::Value > ViewMesh;
  ViewMesh viewmesh;
  MeshHelpers::triangulatedSurface2Mesh( trimesh, viewmesh );
  trace.info() << "Mesh has " << viewmesh.nbVertex()
         << " vertices and " << viewmesh.nbFaces() << " faces." << std::endl;
 
  DGtal::ColorBrightnessColorMap<float> colormap_error(error_faces.minCoeff(), error_faces.maxCoeff(), DGtal::Color::Red);
  for(unsigned int k = 0; k < viewmesh.nbFaces(); k++)
    viewmesh.setFaceColor(k, colormap_error( error_faces(k) ));
 
  QApplication application(argc,argv);
  Viewer3D<> viewer;
  viewer.show();
    viewer << viewmesh;
  viewer << Viewer3D<>::updateDisplay;
  application.exec();
 
  trace.endBlock();
}

Referenced by DGtal::GeodesicsInHeat< TPolygonalCalculus >::init(), and DGtal::VectorsInHeat< TPolygonalCalculus >::init().

◆ main()

int main	(	int	argc,
		char **	argv
	)

Definition at line 276 of file sphereCotangentLaplaceOperator.cpp.

{
  Options options;
  options.h = 0.1;
  options.function = 0;
  options.smooth = 0;
  options.error_output = "error_out.dat";
 
  typedef Ball3D<Z3i::Space> Ball;
  Ball ball(Point(0.0,0.0,0.0), 1.0);
 
  std::function<double(const RealPoint3D&)> xx_function = [](const RealPoint3D& p) {return p[0] * p[0];};
  std::function<double(const RealPoint3D&)> xx_result = [](const RealPoint3D& p)
  {
    const RealPoint3D p_s = cartesian_to_spherical(p);
    return 2 * cos(p_s[1]) * cos(p_s[1]) * (2 * cos(p_s[2]) * cos(p_s[2]) - sin(p_s[2]) * sin(p_s[2]))
            + 2 * (sin(p_s[1]) * sin(p_s[1]) - cos(p_s[1]) * cos(p_s[1]));
  };
 
  std::function<double(const RealPoint3D&)> cos_function = [](const RealPoint3D& p) {return p[2];};
  std::function<double(const RealPoint3D&)> cos_result = [](const RealPoint3D& p)
  {
    const RealPoint3D p_s = cartesian_to_spherical(p);
    return - 2 * cos(p_s[2]);
  };
 
  std::function<double(const RealPoint3D&)> exp_function = [](const RealPoint3D& p)
  {
    const RealPoint3D p_sphere = p / p.norm();
    return exp(p_sphere[0]);
  };
  std::function<double(const RealPoint3D&)> exp_result   = [](const RealPoint3D& p)
  {
    const RealPoint3D p_sphere = p / p.norm();
    const RealPoint3D p_s = cartesian_to_spherical(p);
 
    if(p_s[1] == 0 && p_s[2] == 0) return 1.;
 
    const double theta_derivative = (sin(p_s[1]) * sin(p_s[1]) * sin(p_s[2])
                      - cos(p_s[1])) * (1 / sin(p_s[2])) * exp(p_sphere[0]);
    const double phi_derivative = ( cos(p_s[1]) * cos(p_s[2]) * cos(p_s[2])
                      - sin(p_s[2])
                      + cos(p_s[2]) * cos(p_s[2]) / sin(p_s[2])) * cos(p_s[1]) * exp(p_sphere[0]);
 
    return theta_derivative + phi_derivative;
  };
 
  std::function<double(const RealPoint3D&)> input_function
      = ( options.function == 0 ) ? xx_function : ( (options.function == 1) ? cos_function : exp_function );
  std::function<double(const RealPoint3D&)> target_function
      = ( options.function == 0 ) ? xx_result : ( (options.function == 1) ? cos_result : exp_result );
 
  laplacian<Ball>(ball, options, input_function, target_function, argc, argv);
 
  return 0;
}

References cartesian_to_spherical(), and DGtal::PointVector< dim, TEuclideanRing, TContainer >::norm().

Typedefs

Functions