A simple linear algorithm for intersecting convex polygons
From MaRDI portal
Publication:1822240
DOI10.1007/BF01898355zbMath0617.68041MaRDI QIDQ1822240
Publication date: 1985
Published in: The Visual Computer (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01898355
geometric algorithms; convex polygons; computational geometry; convex hulls; intersection; triangulations of polygons
68Q25: Analysis of algorithms and problem complexity
52A10: Convex sets in (2) dimensions (including convex curves)
52Bxx: Polytopes and polyhedra
Related Items
EDGE ADVANCING RULES FOR INTERSECTING SPHERICAL CONVEX POLYGONS, Three‐dimensional discrete element simulation for granular materials, A novel approach for ellipsoidal outer-approximation of the intersection region of ellipses in the plane, All convex polyhedra can be clamped with parallel jaw grippers
Cites Work