Delaunay Triangulations in O(sort(n)) Time and More

DOI10.1109/FOCS.2009.53zbMATH Open1292.68143OpenAlexW1543972922WikidataQ56454185 ScholiaQ56454185MaRDI QIDQ5171170FDOQ5171170

Authors: Kevin Buchin, Wolfgang Mulzer 

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

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cited In (4)

• Computing hereditary convex structures
• A sub-linear time algorithm for approximating k-nearest-neighbor with full quality guarantee
• Multidimensional phase recovery and interpolative decomposition butterfly factorization
• Preprocessing imprecise points for Delaunay triangulation: simplified and extended

This page was built for publication: Delaunay Triangulations in O(sort(n)) Time and More

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5171170)