Table of Contents Author Guidelines Submit a Manuscript
Abstract and Applied Analysis
Volume 2015, Article ID 720249, 7 pages
http://dx.doi.org/10.1155/2015/720249
Research Article

A Novel Model of Conforming Delaunay Triangulation for Sensor Network Configuration

College of Automation, Harbin Engineering University, Harbin 150001, China

Received 19 August 2014; Accepted 10 September 2014

Academic Editor: Zheng-Guang Wu

Copyright © 2015 Yan Ma et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. 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. View at Publisher · View at Google Scholar · View at Scopus
  2. 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.
  3. 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. View at Publisher · View at Google Scholar · View at Scopus
  4. 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. View at Publisher · View at Google Scholar · View at Scopus
  5. 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. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  6. M. V. Anglada, “An improved incremental algorithm for constructing restricted delaunay triangulations,” Computers and Graphics, vol. 21, no. 2, pp. 215–223, 1997. View at Publisher · View at Google Scholar · View at Scopus
  7. 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. View at Google Scholar · View at MathSciNet
  8. A. J. Hansen and P. L. Levin, “On confirming Delaunay mesh generation,” Advances in Engineering Software, vol. 14, no. 2, pp. 129–135, 1992. View at Publisher · View at Google Scholar · View at Scopus
  9. J. Ruppert, “A Delaunay refinement algorithm for quality 2-dimensional mesh generation,” Journal of Algorithms, vol. 18, no. 3, pp. 548–585, 1995. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  10. J.-D. Boissonnat, “Shape reconstruction from planar cross sections,” Computer Vision, Graphics and Image Processing, vol. 44, no. 1, pp. 1–29, 1988. View at Publisher · View at Google Scholar · View at Scopus
  11. 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. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  12. H. Edelsbrunner and T. S. Tan, “An upper bound for conforming delaunay triangulations,” Discrete & Computational Geometry, vol. 10, no. 2, pp. 197–213, 1993. View at Google Scholar
  13. 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. View at Google Scholar
  14. N. Sapidis and R. Perucchio, “Delaunay triangulation of arbitrarily shaped planar domains,” Computer Aided Geometric Design, vol. 8, no. 6, pp. 421–437, 1991. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  15. 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. View at Publisher · View at Google Scholar · View at Scopus
  16. 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. View at Google Scholar · View at Scopus
  17. 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. View at Google Scholar · View at Scopus
  18. 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. View at Google Scholar
  19. O. R. Joseph, Computational Geometry in C, Cambridge University Press, Cambridge, UK, 2nd edition, 1998. View at Publisher · View at Google Scholar · View at MathSciNet