Delaunay triangulation of non-uniform point distributions by means of multi-grid insertion

Finite Elements in Analysis and Design

Volumn 63, Issue , 2013, Pages 8-22

  Lo, S H ^a  

^a UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

Delaunay triangulation; Kd tree insertions; Multi grid; Non uniform point distributions; Regular grid

Indexed keywords

DELAUNAY TRIANGULATION; KD-TREE; MULTI-GRID; NON-UNIFORM POINT DISTRIBUTIONS; REGULAR GRIDS;

FORESTRY;

TRIANGULATION;

ALGORITHMS; FINITE ELEMENT ANALYSIS; FORESTRY;

EID: 84865979540     PISSN: 0168874X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.finel.2012.08.005     Document Type: Article

References (23)

1. Neculai Archip, Robert Rohling, Vincent Dessenne, Pierre-Jean Erard, and Lutz Peter Nolte Anatomical structure modeling from medical images Comput. Methods Programs Biomed. 82 2006 203 215 (Pubitemid 43850053)
2. H. Borouchaki, and S.H. Lo Fast Delaunay triangulation in three dimensions Comput. Methods Appl. Mech. Eng. 128 1995 153 167 (Pubitemid 26442387)
3. Peter Su, and Robert L. Scot Drysdale A comparison of sequential Delaunay triangulation algorithms Comput. Geom. 7 1997 361 385 (Pubitemid 127371609)
4. B. Delaunay Sur la sphere vide Bull. Acad. Sci. URSS Class. Sci. Nat. 1934 793 800
5. R.A. Dwyer A faster divide-and-conquer algorithm for constructing Delaunay triangulations Algorithmica 2 1987 137 151
6. C.A. Shaffer, and H. Samet Optimal Quadtree construction algorithms Comput. Vision Graphics Image Process. 37 3 1987 402 419
7. Kun Zhou, Minmin Gong, Xin Huang, and Baining Guo Data-parallel Octree for surface reconstruction IEEE Trans. Vis. Comput. Graphics 17 5 2011 669 681
8. C. Lemaire, and J.M. Moreau A probabilistic result on multi-dimensional Delaunay triangulations, and its application to the 2D case Comput. Geom. 17 2000 69 96
9. B. Joe Construction of three-dimensional Delaunay triangulations using local transformations Comput. Aided Geom. Design 10 4 1989 123 142
10. H. Edelsbrunner, and N.R. Shah Incremental topological flipping works for regular triangulations Algorithmica 15 1996 223 241 (Pubitemid 126418811)
11. 〈http://cm.bell-labs.com/netlib/voronoi/hull.html〉.
12. 〈ftp://ftp.ncsa.uiuc.edu/Visualization/Alpha-shape/〉
13. N. Amenta, S. Choi, and G. Rote Incremental constructions con BRIO Proc. 19th Annu. ACM Sympos. Comput. Geom. 2003 ACM Press New York pp. 211-219
14. Y. Liu, and J. Snoeyink A comparison of five implementations of 3d Delaunay tesselation J.E. Goodman, J. Pach, E. Welzl, Combinatorial and Computational Geometry. MSRI Publications 52 2005 Cambridge University 439 458
15. S. Zhou, and C.B. Jones HCPO: an efficient insertion order for incremental Delaunay triangulation Inf. Process. Lett. 93 1 2005 37 42
16. Jean-Daniel Boissonnat, Olivier Devillers, Samuel Hornus, Incremental construction of the delaunay triangulation and the delaunay graph in medium dimension. in: Proceedings of the 25th Annual Symposium on Computational Geometry, Aarhus, Denmarked, June 08-10, 2009
17. K. Buchin, Organizing point sets: space-filling curves, Delaunay tessellations of random point sets, and flow complexes, Ph.D. Thesis, Free University Berlin, 2007.
18. K. Buchin, Constructing Delaunay triangulations along space-filling curves. In Proc. 2nd Internat. Sympos. Voronoi Diagrams in Science and Engineering, Seoul, Korea, 2005, pp. 184-195.
19. G. Peano Sur une courbe, qui remplit toute une aire plane Math. Ann. 36 1890 157 160
20. D. Hilbert Über die stetige Abbildung einer Linie auf ein Flächenstück Math. Ann. 38 1891 459 460
21. Liu, Jianfei, Yan, Jinhui, S.H. Lo, A new insertion sequence for incremental Delaunay triangulation, Comput. Geom. Theory Appl., submitted for publication.
22. L. Devroye, J. Jabbour, and C. Zamora-Cura Squarish k-d trees SIAM J. Comput. 30 5 2000 1678 1700 (Pubitemid 33099794)
23. L. Devroye, C. Lemaire, and J.M. Moreau Expected time analysis for Delaunay point location Comput. Geom. 29 2004 61 89