Sciweavers

205 search results - page 5 / 41
» On Deletion in Delaunay Triangulations
Sort
View
DICTA
2003
13 years 9 months ago
Text String Extraction in Delaunay Triangulation
This paper establishes a Delaunay triangulation model for detecting text strings in an image. In this method, text regions are represented based on Delaunay triangles that can be e...
Huimin Grace Guo, Yi Xiao, Hong Yan
SGP
2007
13 years 10 months ago
Triangulations with locally optimal Steiner points
We present two new Delaunay refinement algorithms, second an extension of the first. For a given input domain (a set of points or a planar straight line graph), and a threshold an...
Hale Erten, Alper Üngör
PG
1997
IEEE
13 years 11 months ago
Incremental view-dependent multiresolution triangulation of terrain
A view-dependent multiresolution triangulation algorithm is presented for a real-time flythrough. The triangulation of the terrain is generated incrementally onthe-fly during th...
Reinhard Klein, Daniel Cohen-Or, Tobias Hüttn...
COMPGEOM
2009
ACM
14 years 2 months ago
Incremental construction of the delaunay triangulation and the delaunay graph in medium dimension
We describe a new implementation of the well-known incremental algorithm for constructing Delaunay triangulations in any dimension. Our implementation follows the exact computing ...
Jean-Daniel Boissonnat, Olivier Devillers, Samuel ...
CCCG
2003
13 years 9 months ago
The Strange Complexity of Constrained Delaunay Triangulation
The problem of determining whether a polyhedron has a constrained Delaunay tetrahedralization is NP-complete. However, if no five vertices of the polyhedron lie on a common spher...
Nicolas Grislain, Jonathan Richard Shewchuk