On the 2-center problem under convex polyhedral distance function
From MaRDI portal
Publication:2958331
DOI10.1007/978-3-319-48749-6_27zbMATH Open1484.68271OpenAlexW2542281734MaRDI QIDQ2958331FDOQ2958331
Authors: Sergey Bereg 
Publication date: 1 February 2017
Published in: Combinatorial Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-48749-6_27
Recommendations
- Linear time algorithm for 1-center in \(\mathfrak {R}^d\) under convex polyhedral distance function
- Radius, diameter, incenter, circumcenter, width and minimum enclosing cylinder for some polyhedral distance functions
- Efficient planar two-center algorithms
- Radius, diameter, incenter, circumcenter, width and minimum enclosing cylinder for some polyhedral distance functions
- The 2-center problem in a simple polygon
Analysis of algorithms (68W40) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computational aspects related to convexity (52B55)
Cites Work
- Linear Programming in Linear Time When the Dimension Is Fixed
- Geometric complexity of some location problems
- Title not available (Why is that?)
- SOME LOWER BOUNDS ON GEOMETRIC SEPARABILITY PROBLEMS
- Voronoi Diagrams of Lines in 3-Space Under Polyhedral Convex Distance Functions
- On a Multidimensional Search Technique and Its Application to the Euclidean One-Centre Problem
- On bisectors for different distance functions
- Linear Time Algorithms for Euclidean 1-Center in $$\mathfrak {R}^d$$ with Non-linear Convex Constraints
Cited In (5)
This page was built for publication: On the 2-center problem under convex polyhedral distance function
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2958331)
