A nearest neighbor sweep circle algorithm for computing discrete Voronoi tessellations
From MaRDI portal
Publication:2381920
DOI10.1016/j.jmaa.2007.03.027zbMath1122.68146OpenAlexW2014433593MaRDI QIDQ2381920
Publication date: 26 September 2007
Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jmaa.2007.03.027
Computational aspects related to convexity (52B55) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Cites Work
This page was built for publication: A nearest neighbor sweep circle algorithm for computing discrete Voronoi tessellations