An Optimal Algorithm for the Intersection Radius of a Set of Convex Polygons
From MaRDI portal
Publication:4876693
DOI10.1006/jagm.1996.0013zbMath0852.68033OpenAlexW2042179241MaRDI QIDQ4876693
S. Jadhav, Binay K. Bhattacharya, Asish Kumar Mukhopadhyay
Publication date: 11 December 1996
Published in: Journal of Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jagm.1996.0013
Related Items (11)
Computing \(k\)-centers of uncertain points on a real line ⋮ Minimum color spanning circle of imprecise points ⋮ Linear time algorithms for Euclidean 1-center in \(\mathfrak {R}^d\) with non-linear convex constraints ⋮ Covering moving points with anchored disks ⋮ Farthest-polygon Voronoi diagrams ⋮ Minimum color spanning circle in imprecise setup ⋮ Minimizing the diameter of a spanning tree for imprecise points ⋮ Largest bounding box, smallest diameter, and related problems on imprecise points ⋮ Approximating Largest Convex Hulls for Imprecise Points ⋮ Linear Time Algorithms for Euclidean 1-Center in $$\mathfrak {R}^d$$ with Non-linear Convex Constraints ⋮ Approximating largest convex hulls for imprecise points
This page was built for publication: An Optimal Algorithm for the Intersection Radius of a Set of Convex Polygons
