Name
Title | ||
|---|---|---|
Incremental construction of the delaunay triangulation and the delaunay graph in medium dimension |
Abstract | ||
|---|---|---|
We describe a new implementation of the well-known incremental algorithm for constructing Delaunay triangulations in any dimension. Our implementation follows the exact computing paradigm and is fully robust. Extensive comparisons show that our implementation outperforms the best currently available codes for exact convex hulls and Delaunay triangulations, compares very well to the fast non-exact QHull implementation and can be used for quite big input sets in spaces of dimensions up to 6. To circumvent prohibitive memory usage, we also propose a modification of the algorithm that uses and stores only the Delaunay graph (the edges of the full triangulation). We show that a careful implementation of the modified algorithm performs only 6 to 8 times slower than the original algorithm while drastically reducing memory usage in dimension 4 or above. |
Year | DOI | Venue |
|---|---|---|
2009 | 10.1145/1542362.1542403 | Symposium on Computational Geometry 2013 |
Keywords | Field | DocType |
fast non-exact qhull implementation,delaunay graph,new implementation,modified algorithm,delaunay triangulation,exact computing paradigm,well-known incremental algorithm,incremental construction,original algorithm,delaunay triangulations,exact convex hull,careful implementation,medium dimension,measures,convex hull,experiment | Discrete mathematics,Combinatorics,Chew's second algorithm,Bowyer–Watson algorithm,Minimum-weight triangulation,Computer science,Triangulation (social science),Constrained Delaunay triangulation,Ruppert's algorithm,Delaunay triangulation,Pitteway triangulation | Conference |
Citations | PageRank | References |
27 | 1.22 | 15 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jean-Daniel Boissonnat | 1 | 2287 | 406.97 |
| Olivier Devillers | 2 | 788 | 70.63 |
| Samuel Hornus | 3 | 166 | 12.52 |