On separating two simple polygons by a single translation
- 1 June 1989
- journal article
- research article
- Published by Springer Nature in Discrete & Computational Geometry
- Vol. 4 (3) , 265-278
- https://doi.org/10.1007/bf02187729
Abstract
No abstract availableKeywords
This publication has 19 references indexed in Scilit:
- Translating polygons in the planePublished by Springer Nature ,2005
- Separability of pairs of polygons through single translationsRobotica, 1987
- Shortest path solves edge-to-edge visibility in a polygonPattern Recognition Letters, 1986
- Separation of two monotone polygons in linear timeRobotica, 1984
- Euclidean shortest paths in the presence of rectilinear barriersNetworks, 1984
- Geodesic methods in quantitative image analysisPattern Recognition, 1984
- On Removing a Ball without Disturbing the OthersMathematics Magazine, 1984
- On translating a set of line segmentsComputer Vision, Graphics, and Image Processing, 1983
- Testing a simple polygon for monotonicityInformation Processing Letters, 1981
- A linear algorithm for finding the convex hull of a simple polygonInformation Processing Letters, 1979