External Incremental Delaunay Triangulation
Fuente:
arXiv
Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866910884004102144 |
|---|---|
| author | Cai, Yifeng |
| author_facet | Cai, Yifeng |
| contents | This paper introduces a Delaunay triangulation algorithm based on the external incremental method. Unlike traditional random incremental methods, this approach uses convex hull and points as basic operational units instead of triangles. Since each newly added point is outside the convex hull, there is no need to search for which triangle contains the point, simplifying the algorithm implementation. The time complexity for point sorting is $O(n\log n)$, while the collective complexity for upper/lower tangent searches is proven to be $O(n)$. For uniformly distributed point sets, empirical results demonstrate linear time $O(n)$ for full triangulation construction. The overall time complexity remains $O(n\log n)$. This paper details the algorithm's data structures, implementation details, correctness proof, and comparison with other methods. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2503_10786 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | External Incremental Delaunay Triangulation Cai, Yifeng Computational Geometry This paper introduces a Delaunay triangulation algorithm based on the external incremental method. Unlike traditional random incremental methods, this approach uses convex hull and points as basic operational units instead of triangles. Since each newly added point is outside the convex hull, there is no need to search for which triangle contains the point, simplifying the algorithm implementation. The time complexity for point sorting is $O(n\log n)$, while the collective complexity for upper/lower tangent searches is proven to be $O(n)$. For uniformly distributed point sets, empirical results demonstrate linear time $O(n)$ for full triangulation construction. The overall time complexity remains $O(n\log n)$. This paper details the algorithm's data structures, implementation details, correctness proof, and comparison with other methods. |
| title | External Incremental Delaunay Triangulation |
| topic | Computational Geometry |
| url | https://arxiv.org/abs/2503.10786 |