Continuous-Time Moving Network Voronoi Diagram
From MaRDI portal
Publication:3223928
DOI10.1007/978-3-642-25249-5_5zbMath1250.68274MaRDI QIDQ3223928
Binhai Zhu, Jun Luo, Chenglin Fan
Publication date: 9 March 2012
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-25249-5_5
05C82: Small world graphs, complex networks (graph-theoretic aspects)
68U05: Computer graphics; computational geometry (digital and algorithmic aspects)
65D18: Numerical aspects of computer graphics, image analysis, and computational geometry
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
- Algorithms for Reporting and Counting Geometric Intersections
- Two-Dimensional Voronoi Diagrams in the L p -Metric
- On Vertical Visibility in Arrangements of Segments and the Queue Size in the Bentley-Ottmann Line Sweeping Algorithm
- The Voronoi Partition of a Network and Its Implications in Location Theory
- Dog Bites Postman
- An Incremental Algorithm for a Generalization of the Shortest-Path Problem
- Optimal Construction of the City Voronoi Diagram