On bisectors for different distance functions
From MaRDI portal
Publication:5929325
DOI10.1016/S0166-218X(00)00238-9zbMath0967.68161OpenAlexW2015112308MaRDI QIDQ5929325
Rolf Klein, Stefan Nickel, Lihong Ma, Christian Icking, Ansgar Weißler
Publication date: 4 April 2001
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0166-218x(00)00238-9
Related Items
On the 2-Center Problem Under Convex Polyhedral Distance Function, Linear Time Algorithm for 1-Center in $$\mathfrak {R}^d$$ Under Convex Polyhedral Distance Function, The geometry of optimal partitions in location problems, On the ordered anti-Weber problem for any norm in \(\mathbb R^2\), Minsum hyperspheres in normed spaces, Locating a general minisum `circle' on the plane, On location-allocation problems for dimensional facilities, The geometry of Minkowski spaces -- a survey. II., Algorithmic results for ordered median problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An optimal algorithm for constructing the weighted Voronoi diagram in the plane
- Voronoi diagrams and arrangements
- Locational optimization problems solved through Voronoi diagrams
- A flexible approach to location problems
- Multicriteria planar ordered median problems
- Using Block Norms for Location Modeling
- GEOMETRY OF BISECTORS FOR STRICTLY CONVEX DISTANCES
