Computing some distance functions between polygons
- 31 December 1991
- journal article
- Published by Elsevier in Pattern Recognition
- Vol. 24 (8) , 775-781
- https://doi.org/10.1016/0031-3203(91)90045-7
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Optimal merging and sorting on the EREW PRAMInformation Processing Letters, 1989
- Optimal matching of convex polygonsPattern Recognition Letters, 1989
- Adaptive Bitonic Sorting: An Optimal Parallel Algorithm for Shared-Memory MachinesSIAM Journal on Computing, 1989
- AnO(n logn) algorithm for the voronoi diagram of a set of simple curve segmentsDiscrete & Computational Geometry, 1987
- Fast detection of polyhedral intersectionTheoretical Computer Science, 1983
- A linear time algorithm for the Hausdorff distance between convex polygonsInformation Processing Letters, 1983
- A new linear algorithm for intersecting convex polygonsComputer Graphics and Image Processing, 1982
- Maintenance of configurations in the planeJournal of Computer and System Sciences, 1981
- Triangulating a simple polygonInformation Processing Letters, 1978
- The Parallel Evaluation of General Arithmetic ExpressionsJournal of the ACM, 1974