33 search results - page 2 / 7 » Delaunay triangulations and Voronoi diagrams for Riemannian ... |
FSTTCS
2007
Springer
14 years 1 months ago
2007
Springer
Given a set S of line segments in the plane, we introduce a new family of partitions of the convex hull of S called segment triangulations of S. The set of faces of such a triangul...
ESA
2001
Springer
13 years 12 months ago
2001
Springer
Computing the Delaunay triangulation of n points requires usually a minimum of (n log n) operations, but in some special cases where some additional knowledge is provided, faster a...
VIP
2001
13 years 8 months ago
2001
Facial features determination is essential in many applications such as personal identification, 3D face modeling and model based video coding. Fast and accurate facial feature ex...
PAMI
2011
12 years 10 months ago
2011
—In the research of computer vision and machine perception, three-dimensional objects are usually represented by 2-manifold triangular meshes M. In this paper, we present practic...
ALGORITHMICA
1998
13 years 7 months ago
1998
This short note considers the problem of point location in a Delaunay triangulation of n random points, using no additional preprocessing or storage other than a standard data stru...