Table 2.
Number of boundary vertices | Generate P min | Generate P refine | Generate P final | |
---|---|---|---|---|
O (N 3) time complexity of Barequet and Sharir [18] | O(N log N) time complexity of method in this paper | (including time consumed during generating P min ) | (including time consumed during generating P refine) | |
241 | 91.40s (241V/239T) | 0.015s (241V/239T) | 0.297s (4581V/8826T) | 1.005s (5264V/10182T) |
437 | 191.844s (437V/435T) | 0.016s (437V/435T) | 0.392s (6031V/11636T) | 1.232s (6844V/12962T) |
587 | 1408.14s (857V/855T) | 0.031s (857V/855T) | 0.173s (2663V/4628T) | 0.677s (2733V/4828T) |
1769 | 12762.3s (1769V/1767T) | 0.062s (1769V/1767T) | 0.328s (4559V/7342T) | 1.104s (4743V/7986T) |