Separating two simple polygons by a sequence of translations (Q1104080): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 02:13, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Separating two simple polygons by a sequence of translations |
scientific article |
Statements
Separating two simple polygons by a sequence of translations (English)
0 references
1988
0 references
Let P and Q be two disjoint simple (not necessarily convex) polygons. The authors present an algorithm which determines whether Q can be moved by a sequence of translations to a position sufficiently far from P without colliding with P, and which produces such a motion if it exists. For earlier research on translational separability of planar objects, see \textit{G. T. Toussaint}, Computational geometry, Mach. Intell. Pattern Recognition 2, 335-375 (1985; Zbl 0588.68053).
0 references
inverse Ackermann function
0 references
optimal algorithm
0 references
separating polygons. translational separability of planar objects
0 references
Computational geometry
0 references
