Estimating shortest paths and minimal distances on digitized three-dimensional surfaces
- 30 November 1993
- journal article
- Published by Elsevier in Pattern Recognition
- Vol. 26 (11), 1623-1637
- https://doi.org/10.1016/0031-3203(93)90018-r
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Estimation of the original length of a straight line segment from its digitization in three dimensionsPattern Recognition, 1992
- Optimization of length measurements for isotropic distance transformations in three dimensionCVGIP: Image Understanding, 1992
- Local distances for distance transformations in two and three dimensionsPattern Recognition Letters, 1991
- Estimation of length for digitized straight lines in three dimensionsPattern Recognition Letters, 1990
- A numerical solution to the generalized mapmaker's problem: flattening nonconvex polyhedral surfacesIEEE Transactions on Pattern Analysis and Machine Intelligence, 1989
- Design of perimeter estimators for digitized planar shapesIEEE Transactions on Pattern Analysis and Machine Intelligence, 1989
- An efficient uniform cost algorithm applied to distance transformsIEEE Transactions on Pattern Analysis and Machine Intelligence, 1989
- Computing minimal distances on polyhedral surfacesIEEE Transactions on Pattern Analysis and Machine Intelligence, 1989
- Computing distance transformations in convex and non-convex domainsPattern Recognition, 1987
- Computer Processing of Line-Drawing ImagesACM Computing Surveys, 1974