A simple linear algorithm for intersecting convex polygons

DOI10.1007/BF01898355zbMath0617.68041OpenAlexW1977534285MaRDI QIDQ1822240

Godfried T. Toussaint

Publication date: 1985

Published in: The Visual Computer (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01898355

zbMATH Keywords

geometric algorithmsconvex polygonscomputational geometryconvex hullsintersectiontriangulations of polygons

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Convex sets in (2) dimensions (including convex curves) (52A10) Polytopes and polyhedra (52Bxx)

Related Items (4)

EDGE ADVANCING RULES FOR INTERSECTING SPHERICAL CONVEX POLYGONS ⋮ All convex polyhedra can be clamped with parallel jaw grippers ⋮ A novel approach for ellipsoidal outer-approximation of the intersection region of ellipses in the plane ⋮ Three‐dimensional discrete element simulation for granular materials

Cites Work

• An optimal algorithm for computing the minimum vertex distance between two crossing convex polygons
• Triangulating a simple polygon
• A new linear algorithm for intersecting convex polygons
• Polygons Have Ears

This page was built for publication: A simple linear algorithm for intersecting convex polygons