Skip to main content
Springer Nature Link
Log in

The Employment of Regular Triangulation for Constrained Delaunay Triangulation

  • Conference paper
Computational Science and Its Applications – ICCSA 2004 (ICCSA 2004)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 3045))

Included in the following conference series:

  • 1122 Accesses

Abstract

We demonstrate a connection between a regular triangulation and a constrained Delaunay triangulation in 2D. We propose an algorithm for edge enforcement in the constrained Delaunay triangulation based on the use of regular triangulation. As far as we know, such a connection has not been presented yet in the literature and there is no algorithm based on this idea, too. This work also serves as a spring-board to higher dimensions.

This work was supported by the Ministry of Education of the Czech Republic—project MSM 23500005.

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

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

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. Anglada, M.V.: An improved incremental algorithm for constructing restricted Delaunay triangulations. Comput. & Graphics 21(2), 215–223 (1997)

    Article  Google Scholar 

  2. Chew, L.P.: Constrained Delaunay Triangulations. In: Proceedings of 3rd Annual Symposium on Computational Geometry, ACM, New York (1987)

    Google Scholar 

  3. Edelsbrunner, H.: Triangulations and meshes in computational geometry. Acia Numerica, 1–81 (2000)

    Google Scholar 

  4. Edelsbrunner, H., Shah, N.R.: Incremental Topological FlippingWorks for Regular Triangulations. In: Proceedings of the 8th Annual Computational Geometry, pp. 43–52. ACM, New York (1992)

    Google Scholar 

  5. Facello, M.A.: Implementation of a randomized algorithm for Delaunay and regular triangulations in three dimensions. Computer Aided Geometric Design 12, 349–370 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  6. Preparata, F.P., Shamos, M.I.: Computational Geometry. Springer, Heidelberg (1985)

    Google Scholar 

  7. Shewchuk, J.R.: A Condition Guaranteeing the Existence of Higher-Dimensional Constrained Delaunay Triangulations. In: Proceedings of the Fourteenth Annual Symposium on Computational Geometry, pp. 76–85. ACM, New York (1998)

    Chapter  Google Scholar 

  8. Shewchuk, J.R.: Sweep Algorithms for Constructing Higher-Dimensional Constrained Delaunay Triangulations. In: Proceedings of the Sixteenth Annual Symposium on Computational Geometry ACM, pp. 350–359 (2000)

    Google Scholar 

  9. Shewchuk, J.R.: Constrained Delaunay Tetrahedralizations and Provably Good Boundary Recovery. To appear in the 11th International Meshing Roundtable (2002)

    Google Scholar 

  10. Shewchuk, J.R.: Robust Adaptive Floating-Point Geometric Predicates. In: Proceedings of the Twelfth Annual Symposium on Computational Geometry, ACM, New York (1996)

    Google Scholar 

  11. Sloan, S.W.: A Fast Algorithm for Generating Constrained Delaunay Triangulations. Computers & Structures 47(3), 441–450 (1993)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and Engineering, University of West Bohemia, Pilsen, Czech Republic

    Pavel Maur & Ivana Kolingerová

Authors
  1. Pavel Maur
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ivana Kolingerová
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Chemistry, University of Perugia, Via Elce di Sotto, 8, I-06123, Perugia, Italy

    Antonio Laganá

  2. Department of Computer Science, University of Calgary, 2500 University Drive N.W., T2N 1N4, Calgary, AB, Canada

    Marina L. Gavrilova

  3. William Norris Professor, Head of the Computer Science and Engineering Department, University of Minnesota, USA

    Vipin Kumar

  4. School of Computing, Soongsil University, Seoul, Korea

    Youngsong Mun

  5. OptimaNumerics Ltd., Cathedral House, 23-31 Waring Street, BT1 2DX, Belfast, UK

    C. J. Kenneth Tan

  6. Department of Mathematics and Computer Science, University of Perugia, via Vanvitelli, 1, I-06123, Perugia, Italy

    Osvaldo Gervasi

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Maur, P., Kolingerová, I. (2004). The Employment of Regular Triangulation for Constrained Delaunay Triangulation. In: Laganá, A., Gavrilova, M.L., Kumar, V., Mun, Y., Tan, C.J.K., Gervasi, O. (eds) Computational Science and Its Applications – ICCSA 2004. ICCSA 2004. Lecture Notes in Computer Science, vol 3045. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24767-8_21

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-24767-8_21

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-24767-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics