Abstract and Applied Analysis

A Novel Model of Conforming Delaunay Triangulation for Sensor Network Configuration

Yan Ma, Yan-ling Hao, and Feng-min Tian

Full-text: Access denied (no subscription detected)

We're sorry, but we are unable to provide you with the full text of this article because we are not able to identify you as a subscriber. If you have a personal subscription to this journal, then please login. If you are already logged in, then you may need to update your profile to register your subscription. Read more about accessing full-text


Delaunay refinement is a technique for generating unstructured meshes of triangles for sensor network configuration engineering practice. A new method for solving Delaunay triangulation problem is proposed in this paper, which is called endpoint triangle’s circumcircle model (ETCM). As compared with the original fractional node refinement algorithms, the proposed algorithm can get well refinement stability with least time cost. Simulations are performed under five aspects including refinement stability, the number of additional nodes, time cost, mesh quality after intruding additional nodes, and the aspect ratio improved by single additional node. All experimental results show the advantages of the proposed algorithm as compared with the existing algorithms and confirm the algorithm analysis sufficiently.

Article information

Abstr. Appl. Anal., Volume 2015, Special Issue (2015), Article ID 720249, 7 pages.

First available in Project Euclid: 16 September 2015

Permanent link to this document

Digital Object Identifier

Mathematical Reviews number (MathSciNet)

Zentralblatt MATH identifier


Ma, Yan; Hao, Yan-ling; Tian, Feng-min. A Novel Model of Conforming Delaunay Triangulation for Sensor Network Configuration. Abstr. Appl. Anal. 2015, Special Issue (2015), Article ID 720249, 7 pages. doi:10.1155/2015/720249. https://projecteuclid.org/euclid.aaa/1442420098

Export citation


  • K. Derr and M. Manic, “Wireless sensor network configuration-part I: mesh simplification for centralized algorithms,” IEEE Transactions on Industrial Informatics, vol. 9, no. 3, pp. 1717–1727, 2013.
  • J. R. Shewchuk and S. Hang, “Higher-quality tetrahedral mesh generation for domains with small angles by constrained delaunay refinement,” in Proceedings of the 30th Annual Symposium on Computational Geometry, pp. 290–299, 2014.
  • M. S. Ebeida, S. A. Mitchell, A. A. Davidson, A. Patney, P. M. Knupp, and J. D. Owens, “Efficient and good Delaunay meshes from random points,” Computer-Aided Design, vol. 43, no. 11, pp. 1506–1515, 2011.
  • M. Qi, T.-T. Cao, and T.-S. Tan, “Computing 2D constrained delaunay triangulation using the GPU,” IEEE Transactions on Visualization and Computer Graphics, vol. 19, no. 5, pp. 736–748, 2013.
  • J. R. Shewchuk, “Reprint of: delaunay refinement algorithms for triangular mesh generation,” Computational Geometry: Theory and Applications, vol. 47, no. 7, pp. 741–778, 2014.
  • M. V. Anglada, “An improved incremental algorithm for constructing restricted delaunay triangulations,” Computers and Graphics, vol. 21, no. 2, pp. 215–223, 1997.
  • L. X. Li and J. R. Tan, “Multiple diagonal exchanging algorithm for inserting constrained boundary in constrained Delaunay triangulation,” Chinese Journal of Computers, vol. 22, no. 10, pp. 1114–1118, 1999.
  • A. J. Hansen and P. L. Levin, “On confirming Delaunay mesh generation,” Advances in Engineering Software, vol. 14, no. 2, pp. 129–135, 1992.
  • J. Ruppert, “A Delaunay refinement algorithm for quality $2$-dimensional mesh generation,” Journal of Algorithms, vol. 18, no. 3, pp. 548–585, 1995.
  • J.-D. Boissonnat, “Shape reconstruction from planar cross sections,” Computer Vision, Graphics and Image Processing, vol. 44, no. 1, pp. 1–29, 1988.
  • O. D. Faugeras, E. Le Bras-Mehlman, and J.-D. Boissonnat, “Representing stereo data with the Delaunay triangulation,” Artificial Intelligence, vol. 44, no. 1-2, pp. 41–87, 1990.
  • H. Edelsbrunner and T. S. Tan, “An upper bound for conforming delaunay triangulations,” Discrete & Computational Geometry, vol. 10, no. 2, pp. 197–213, 1993.
  • Z. Y. Lu, C. K. Wu, and X. N. Zhou, “Overall delaunay triangulation of 2D scattered data with characteristic constrains,” Chinese Journal of Computers, vol. 20, no. 2, pp. 118–124, 1997.
  • N. Sapidis and R. Perucchio, “Delaunay triangulation of arbitrarily shaped planar domains,” Computer Aided Geometric Design, vol. 8, no. 6, pp. 421–437, 1991.
  • V. J. D. Tsai, “Delaunay triangulations in TIN creation: an overview and a linear-time algorithm,” International Journal of Geographical Information Systems, vol. 7, no. 6, pp. 501–524, 1993.
  • F. L. Yi and D. Z. Han, “Delaunay triangulation dividing optimal algorithm with constraint line,” Computer Engineering, vol. 27, no. 6, pp. 32–34, 2001.
  • C.-L. Wei, G.-Y. Xiao, and Y.-H. Zhou, “New algorithm for conforming Delaunay triangulation,” Acta Electronica Sinica, vol. 29, no. 7, pp. 895–898, 2001.
  • X. J. Liu and X. S. Fu, “A study of algorithm for constructing triangulation irregular net (TIN),” China Journal of Highway and Transport, vol. 13, no. 2, pp. 31–36, 2000.
  • O. R. Joseph, Computational Geometry in C, Cambridge University Press, Cambridge, UK, 2nd edition, 1998. \endinput