Linear time algorithms for Euclidean 1-center in \(\mathfrak {R}^d\) with non-linear convex constraints

DOI10.1016/j.dam.2019.09.009zbMath1437.68185OpenAlexW2989810562WikidataQ114191511 ScholiaQ114191511MaRDI QIDQ2181246

Ayan Nandy, Sandip Das, Swami Sarvottamananda

Publication date: 18 May 2020

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2019.09.009

zbMATH Keywords

minimum enclosing circleEuclidean 1-centerminimum intersecting ballminimum stabbing ball

Mathematics Subject Classification ID

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

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
• A combinatorial bound for linear programming and related problems
• Optimal Algorithms for Constrained 1-Center Problems

This page was built for publication: Linear time algorithms for Euclidean 1-center in \(\mathfrak {R}^d\) with non-linear convex constraints