Discrete construction of order-k voronoi diagram

Authors:
Ye Zhao;Shu-juan Liu;Yi-li Tan
Affiliations:
Department of Mathematics and Physics, Shijiazhuang Tiedao University, Hebei, Shijiazhuang, China;Mathematics and Information Science College, Hebei Normal University, Hebei, Shijiazhuang, China;College of Science, Hebei Polytechnic University, Hebei, Tangshan, China
Venue:
ICICA'10 Proceedings of the First international conference on Information computing and applications
Year:
2010

Citing 3
Cited 0

Interactive 3D distance field computation using linear factorization

I3D '06 Proceedings of the 2006 symposium on Interactive 3D graphics and games
Farthest line segment Voronoi diagrams

Information Processing Letters
Higher-order Voronoi diagrams on triangulated surfaces

Information Processing Letters

Quantified Score

Hi-index	0.03

Visualization

Abstract

The order-k Voronoi diagrams are difficult to construct because of their complicated structures. In traditional algorithm, production process was extremely complex. While discrete algorithm is only concerned with positions of generators, so it is effective for constructing Voronoi diagrams with complicated shapes of Voronoi polygons. It can be applied to order- k Voronoi diagram with any generators, and can get over most shortcomings of traditional algorithm. So it is more useful and effective. Model is constructed with discrete algorithm. And the application example shows that the algorithm is both simple and useful, and it is of high potential value in practice.