An Optimal Algorithm for the Intersection Radius of a Set of Convex Polygons

DOI10.1006/jagm.1996.0013zbMath0852.68033MaRDI 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

zbMATH Keywords

intersection radius

Mathematics Subject Classification ID

68W10: Parallel algorithms in computer science

Related Items

Approximating Largest Convex Hulls for Imprecise Points, Covering moving points with anchored disks, Farthest-polygon Voronoi diagrams, Approximating largest convex hulls for imprecise points, Minimizing the diameter of a spanning tree for imprecise points, 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, Largest bounding box, smallest diameter, and related problems on imprecise points, Minimum color spanning circle in imprecise setup, Linear Time Algorithms for Euclidean 1-Center in $$\mathfrak {R}^d$$ with Non-linear Convex Constraints