Dense Point Sets Have Sparse Delaunay Triangulations: Revision history

Jump to navigation Jump to search

Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

24 December 2023

  • curprev 03:1603:16, 24 December 2023SatoshiNakamoto talk contribs 1,501 bytes +465 No edit summary undo
  • curprev 03:1603:16, 24 December 2023SatoshiNakamoto talk contribs 1,036 bytes +1,036 Created page with "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, th..."