Computing the maximum overlap of two convex polygons under translations
- 1 January 1996
- book chapter
- Published by Springer Nature
- p. 126-135
- https://doi.org/10.1007/bfb0009488
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- On the sectional area of convex polytopesPublished by Association for Computing Machinery (ACM) ,1996
- Area of overlap of translated polygonsPublished by SPIE-Intl Soc Optical Eng ,1993
- A convex polygon among polygonal obstacles: placement and high-clearance motionComputational Geometry, 1993
- The upper envelope of voronoi surfaces and its applicationsDiscrete & Computational Geometry, 1993
- Cutting hyperplanes for divide-and-conquerDiscrete & Computational Geometry, 1993
- An Optimal Algorithm for Intersecting Three-Dimensional Convex PolyhedraSIAM Journal on Computing, 1992
- On dynamic Voronoi diagrams and the minimum Hausdorff distance for point sets under Euclidean motion in the planePublished by Association for Computing Machinery (ACM) ,1992
- Measuring the resemblance of polygonal curvesPublished by Association for Computing Machinery (ACM) ,1992
- Robot Motion PlanningPublished by Springer Nature ,1991
- Generalized Selection and Ranking: Sorted MatricesSIAM Journal on Computing, 1984