Generalized Voronoi diagrams on networks: an outline

zbMATH Open1337.68277MaRDI QIDQ2948419FDOQ2948419

Authors: Atsuyuki Okabe 

Publication date: 30 September 2015

Recommendations

• Algorithms and Computation
• VORONOI DIAGRAMS FOR A TRANSPORTATION NETWORK ON THE EUCLIDEAN PLANE
• Algorithms and Computation
• scientific article; zbMATH DE number 1455125
• scientific article; zbMATH DE number 4060214

zbMATH Keywords

directed networksgeneralizationweighted\(k\)th nearest pointnetwork Voronoi diagrams

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Computational aspects related to convexity (52B55)

Cited In (7)

• Algorithms and Computation
• Voronoi diagrams with overlapping regions
• Capacity-constrained network-Voronoi diagram: a summary of results
• Round-trip Voronoi diagrams and doubling density in geographic networks
• Title not available (Why is that?)
• Algorithms and Computation
• VORONOI DIAGRAMS FOR A TRANSPORTATION NETWORK ON THE EUCLIDEAN PLANE

Uses Software

• SANET

This page was built for publication: Generalized Voronoi diagrams on networks: an outline

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