delaunay algorithm
Recently Published Documents


TOTAL DOCUMENTS

10
(FIVE YEARS 1)

H-INDEX

4
(FIVE YEARS 1)

2015 ◽  
Vol 124 ◽  
pp. 317-329 ◽  
Author(s):  
Carlos Bedregal ◽  
Maŕıa-Cecilia Rivara
Keyword(s):  

2013 ◽  
Vol 33 (8) ◽  
pp. 2177-2183
Author(s):  
Zhe WANG ◽  
Sanhong GAO ◽  
Huiying ZHENG ◽  
Lichun LI

2012 ◽  
Vol 263-266 ◽  
pp. 1605-1608
Author(s):  
Yu Ping Zhang ◽  
Zhao Ri Deng ◽  
Rui Qi Zhang

The triangulation of convex hull has the characteristics of point-set and polygon triangulation. According to some relative definitions, this paper proposed a triangulation of convex hull based on a monotonic chain. This method is better than Delaunay algorithm and is more efficient than other convex polygon algorithms. It is a good algorithm.


2009 ◽  
Vol 29 (2) ◽  
pp. 459-461
Author(s):  
Yi-xin LIN ◽  
Dong-feng LIU
Keyword(s):  

Algorithmica ◽  
1999 ◽  
Vol 24 (3-4) ◽  
pp. 243-269 ◽  
Author(s):  
G. E. Blelloch ◽  
G. L. Miller ◽  
J. C. Hardwick ◽  
D. Talmor

Sign in / Sign up

Export Citation Format

Share Document