Fitting Voronoi diagrams to planar tesselations
DOI10.1007/978-3-642-45278-9_30zbMATH Open1408.68141arXiv1308.5550OpenAlexW1839812710MaRDI QIDQ2870041FDOQ2870041
Authors: Greg Aloupis, Hebert Pérez-Rosés, Guillermo Pineda-Villavicencio, Perouz Taslakian, Dannier Trinchet-Almaguer
Publication date: 17 January 2014
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1308.5550
Recommendations
- On the Construction of Generalized Voronoi Inverse of a Rectangular Tessellation
- APPROXIMATION OF A TESSELLATION OF THE PLANE BY A VORONOI DIAGRAM
- Recognizing Voronoi Diagrams with Linear Programming
- Delaunay and Voronoi tessellations and minimal simple cycles in triangular region and regular-3 undirected planar graphs
- The inverse Voronoi problem in graphs. I: Hardness
Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Combinatorial aspects of tessellation and tiling problems (05B45)
Cited In (7)
- Minimal representations of tropical rational functions
- The inverse Voronoi problem in graphs. I: Hardness
- APPROXIMATION OF A TESSELLATION OF THE PLANE BY A VORONOI DIAGRAM
- Robustly computing restricted Voronoi diagrams (RVD) on thin-plate models
- Fitting spherical Laguerre Voronoi diagrams to real-world tessellations using planar photographic images
- Superposition of planar voronoi tessellations
- Title not available (Why is that?)
This page was built for publication: Fitting Voronoi diagrams to planar tesselations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2870041)