Skip to main content
Springer Nature Link
Log in

Constrained Delaunay Triangulation Using Delaunay Visibility

  • Conference paper
Advances in Visual Computing (ISVC 2006)

Part of the book series: Lecture Notes in Computer Science ((LNIP,volume 4291))

Included in the following conference series:

Abstract

An algorithm for constructing constrained Delaunay triangulation (CDT) of a planar straight-line graph (PSLG) is presented. Although the uniform grid method can reduce the time cost of visibility determinations, the time needed to construct the CDT is still long. The algorithm proposed in this paper decreases the number of edges involved in the computation of visibility by replacing traditional visibility with Delaunay visibility. With Delaunay visibility introduced, all strongly Delaunay edges are excluded from the computation of visibility. Furthermore, a sufficient condition for DT (CDT whose triangles are all Delaunay) existence is presented to decrease the times of visibility determinations. The mesh generator is robust and exhibits a linear time complexity for randomly generated PSLGs.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Ronfard, R.P., Rossignac, J.R.: Triangulating multiply-connected polygons: A simple, yet efficient algorithm. Computer Graphics Forum 13(3), 281–292 (1994)

    Article  Google Scholar 

  2. Rockwood, A., Heaton, K., Davis, T.: Real-time rendering of trimmed surfaces. Computers & Graphics 23(3), 107–116 (1989)

    Article  Google Scholar 

  3. Sheng, X., Hirsch, B.E.: Triangulation of trimmed surfaces in parametric space. Computer-Aided Design 24(8), 437–444 (1992)

    Article  MATH  Google Scholar 

  4. Obabe, H., Imaoka, H., Tomiha, T., Niwaya, H.: Three dimensional apparel CAD system. Computer & Graphics 26(2), 105–110 (1992)

    Article  Google Scholar 

  5. Zeng, W., Yang, C.L., Meng, X.X., Yang, Y.J., Yang, X.K.: Fast algorithms of constrained Delaunay triangulation and skeletonization for band-images. In: SPIE Defense and Security Symposium, vol. 5403, pp. 337–348 (2004)

    Google Scholar 

  6. Gopi, M., Krishnan, S., Silva, C.T.: Surface reconstruction based on lower dimensional localized Delaunay triangulation. Computer Graphics Forum 19(3), 467–478 (2000)

    Article  Google Scholar 

  7. Nonato, L.G., Minghim, R., Oliveira, M.C.F., Tavares, G.: A novel approach for Delaunay 3D reconstruction with a comparative analysis in the light of applications. Computer Graphics Forum 20(2), 161–174 (2001)

    Article  MATH  Google Scholar 

  8. Marco, A., Michela, S.: Automatic surface reconstruction from point sets in space. Computer Graphics Forum 19(3), 457–465 (2000)

    Article  Google Scholar 

  9. Ho-Le, K.: Finite element mesh generation methods: a review and classification. Computer-Aided Design 20(1), 27–38 (1988)

    Article  MATH  Google Scholar 

  10. Lee, D.T., Lin, A.K.: Generalized Delaunay triangulations. Discrete & Computational Geometry 1, 201–217 (1986)

    Article  MATH  MathSciNet  Google Scholar 

  11. Yang, Y.J., Yong, J.H., Sun, J.G.: An algorithm for tetrahedral mesh generation based on conforming constrained Delaunay tetrahedralization. Computers & Graphics 29(4), 606–615 (2005)

    Article  Google Scholar 

  12. Shewchuk, J.R.: Constrained Delaunay tetrahedralizations and provably good boundary recovery. In: Eleventh International Meshing Roundtable, pp. 193–204 (2002)

    Google Scholar 

  13. Cignoni, P., Montani, C., Perego, R., Scopigno, R.: Parallel 3D Delaunay triangulation. Computer Graphics Forum 12(3), 129–142 (1993)

    Article  Google Scholar 

  14. Edelsbrunner, H., Tan, T.S.: An Upper Bound for Conforming Delaunay Triangulations. Discrete & Computational Geometry 10(2), 197–213 (1993)

    Article  MATH  MathSciNet  Google Scholar 

  15. Nackman, L.R., Srinivasan, V.: Point placement for Delaunay triangulation of polygonal domains. In: Proceeding of Third Canadian Conference Computational Geometry, pp. 37–40 (1991)

    Google Scholar 

  16. Saalfeld, A.: Delaunay edge refinements. In: Proceeding of Third Canadian Conference on Computational Geometry, pp. 33–36 (1991)

    Google Scholar 

  17. Chew, L.P.: Constrained Delaunay triangulations. Algorithmica 4, 97–108 (1989)

    Article  MATH  MathSciNet  Google Scholar 

  18. George, P.L., Borouchaki, H.: Delaunay Triangulation and Meshing: Application to Finite Elements. Hermes, Paris (1998)

    MATH  Google Scholar 

  19. Klein, R.: Construction of the constrained Delaunay triangulation of a polygonal domain. In: CAD Systems Development, pp. 313–326 (1995)

    Google Scholar 

  20. Piegl, L.A., Richard, A.M.: Algorithm and data structure for triangulating multiply connected polygonal domains. Computer & Graphics 17(5), 563–574 (1993)

    Article  Google Scholar 

  21. Bentley, J.L., Weide, B.W., Yao, A.C.: Optimal expected-time algorithms for closest point problems. ACM Transactions on Mathematical Software 6(4), 563–580 (1980)

    Article  MATH  MathSciNet  Google Scholar 

  22. Devillers, O., Estkowski, R., Gandoin, P.M., Hurtado, F., Ramos, P., Sacristan, V.: Minimal Set of Constraints for 2D Constrained Delaunay Reconstruction. International Journal of Computational Geometry and Applications 13(5), 391–398 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  23. Fang, T.P., Piegl, L.: Delaunay triangulation using a uniform grid. IEEE Computer Graphics and Applications 13(3), 36–47 (1993)

    Article  Google Scholar 

  24. Edelsbrunner, H., Mcke, E.P.: Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms. ACM Transactions on Graphics 9(1), 66–104 (1990)

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Software, Tsinghua University, Beijing, China

    Yi-Jun Yang, Hui Zhang, Jun-Hai Yong, Jean-Claude Paul & Jiaguang Sun

  2. Department of Computer Science and Tech., Tsinghua University, Beijing, China

    Yi-Jun Yang & Jiaguang Sun

  3. Institute of Computing Technology, Chinese Academy of Sciences, Beijing, China

    Wei Zeng

Authors
  1. Yi-Jun Yang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Hui Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Jun-Hai Yong
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Wei Zeng
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Jean-Claude Paul
    View author publications

    You can also search for this author in PubMed Google Scholar

  6. Jiaguang Sun
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science and Engineering, University of Nevada, Reno, USA

    George Bebis

  2. NASA Ames Research Center, Moffett Field, CA, USA

    Richard Boyle

  3. Lawrence Berkeley National Laboratory, Berkeley, CA, USA

    Bahram Parvin

  4. Desert Research Institute, Reno, NV, USA

    Darko Koracin

  5. Digital Image Research Center, Kingston University, London, UK

    Paolo Remagnino

  6. Intel, 95052, Santa Clara, CA, USA

    Ara Nefian

  7. University of California, 430, Computer Science Building, 92697-3425, Irvine, CA, USA

    Gopi Meenakshisundaram

  8. Institute for Data Analysis and Visualization, P.O. Box

    Valerio Pascucci

  9. Department of Computer Science and Engineering, Czech Technical University in Prague, Czech

    Jiri Zara

  10. Rockwell Scientific, 1049 Camino Dos Rios, 91360, Thousand Oaks, CA, USA

    Jose Molineros

  11. Computer Graphics Group, Bielefeld University, D-33501, Bielefeld, Germany

    Holger Theisel

  12. Hewlett Packard Labs, Palo Alto, CA, USA

    Tom Malzbender

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Yang, YJ., Zhang, H., Yong, JH., Zeng, W., Paul, JC., Sun, J. (2006). Constrained Delaunay Triangulation Using Delaunay Visibility. In: Bebis, G., et al. Advances in Visual Computing. ISVC 2006. Lecture Notes in Computer Science, vol 4291. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11919476_68

Download citation

  • DOI: https://doi.org/10.1007/11919476_68

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-48628-2

  • Online ISBN: 978-3-540-48631-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics