#### Filter Results:

#### Publication Year

2014

2015

#### Publication Type

#### Co-author

#### Key Phrase

#### Publication Venue

Learn More

Computing geodesic distances on triangle meshes is a fundamental problem in computational geometry and computer graphics. To date, two notable classes of algorithms, the Mitchell-Mount-Papadimitriou (MMP) algorithm and the Chen-Han (CH) algorithm, have been proposed. Although these algorithms can compute exact geodesic distances if numerical computation is… (More)

An intrinsic discrete Laplace-Beltrami operator on sim-plicial surfaces S proposed in [2] was established via an intrinsic Delaunay tessellation on S. Up to now, this intrinsic Delaunay tessellations can only be computed by an edge flipping algorithm without any provable complexity analysis. In the paper, we show that the intrinsic Delaunay triangulation… (More)

This paper studies the Voronoi diagrams on 2-manifold meshes based on geodesic metric (a.k.a. geodesic Voronoi diagrams or GVDs), which have polyline generators. We show that our general setting leads to situations more complicated than conventional 2D Euclidean Voronoi diagrams as well as point-source based GVDs, since a typical bisector contains line… (More)

Delaunay meshes (DM) are a special type of triangle mesh where the local Delaunay condition holds everywhere. We present an efficient algorithm to convert an arbitrary manifold triangle mesh <i>M</i> into a Delaunay mesh. We show that the constructed DM has <i>O</i>(<i>Kn</i>) vertices, where <i>n</i> is the number of vertices in <i>M</i> and <i>K</i> is a… (More)

Intrinsic Delaunay triangulation (IDT) is a fundamental data structure in computational geometry and computer graphics. However, except for some theoretical results, such as existence and uniqueness, little progress has been made towards computing IDT on simplicial surfaces. To date the only way for constructing IDTs is the edge-flipping algorithm, which… (More)

- ‹
- 1
- ›