Delaunay Triangulations in O(sort(n)) Time and More
From MaRDI portal
Publication:5171170
DOI10.1109/FOCS.2009.53zbMath1292.68143WikidataQ56454185 ScholiaQ56454185MaRDI QIDQ5171170
Publication date: 25 July 2014
Published in: 2009 50th Annual IEEE Symposium on Foundations of Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/focs.2009.53
68U05: Computer graphics; computational geometry (digital and algorithmic aspects)
Related Items
A sub-linear time algorithm for approximating k-nearest-neighbor with full quality guarantee, Computing hereditary convex structures, Preprocessing imprecise points for Delaunay triangulation: simplified and extended, Multidimensional phase recovery and interpolative decomposition butterfly factorization