Polygon placement under translation and rotation

DOI10.1051/ita/1989230100051zbMath0665.68037OpenAlexW248258410MaRDI QIDQ3816980

Francis Avnaim, Jean-Daniel Boissonnat

Publication date: 1989

Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/92325

zbMATH Keywords

rotationtranslationcomputational geometrypolygon containment problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Software, source code, etc. for problems pertaining to convex and discrete geometry (52-04)

Related Items (5)

A new algorithm for the two-polygon containment problem ⋮ Knowledge based approach to the cutting stock problem ⋮ A fully general, exact algorithm for nesting irregular shapes ⋮ Optimal clustering of a pair of irregular objects ⋮ Containment of a single polygon using mathematical programming

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A new efficient motion-planning algorithm for a rod in two-dimensional polygonal space
• An efficient motion-planning algorithm for a convex polygonal object in two-dimensional polygonal space
• On the number of critical free contacts of a convex polygonal object moving in two-dimensional polygonal space
• On the “piano movers'” problem I. The case of a two-dimensional rigid polygonal body moving amidst polygonal barriers
• Primitives for the manipulation of general subdivisions and the computation of Voronoi
• A fast algorithm for the Boolean masking problem

This page was built for publication: Polygon placement under translation and rotation