Facility location on a polyhedral surface

DOI10.1007/s00454-003-2769-0zbMath1055.68115OpenAlexW2050922092MaRDI QIDQ1434248

René van Oostrum, Boris Aronov, Marc J. van Kreveld, Kasturi R. Varadarajan

Publication date: 7 July 2004

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00454-003-2769-0

zbMATH Keywords

facility location1-centerpolyhedral surfacesfurthest-site Voronoi diagram

Mathematics Subject Classification ID

Computational aspects related to convexity (52B55) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Planar arrangements of lines and pseudolines (aspects of discrete geometry) (52C30)

Related Items (4)

Competitive facility location: the Voronoi game ⋮ Approximating generalized distance functions on weighted triangulated surfaces with applications ⋮ Higher-order Voronoi diagrams on triangulated surfaces ⋮ Computing generalized higher-order Voronoi diagrams on triangulated surfaces

This page was built for publication: Facility location on a polyhedral surface