๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Finding local maxima in a pseudo-euclidean distance transform

โœ Scribed by Carlo Arcelli; Gabriella Sanniti di Baja

Book ID
103913104
Publisher
Elsevier Science
Year
1988
Weight
51 KB
Volume
43
Category
Article
ISSN
0734-189X

No coin nor oath required. For personal study only.

โœฆ Synopsis

The octree representation of three-dimensional objects based on the principle of recursive subdivision is a generalization of two-dimensional quadtrees. It has been studied for use in many application areas such as solid modeling, computer graphics, computer-aided design/manufacturing, computer vision, image processing, and robotics. Many algorithms related to octrees have been developed in these application areas. In this paper, we divide these algorithms into two catagories, construction and manipulation of octrees, and give a detailed survey of them.

NOTES f'itulihg

๐Ÿ“œ SIMILAR VOLUMES

Finding local maxima in a pseudo-Euclidi
Finding local maxima in a pseudo-Euclidian distance transform
โœ Carlo Arcelli; Gabriella Sanniti di Baja ๐Ÿ“‚ Article ๐Ÿ“… 1988 ๐Ÿ› Elsevier Science โš– 484 KB

Weighted distance transforms computed by using suitable integer weights are au adequate approximation to the Euclidean distance transform. In tbis paper, a criterion is introduced for identifyhg the local maxima in a specific weighted distance transform. The reverse weighted distance transformation

A Non-metric Procedure for Transforming
A Non-metric Procedure for Transforming Dissimilarities to Euclidean Distances Useful in Numerical Taxonomy and Ecology
โœ L. P. Lefkovitch ๐Ÿ“‚ Article ๐Ÿ“… 1989 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 995 KB

Engineering and Statistical Research Centre Agriculture Canada Contribution No. 1-727 from the Engineering and Statistical Reeearch Centre Summu y Because (a) in agglomerative cluster analysis, i t is the smallest dissimilarities which are used, (b) in numerical ecology, little or no information is