Research ArticleOpen AccessGoogle Scholar indexed
Research on Algorithm of the Point Set in the Plane Based on Delaunay Triangulation
School of Information Engineering, Beijing Institute of Fashion Technology, Beijing, China
School of Information Engineering, Beijing Institute of Fashion Technology, Beijing, China
- 1 School of Information Engineering, Beijing Institute of Fashion Technology, Beijing, China
- 2 School of Information Engineering, Beijing Institute of Fashion Technology, Beijing, China
American Journal of Computational Mathematics·Volume 02 (2012)·Pages 336–340·Published 18 December 2012·DOI10.4236/ajcm.2012.24046
Copy link · social · email
Abstract
In the paper, an improved algorithm is presented for Delaunay triangulation of the point-set in the plain. Based on the original algorithm, we propose the notion of removing circle. During the process of triangulation, and the circle dynamically moves, the algorithm which is simple and practical, therefore evidently accelerates the process of searching a new point, while generating a new triangle. Then it shows the effect of the algorithm in the finite element mesh.
KeywordsPoint-Set in the PlaneDelaunay TriangulationRemoving CircleFinite Element Mesh
- Q.-L. Li, “Three-Dimensional Modeling Based on the Statue of Point Cloud Data,” Master’s Thesis, Tongji University, Shanghai, 2009.
- G.-H. Peng, “Technical Research on Surface Reconstruction Based on Scattered Data,” Master’s Thesis, Northwestern Polytechnical University, Fremont, 2006:
- Y. Huang, W. Yu and T. Chen, “Three-Dimensional Body Scanning System for Apparel Mass Customization,” Optical Engineering, Vol. 41, No. 7, 2002, pp. 1475-1479. doi:10.1117/1.1478700
- W. Sun, C. Bradley, Y. E. Zhang and H. T. Loh, “Cloud Data Modeling Employing a Unified Non-Redundant Triangular Mesh,” Computer-Aided Design, Vol. 33, No. 2, 2001, pp. 183-193.
- R. Sibson, “Locally Equiangular Triangulation,” Computer Journal, Vol. 21, No. 3, 1977, pp. 243-245. doi:10.1093/comjnl/21.3.243
- H.-B. Ling and B. Wu, “An Improved Algorithm for Auto-Connection Delaunay Triangulation,” Computer Application, Vol. 19, No. 12, 1999, pp. 10-12.
- L. Guibas, “Basic Algorithms and Combinatorics in Compu-Tatinal,” Worksh on Computational Geometry, 1986, p. 119.
- Z. Zhou and R.-T. Liu, “A New Triangulation Algorithm of the Point Set in the Plane,” Journal of Harbin University of Science and Technology, Vol. 12, No. 2, 2007, pp. 78-80.
- P.-D. Zhou, “The Algorithm for Triangulation of the Pint Set in the Plane,” Journal of Computer Aided Design and Computer Graphics, Vol. 8, No. 4, 1996, pp. 259-264.
- X.-D. Li, “Algorithm Implementation of Two-Dimension and Multi-Dimension Linked Lists,” Journal of Foshan Institute of Science and Technology, Vol. 21, No. 3, 2003, pp. 35-38.
- A.-J. Chen, J.-D. Li and D.-D. Li, “Improved Randomized Algorithm for Circle Detection,” Opto-Electronic Engineering, Vol. 33, No. 12, 2006, pp. 92-93.
- J.-R. Wang and H.-T. Zheng, “The Projection Model and Application Based on Oval and Round,” Mathematics of Shanghai Middle School, Vol. 6, 2007, p. 47.