A nearest neighbor sweep circle algorithm for computing discrete Voronoi tessellations

DOI10.1016/J.JMAA.2007.03.027zbMATH Open1122.68146OpenAlexW2014433593MaRDI QIDQ2381920FDOQ2381920

Authors: Albert Schueller 

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

Recommendations

• Centroidal Voronoi Tessellations: Applications and Algorithms
• 3-D Voronoi tessellation algorithms
• Numerical studies of MacQueen's \(k\)-means algorithm for computing the centroidal Voronoi tessellations
• A fast robust algorithm for computing discrete Voronoi diagrams
• scientific article; zbMATH DE number 1241784

zbMATH Keywords

Voronoi diagramdiscrete Voronoi diagram

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computational aspects related to convexity (52B55)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Cellular Automata Modeling of Physical Systems
• The Nöther and Riemann-Roch type theorems for piecewise algebraic curve
• Computational geometry algorithms for the systolic screen
• Parallel computation of discrete Voronoi diagrams (extended abstract)

Cited In (6)

• A fast robust algorithm for computing discrete Voronoi diagrams
• An iterative algorithm for computing measures of generalized Voronoi regions
• 3-D Voronoi tessellation algorithms
• Finding nearest neighbors with Voronoi tessellations
• An all-round sweep algorithm for 2-dimensional nearest-neighbor problems
• Title not available (Why is that?)

This page was built for publication: A nearest neighbor sweep circle algorithm for computing discrete Voronoi tessellations

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