Linear Time Algorithms for Euclidean 1-Center in $$\mathfrak {R}^d$$ with Non-linear Convex Constraints
From MaRDI portal
Publication:2795940
DOI10.1007/978-3-319-29221-2_11zbMath1437.68184OpenAlexW2401723089MaRDI QIDQ2795940
Sandip Das, Swami Sarvottamananda, Ayan Nandy
Publication date: 23 March 2016
Published in: Algorithms and Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-29221-2_11
Analysis of algorithms (68W40) Computational aspects related to convexity (52B55) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Related Items
On the 2-Center Problem Under Convex Polyhedral Distance Function, Radius, diameter, incenter, circumcenter, width and minimum enclosing cylinder for some polyhedral distance functions
Cites Work
- Unnamed Item
- Unnamed Item
- Constrained minimum enclosing circle with center on a query line segment
- A subexponential bound for linear programming
- Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems
- Linear Programming in Linear Time When the Dimension Is Fixed
- A Randomized Algorithm for Closest-Point Queries
- On Linear-Time Deterministic Algorithms for Optimization Problems in Fixed Dimension
- On a Multidimensional Search Technique and Its Application to the Euclidean One-Centre Problem
- An Optimal Algorithm for the Intersection Radius of a Set of Convex Polygons
- Optimal Algorithms for Constrained 1-Center Problems