Geogram  Version 1.9.1
A programming library of geometric algorithms
optimal_transport_3d.h
Go to the documentation of this file.
1 /*
2  * Copyright (c) 2000-2022 Inria
3  * All rights reserved.
4  *
5  * Redistribution and use in source and binary forms, with or without
6  * modification, are permitted provided that the following conditions are met:
7  *
8  * * Redistributions of source code must retain the above copyright notice,
9  * this list of conditions and the following disclaimer.
10  * * Redistributions in binary form must reproduce the above copyright notice,
11  * this list of conditions and the following disclaimer in the documentation
12  * and/or other materials provided with the distribution.
13  * * Neither the name of the ALICE Project-Team nor the names of its
14  * contributors may be used to endorse or promote products derived from this
15  * software without specific prior written permission.
16  *
17  * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
18  * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
19  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
20  * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE
21  * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
22  * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
23  * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
24  * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
25  * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
26  * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
27  * POSSIBILITY OF SUCH DAMAGE.
28  *
29  * Contact: Bruno Levy
30  *
31  * https://www.inria.fr/fr/bruno-levy
32  *
33  * Inria,
34  * Domaine de Voluceau,
35  * 78150 Le Chesnay - Rocquencourt
36  * FRANCE
37  *
38  */
39 
40 #ifndef H_EXPLORAGRAM_OPTIMAL_TRANSPORT_OPTIMAL_TRANSPORT_3D_H
41 #define H_EXPLORAGRAM_OPTIMAL_TRANSPORT_OPTIMAL_TRANSPORT_3D_H
42 
45 
52 namespace GEO {
53 
54  class RVDPolyhedronCallback;
55 
70  Mesh* omega,
71  index_t nb_points,
72  const double* points,
73  double* centroids,
74  RVDPolyhedronCallback* cb=nullptr,
75  bool verbose=false,
76  index_t nb_iter=2000
77  );
78 
95  public:
104  Mesh* mesh,
105  const std::string& delaunay = "PDEL",
106  bool BRIO = false
107  );
108 
113 
117  void get_RVD(Mesh& M) override;
118 
122  void compute_Laguerre_centroids(double* centroids) override;
123 
129  double total_mesh_mass() const;
130 
131  protected:
135  void call_callback_on_RVD() override;
136  };
137 
138  /**********************************************************************/
139 
155  Mesh& morph,
156  bool filter_tets=true
157  );
158 
159 
174  Mesh& singular_set
175  );
176 
177 }
178 
179 #endif
CentroidalVoronoiTesselation is the main component of the remeshing algorithm.
Definition: CVT.h:69
Represents a mesh.
Definition: mesh.h:2701
Computes semi-discrete optimal transport maps.
OptimalTransportMap3d(Mesh *mesh, const std::string &delaunay="PDEL", bool BRIO=false)
OptimalTransportMap3d constructor.
double total_mesh_mass() const
Gets the total mass of the mesh.
void compute_Laguerre_centroids(double *centroids) override
Computes the centroids of the Laguerre cells.
void get_RVD(Mesh &M) override
Computes a mesh with the restricted Voronoi diagram.
~OptimalTransportMap3d() override
OptimalTransportMap destructor.
void call_callback_on_RVD() override
Calls the callback for each intersection between a Laguerre cell and a simplex of the background mesh...
Computes semi-discrete optimal transport maps.
Baseclass for user functions called for each polyhedron of a volumetric restricted Voronoi diagram.
Definition: RVD_callback.h:202
#define EXPLORAGRAM_API
Linkage declaration for exploragram symbols.
Definition: defs.h:18
Included by all headers in exploragram.
Global Vorpaline namespace.
Definition: basic.h:55
void EXPLORAGRAM_API compute_morph(CentroidalVoronoiTesselation &CVT, OptimalTransportMap3d &OTM, Mesh &morph, bool filter_tets=true)
Computes a shape that interpolates the two input tet meshes.
geo_index_t index_t
The type for storing and manipulating indices.
Definition: numeric.h:329
void EXPLORAGRAM_API compute_Laguerre_centroids_3d(Mesh *omega, index_t nb_points, const double *points, double *centroids, RVDPolyhedronCallback *cb=nullptr, bool verbose=false, index_t nb_iter=2000)
Computes the centroids of the Laguerre cells that correspond to optimal transport.
void EXPLORAGRAM_API compute_singular_surface(CentroidalVoronoiTesselation &CVT, OptimalTransportMap3d &OTM, Mesh &singular_set)
Computes the surface that corresponds to discontinuities in the optimal transport map.
Base class for semi-discrete optimal transport.