Skip to Main Content
ASME Press Select Proceedings

International Conference on Electronics, Information and Communication Engineering (EICE 2012)

By
Garry Lee
Garry Lee
Information Engineering Research Institute
Search for other works by this author on:
ISBN:
9780791859971
No. of Pages:
1008
Publisher:
ASME Press
Publication date:
2012

To improve the speed of constructing triangle irregular network (TIN), We propose an efficient Delaunay triangle network construction algorithm. Firstly, we divide the discrete points set into blocks according to a certain threshold to construct sub-block index binary tree, then, Delaunay triangle network for each block is constructed with Graham scanning technology, finally, the sub-blocks which have the same parent node are merged bottom-up. Compared with other algorithms by the experiment, the high efficiency in network construction of the algorithm in this paper is verified.

Abstract
Keywords
Introduction
Binary Tree Division for Points Set
Construction of Delaunay Triangle Network
Conclusion
Acknowledgements
References
This content is only available via PDF.
Close Modal
This Feature Is Available To Subscribers Only

Sign In or Create an Account

Close Modal
Close Modal