Generalized Voronoi diagrams on networks: an outline

MaRDI QIDQ2948419zbMATH OpenFDO

Authors Atsuyuki Okabe

Publication date 30 September 2015

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)

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

Cited in

(7)

• VORONOI DIAGRAMS FOR A TRANSPORTATION NETWORK ON THE EUCLIDEAN PLANE
• 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
• scientific article; zbMATH DE number 1542607 (Why is no real title available?)
• Algorithms and Computation

Describes a project that uses

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)