An integrated method of raster and vector for generating a Voronoi diagram based on linear quadtree structure

  title={An integrated method of raster and vector for generating a Voronoi diagram based on linear quadtree structure},
  author={Jiatian Li and Renliang Zhao and Jun Chen},
  booktitle={China Symposium on Remote Sensing},
Voronoi Diagram is a fundamental geometric structure of space partition. To generate the Voronoi diagrams of the line or polygon objects, the raster method is more convenient than the vector method, while raster generation works better with the generation of full-feature Voronoi Diagram. But for the vector data, the computation in the raster method is realized based on the partition of space. So the generation algorithm is high level of space complexity and the obtaining the neighbors of pixel… Expand
2 Citations
A parallel algorithm for constructing Voronoi diagrams based on point‐set adaptive grouping
A parallel algorithm for constructing Voronoi diagrams based on point‐set adaptive grouping using the binary tree splitting method is presented, and its time complexity is calculated as a function of the size of the point set, the number of processors, the average number of points in each block, and thenumber of boundary points. Expand
Study on the marketing area's building method based on Voronoi polygon - an example of feed industry enterprises of anhui province
  • X. He, Xiaodong Zhang, Dehai Zhu
  • Computer Science
  • Proceedings. 2005 IEEE International Geoscience and Remote Sensing Symposium, 2005. IGARSS '05.
  • 2005
The hierarchy model of centricity intensity is put forward, and the characteristics of the marketing area in term of the hierarchy method are ascertained, and a new marketing area building method of weighted-Voronoi polygon based on raster data is proposed. Expand


A Hierarchical Raster Method for Computing Voronoi Diagrams Based on Quadtrees
A hierarchical method is described for computing generalized Voronoi diagrams by means of hierarchical distance transform and hierarchical morphological operators based on the quadtree structure. Expand
An efficient use of quadtrees in a geographical information system
  • M. Gahegan
  • Computer Science
  • Int. J. Geogr. Inf. Sci.
  • 1989
A compacted version of the linear quadtree and a spatially-referenced index method that can significantly reduce the storage requirements of a set of images and the time taken to process spatial queries are presented. Expand
New algorithms for euclidean distance transformation of an n-dimensional digitized picture with applications
Four algorithms to perform the transformation which are constructed by the serial composition of n -dimensional filters are presented, which are faster than the method by H. Yamada for a two-dimensional picture. Expand
Voronoi tessellation and Delauney triangulation using Euclidean disk growing in Z/sup 2/
A novel approximation of Euclidean distance in Z/sup 2/ is proposed, and a novel algorithm for the computation of Voronoi tessellation and Delauney triangulation is presented based on thisExpand
Fast raster scan distance propagation on the discrete rectangular lattice
It is shown that simple (raster scan) sequential algorithms for computing Euclidean Distance Transforms can be implemented in an optimized manner from the point of view of numerical computations. Expand
Fast Euclidean Distance Transformation by Propagation Using Multiple Neighborhoods
A new exact Euclidean distance transformation by propagation, using bucket sorting, is proposed and it is shown that it is both smaller and less image-dependent than all other DTs recently proposed. Expand
Neighbor finding techniques for images represented by quadtrees
  • H. Samet
  • Computer Science
  • Comput. Graph. Image Process.
  • 1982
Algorithms are given for determining adjacencies in the horizontal, vertical, and diagonal directions and the execution times of the algorithms are analyzed using a suitably defined model. Expand
Distance transformations in digital images
  • G. Borgefors
  • Mathematics, Computer Science
  • Comput. Vis. Graph. Image Process.
  • 1986
Six different distance transformations, both old and new, are used for a few different applications, which show both that the choice of distance transformation is important, and that any of the six transformations may be the right choice. Expand
Fast Euclidean distance transformation in two scans using a 3 × 3 neighborhood
  • F. Shih, Yi-Ta Wu
  • Mathematics, Computer Science
  • Comput. Vis. Image Underst.
  • 2004
This work proposes a new, simple and fast EDT in two scans using a 3 × 3 neighborhood, and develops an optimal two-scan algorithm to achieve the EDT correctly and efficiently in a constant time without iterations. Expand
Fast erosion and dilation by contour processing and thresholding of distance maps
  • I. Ragnemalm
  • Mathematics, Computer Science
  • Pattern Recognit. Lett.
  • 1992
The proposed algorithm performs ordered propagation using Euclidean distance transformation without generating any distance map, which allows optimization of both the time and memory demand. Expand