The Algorithm of Points Set Extracting from 2D Voronoi Diagram Based on Crystal Growth

Article Preview

Abstract:

The outputs of constructing voronoi diagram with crystal growth algorithm are pixel points set. A whole methodology of extraction of pixel points set is introduced and magnifier scanning algorithm (MSA) which is used to identifying voronoi vertexes and edges is explained in detail. Experiments show that the methodology and MSA is clear and accurate to weighted voronoi diagram.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

2249-2252

Citation:

Online since:

October 2011

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2012 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] F. Aurenhammer, R. klein, Voronoi Diagrams[R], Resarch Concerning Voronoi diargrams, www. pi6. fernuni-hagen. de/publ/tr198. pdf.

Google Scholar

[2] Zhang Youhui, A Method to Draw Weighed Voronoi Diagram, Computer Science [J], 2001, 8(26): 126-130(in Chinese).

Google Scholar

[3] Zhang Youhui, Asano Tetsuo, Obokata Koji, Research On Voronoi Diagrams for General Figures By Approximation Structuring[J], Journal On Numerical Methods And Computer Applications, 2002, 23(3): 216-225(in Chinese).

Google Scholar

[4] Kei Kobayashi, Kokichi Sugihara, Crystal Voronoi diagram and its applications[J], Future Generation Computer Systems, 2002, 18(5): 681-692.

DOI: 10.1016/s0167-739x(02)00033-x

Google Scholar

[5] Schaudt, B.F.; Drysdale, R.L. Multiplicatively weighted crystal growth voronoi diagrams[C] , Proceedings of the Seventh Annual Symposium on Computational Geometry, NY. USA, 1991: 214-223.

DOI: 10.1145/109648.109672

Google Scholar