Fig 1.
The algorithm to find the LIC based on Voronoi and medial axis.
(a) Voronoi diagram of a simple polygon. (b) Medial axis diagram of a simple polygon. (c) Voronoi diagram of a complex polygon. (d) Medial axis diagram of a complex polygon.
Fig 2.
Voronoi generation tree based on “divide-and-conquer” method.
Fig 3.
Voronoi diagram generation algorithm based on the binary tree principle for a simple polygon.
Fig 4.
Several basic Voronoi diagram generation results.
(a) Voronoi calculation method for a line segment. (b) Voronoi calculation method for a point and a line segment. (c) Voronoi calculation method for two segments. (d) Voronoi calculation method (∠ABC is an acute angle). (e) Voronoi calculation method (∠ABC is an obtuse angle).
Table 1.
Algorithm to seek the LIC.
Fig 5.
Comparison charts of medial axis simplification and LIC seeking.
Table 2.
Intersection number comparison for MAS.
Table 3.
Pseudo code of ACEP in C++.
Table 4.
Efficiency comparison of different data partition policies.
Fig 6.
Time comparison of different data partition policy in Tab.4.