Voronoi diagrams with a transportation network on the euclidean plane

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3341, Issue , 2004, Pages 101-112

  Bae, Sang Won ^a   Chwa, Kyung Yong ^a  

^a Korea Advanced Institute of Science and Technology (KAIST)   (South Korea)

Author keywords

[No Author keywords available]

Indexed keywords

GRAPHIC METHODS; COMPUTATIONAL GEOMETRY; GEOMETRY;

ALGORITHMIC PROPERTIES; EUCLIDEAN PLANES; GEOMETRIC PROPERTIES; M-ALGORITHMS; TRANSPORTATION NETWORK; VORONOI; VORONOI DIAGRAMS;

COMPUTATIONAL GEOMETRY; TRANSPORTATION;

EID: 33746197694     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30551-4_11     Document Type: Article

References (9)

1. Hurtado, F., Palop, B., Sacristán, V.: Diagramas de voronoi con funciones temporales. VIII Encuetos en Geometria Computacional (1999)
2. Abellanas, M., Hurtado, F., Sacristán, V., Palop, B.: Voronoi diagram for services neighboring a highway. IPL: Information Processing Letters 86 (2003)
3. 1 metric and isothetic networks. IX Encuetros en Geometria Computacional (2001)
4. Aichholzer, O., Aurenhammer, F., Palop, B.: Quickest paths, straight skeletons, and the city voronoi diagram. In: Proceedings of the 8th SoCG, (June, 5-7, 2002), New York, ACM Press (2002) 151-159
5. Klein, R.: Concrete and Voronoi Diagrams. Number 400 in Lecture Notes in Computer Science, LNCS. Springer-Verlag, Berlin, Germany (1989)
6. Mehlhorn, K., Meiser, S., O'Dunlaing, C.: On the construction of abstract Voronoi diagrams. Discrete Comput. Geom. 6 (1991) 211-224
7. Klein, R., Mehlhorn, K., Meiser, S.: Randomized incremental construction of abstract voronoi diagrams. Computational Geometry: Theory and Applications 3 (1993) 157-184
8. Dehne, F., Klein, R.: "the big sweep": On the power of the wavefront approach to Voronoi diagrams. Algorithmica 17 (1997) 19-32
9. Mitchell, J.S.B., Papadimitriou, C.H.: The weighted region problem: Finding shortest paths through a weighted planar subdivision. Journal of the ACM 38 (1991) 18-73