Linear Time Algorithm for 1-Center in $$\mathfrak {R}^d$$ Under Convex Polyhedral Distance Function

DOI10.1007/978-3-319-39817-4_5zbMath1475.68406OpenAlexW2484381216MaRDI QIDQ4632168

Sandip Das, Swami Sarvottamananda, Ayan Nandy

Publication date: 26 April 2019

Published in: Frontiers in Algorithmics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-39817-4_5

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Computational aspects related to convexity (52B55) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (1)

Radius, diameter, incenter, circumcenter, width and minimum enclosing cylinder for some polyhedral distance functions

Cites Work

• Minimal enclosing discs, circumcircles, and circumcenters in normed planes. I.
• Minimal enclosing discs, circumcircles, and circumcenters in normed planes. II.
• 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
• 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
• A combinatorial bound for linear programming and related problems
• On bisectors for different distance functions

This page was built for publication: Linear Time Algorithm for 1-Center in $$\mathfrak {R}^d$$ Under Convex Polyhedral Distance Function