On computing map** of 3d objects: A survey
We review the computation of 3D geometric data map**, which establishes one-to-one
correspondence between or among spatial/spatiotemporal objects. Effective map** …
correspondence between or among spatial/spatiotemporal objects. Effective map** …
A survey of algorithms for geodesic paths and distances
The vector heat method
This article describes a method for efficiently computing parallel transport of tangent vectors
on curved surfaces, or more generally, any vector-valued data on a curved manifold. More …
on curved surfaces, or more generally, any vector-valued data on a curved manifold. More …
Fast and exact discrete geodesic computation based on triangle-oriented wavefront propagation
Computing discrete geodesic distance over triangle meshes is one of the fundamental
problems in computational geometry and computer graphics. In this problem, an effective …
problems in computational geometry and computer graphics. In this problem, an effective …
Centroidal power diagrams with capacity constraints: Computation, applications, and extension
This article presents a new method to optimally partition a geometric domain with capacity
constraints on the partitioned regions. It is an important problem in many fields, ranging from …
constraints on the partitioned regions. It is an important problem in many fields, ranging from …
On variational and PDE‐based distance function approximations
In this paper, we deal with the problem of computing the distance to a surface (a curve in two
dimensional) and consider several distance function approximation methods which are …
dimensional) and consider several distance function approximation methods which are …
geoTangle: Interactive Design of Geodesic Tangle Patterns on Surfaces
Tangles are complex patterns, which are often used to decorate the surface of real-world
artisanal objects. They consist of arrangements of simple shapes organized into nested …
artisanal objects. They consist of arrangements of simple shapes organized into nested …
Intrinsic computation of centroidal Voronoi tessellation (CVT) on meshes
Centroidal Voronoi tessellation (CVT) is a special type of Voronoi diagram such that the
generating point of each Voronoi cell is also its center of mass. The CVT has broad …
generating point of each Voronoi cell is also its center of mass. The CVT has broad …
Fast wavefront propagation (FWP) for computing exact geodesic distances on meshes
Computing geodesic distances on triangle meshes is a fundamental problem in
computational geometry and computer graphics. To date, two notable classes of algorithms …
computational geometry and computer graphics. To date, two notable classes of algorithms …