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

DOI10.1006/JAGM.1996.0013MaRDI QIDQ4876693zbMATH OpenOpenAlexFDO

Authors S. Jadhav, Binay Bhattacharya, Asish 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

Parallel algorithms in computer science (68W10)

Recommendations

• scientific article; zbMATH DE number 1318519
• Optimal algorithms for some intersection radius problems
• An improved algorithm for intersecting convex polygons
• A complete and efficient algorithm for the intersection of a general and a convex polyhedron
• Optimal Algorithms for the Intersection and the Minimum Distance Problems Between Planar Polygons
• A new linear algorithm for intersecting convex polygons
• A new O(n \,n) algorithm for computing the intersection of convex polygons
• A simple linear algorithm for intersecting convex polygons
• Optimal detection of intersections between convex polyhedra

Cited in

(17)

• Approximating largest convex hulls for imprecise points
• An algorithm for set operations on nonconvex polygons (with an application to census tracts)
• An optimal algorithm for solving collision distance between convex polygons in plane
• Optimal algorithms for some intersection radius problems
• 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
• Covering moving points with anchored disks
• scientific article; zbMATH DE number 1318519 (Why is no real title available?)
• A local search algorithm for ray-convex polyhedron intersection
• Approximating Largest Convex Hulls for Imprecise Points
• Farthest-polygon Voronoi diagrams
• The geodesic edge center of a simple polygon

This page was built for publication: An Optimal Algorithm for the Intersection Radius of a Set of Convex Polygons

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4876693)