Editing Dense Point Sets Have Sparse Delaunay Triangulations

Title: Dense Point Sets Have Sparse Delaunay Triangulations

Research Question: Can we find a way to efficiently triangulate a dense set of points using a method that scales well with the size of the input?

Methodology: The researchers proposed a new method for triangulating dense point sets, called the "Sparse Delaunay Triangulation" (SDT). The SDT method is based on the Delaunay triangulation, which is a popular algorithm for triangulating a set of points. However, the Delaunay triangulation can be slow and inefficient when dealing with large and dense point sets.

The SDT method works by first dividing the point set into smaller subsets. Each subset is then triangulated using the Delaunay triangulation. The resulting triangulations are then combined to form the final triangulation of the entire point set.


Link to Article: https://arxiv.org/abs/0110030v1
Authors: 
arXiv ID: 0110030v1

[[Category:Computer Science]]
[[Category:Point]]
[[Category:Delaunay]]
[[Category:Triangulation]]
[[Category:Dense]]
[[Category:Set]]