Summary
This paper presents a new data structure called Voronoi tree to support the solution of proximity problems in general quasimetric spaces with efficiently computable distance functions. We analyse some structural properties and report experimental results showing that Voronoi trees are a proper and very efficient tool for the representation of proximity properties and generation of suitable clusterings.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Dehne F (1986) Optical clustering. The Visual Computer, vol 2. Springer, Berlin, Heidelberg New York London Paris Tokyo
Dehne F, Noltemeier H (1985) Clustering geometric objects and applications to layout problems. Proceedings ‘Computer Graphics 1985’, Tokyo. Springer, Berlin Heidelberg New York Tokyo
Dehne F, Noltemeier H (1985) A computational geometry approach to clustering problems. Proceedings of the 1st ACM SIGGRAPH Symposium on Computational Geometry, Baltimore MD, June 5–7
Dehne F, Noltemeier H (1986) Clustering methods for geometric objects and applications to design problems. The Visual Computer, vol 2. Springer, Berlin Heidelberg New York London Paris Tokyo
Dehne F, Noltemeier H (1987) Voronoi trees and clustering problems. Information Systems, vol 12, no 2, Pergamon Press
Dehne F, Noltemeier H (1987) Voronoi trees and clustering problems in pattern recognition. In: Ferrati G, Pavlidis T, Sanfeliu A, Bunke H (eds) Syntactic and Structural Pattern Recognition. Nato Asi Series. Springer, Berlin Heidelberg New York London Paris Tokyo
Diday E, Simon JC (1980) Clustering analysis. In: Fu KS (ed) Digital Pattern Recognition. Springer, Berlin Heidelberg New York
Dubes J (1980) Clustering methodologies in exploratory data analysis. In: Yovits MC (ed) Advances in Computers, vol 19, Academic Press
Kalantari I, McDonald G (1983) A data structure and an algorithm for the nearest point problem. IEEE Transactions on Software Engineering, vol SE-9, no 5, Sept 83
Murphy OJ, Selkow SM (1986) The efficiency of using k - d trees for finding nearest neighbors in discrete space. Information Proc Letters 23:215–218
Noltemeier H (1985) Distances in hypergraphs. Report, Informatik I, Würzburg
Noltemeier H, Ruland D (1986) Datenmodellierung für Geodatenbanken. In: Informatik-Fachberichte 126:470–482
Shamos, Hoey (1975) Closest point problems. Proc 16th Ann IEEE Symp on Found of Comp Sci
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1987 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Noltemeier, H. (1987). Voronoi Trees. In: Opitz, O., Rauhut, B. (eds) Ökonomie und Mathematik. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-72672-9_35
Download citation
DOI: https://doi.org/10.1007/978-3-642-72672-9_35
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-72673-6
Online ISBN: 978-3-642-72672-9
eBook Packages: Springer Book Archive