Geogram Version 1.9.6-rc
A programming library of geometric algorithms
Loading...
Searching...
No Matches
optimal_transport_on_surface.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_ON_SURFACE_H
41#define H_EXPLORAGRAM_OPTIMAL_TRANSPORT_OPTIMAL_TRANSPORT_ON_SURFACE_H
42
45
53namespace GEO {
54
67 Mesh* omega,
68 index_t nb_points,
69 const double* points,
70 double* centroids,
71 Mesh* RVD=nullptr,
72 bool verbose=false
73 );
74
75 /*********************************************************************/
76
93 public OptimalTransportMap {
94 public:
102 Mesh* mesh,
103 const std::string& delaunay = "BPOW",
104 bool BRIO=false
105 );
106
111
115 void get_RVD(Mesh& M) override;
116
120 void compute_Laguerre_centroids(double* centroids) override;
121
127 double total_mesh_mass() const;
128
129 protected:
133 void call_callback_on_RVD() override;
134 };
135
136 /*********************************************************************/
137}
138
139#endif
Represents a mesh.
Definition mesh.h:3050
Computes semi-discrete optimal transport maps.
void get_RVD(Mesh &M) override
Computes a mesh with the restricted Voronoi diagram.
double total_mesh_mass() const
Gets the total mass of the mesh.
void call_callback_on_RVD() override
Calls the callback for each intersection between a Laguerre cell and a simplex of the background mesh...
OptimalTransportMapOnSurface(Mesh *mesh, const std::string &delaunay="BPOW", bool BRIO=false)
OptimalTransportOnSurface constructor.
void compute_Laguerre_centroids(double *centroids) override
Computes the centroids of the Laguerre cells.
~OptimalTransportMapOnSurface() override
OptimalTransportMap destructor.
Computes semi-discrete optimal transport maps.
#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
geo_index_t index_t
The type for storing and manipulating indices.
Definition numeric.h:329
void EXPLORAGRAM_API compute_Laguerre_centroids_on_surface(Mesh *omega, index_t nb_points, const double *points, double *centroids, Mesh *RVD=nullptr, bool verbose=false)
Computes the centroids of the Laguerre cells that correspond to optimal transport over a surface embe...
Base class for semi-discrete optimal transport.