DocumentCode :
2687476
Title :
Modified quaternary tree bucketing for Voronoi diagrams with multi-scale generators
Author :
Marston, R.E. ; Shih, J.C.
Author_Institution :
Dept. of Comput. Sci., Nottingham Univ., UK
fYear :
1995
fDate :
34810
Firstpage :
42675
Lastpage :
42680
Abstract :
When a Voronoi diagram is constructed incrementally, the quaternary-tree bucketing method of Ohya et. al. provides a useful way of spreading out the insertion order of the generator sites and obtaining initial guesses for the place to insertion them. This reduces the average time complexity of constructing Voronoi diagrams for n generator sites from O(n2) to O(n). We extend Ohya´s method to support the construction of multi-scale Voronoi diagrams, using generator sites that have a discrete scale-value, such as those produced by scale-space image analyses. In order to produce a Voronoi diagram at each scale-level, the original bucketing method needed to be repeatedly re-run and produced less efficient insertion orders and initial guesses for the generators. The new method efficiently builds one Voronoi diagram, starting with the set of coarsest scale generators, then adds details in decreasing order of significance. After an introduction and brief summary of Ohya´s method we describe the new algorithm and some example results. The work may have application in both computer vision and computer graphics or visualisation
Keywords :
computational complexity; computational geometry; computer graphics; computer vision; data visualisation; quadtrees; Voronoi diagrams; coarsest scale generators; computer graphics; computer vision; multi-scale generators; quaternary tree bucketing; scale-space hierarchy; time complexity; visualisation;
fLanguage :
English
Publisher :
iet
Conference_Titel :
Multiresolution Modelling and Analysis in Image Processing and Computer Vision, IEE Colloquium on
Conference_Location :
London
Type :
conf
DOI :
10.1049/ic:19950508
Filename :
477952
Link To Document :
بازگشت