126 search results - page 1 / 26 » Self-improving algorithms for delaunay triangulations |
CIAC
2010
Springer
13 years 9 months ago
2010
Springer
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...
ICCSA
2004
Springer
13 years 10 months ago
2004
Springer
Abstract. We demonstrate a connection between a regular triangulation and a constrained Delaunay triangulation in 2D. We propose an algorithm for edge enforcement in the constraine...
ESA
2001
Springer
13 years 9 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...
IMR
2004
Springer
13 years 10 months ago
2004
Springer
We present an automatic algorithm to construct blocking scheme for multiblock structured meshes in 2D multiphase flow problems. Our solution is based on the concepts of medial ax...
COMPGEOM
2009
ACM
13 years 11 months ago
2009
ACM
We describe a new implementation of the well-known incremental algorithm for constructing Delaunay triangulations in any dimension. Our implementation follows the exact computing ...