Sciweavers

13 search results - page 1 / 3
» On the Number of Higher Order Delaunay Triangulations
Sort
View
CIAC
2010
Springer
252views Algorithms» more  CIAC 2010»
13 years 9 months ago
On the Number of Higher Order Delaunay Triangulations
Higher order Delaunay triangulations are a generalization of the Delaunay triangulation which provides a class of well-shaped triangulations, over which extra criteria can be optim...
Dieter Mitsche, Maria Saumell, Rodrigo I. Silveira
ESA
2000
Springer
124views Algorithms» more  ESA 2000»
13 years 8 months ago
Higher Order Delaunay Triangulations
For a set P of points in the plane, we introduce a class of triangulations that is an extension of the Delaunay triangulation. Instead of requiring that for each triangle the circ...
Joachim Gudmundsson, Mikael Hammar, Marc J. van Kr...
ESA
2005
Springer
104views Algorithms» more  ESA 2005»
13 years 10 months ago
Generating Realistic Terrains with Higher-Order Delaunay Triangulations
Thierry de Kok, Marc J. van Kreveld, Maarten L&oum...
CCCG
2010
13 years 5 months ago
Some properties of higher order delaunay and gabriel graphs
We consider two classes of higher order proximity graphs defined on a set of points in the plane, namely, the k-Delaunay graph and the k-Gabriel graph. We give bounds on the follo...
Prosenjit Bose, Sébastien Collette, Ferran ...
DCG
2008
118views more  DCG 2008»
13 years 4 months ago
General-Dimensional Constrained Delaunay and Constrained Regular Triangulations, I: Combinatorial Properties
Two-dimensional constrained Delaunay triangulations are geometric structures that are popular for interpolation and mesh generation because they respect the shapes of planar domai...
Jonathan Richard Shewchuk