Constrained minimum enclosing circle with center on a query line segment

DOI10.1016/j.comgeo.2009.01.002zbMath1175.65033OpenAlexW2034951808MaRDI QIDQ924081

Sasanka Roy, Arindam Karmakar, Subhas C. Nandy, Sandip Das

Publication date: 27 July 2009

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.comgeo.2009.01.002

zbMATH Keywords

algorithmminimum enclosing circlefarthest point Voronoi diagram

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Related Items

Linear time algorithms for Euclidean 1-center in \(\mathfrak {R}^d\) with non-linear convex constraints ⋮ A new algorithm for the minimax location problem with the closest distance ⋮ THE ALIGNED K-CENTER PROBLEM ⋮ Optimizing squares covering a set of points ⋮ Linear Time Algorithms for Euclidean 1-Center in $$\mathfrak {R}^d$$ with Non-linear Convex Constraints

Cites Work

• A linear-time algorithm for computing the Voronoi diagram of a convex polygon
• Farthest-point queries with geometric and combinatorial constraints
• Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems
• Unnamed Item
• Unnamed Item
• Unnamed Item