Separating two simple polygons by a sequence of translations
Publication:1104080
DOI10.1007/BF02187902zbMath0646.68052OpenAlexW2049742898MaRDI QIDQ1104080
Micha Sharir, Shmuel Sifrony, Richard Pollack
Publication date: 1988
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/131041
Computational geometryoptimal algorithminverse Ackermann functionseparating polygons. translational separability of planar objects
Analysis of algorithms and problem complexity (68Q25) Polyhedra and polytopes; regular figures, division of spaces (51M20) Convex sets in (2) dimensions (including convex curves) (52A10) Geometric constructions in real or complex geometry (51M15)
Related Items (29)
Cites Work
- Unnamed Item
- Unnamed Item
- Visibility and intersection problems in plane geometry
- On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles
- Planning a purely translational motion of a convex object in two- dimensional space using generalized Voronoi diagrams
- Nonlinearity of Davenport-Schinzel sequences and of generalized path compression schemes
- Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
- 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
- A linear time algorithm for minimum link paths inside a simple polygon
- Erratum: An $O(n\log \log n)$-Time Algorithm for Triangulating a Simple Polygon
This page was built for publication: Separating two simple polygons by a sequence of translations