Skip to main content
SpringerLink
Log in

Validation and Storage of Polyhedra through Constrained Delaunay Tetrahedralization

  • Conference paper
Geographic Information Science (GIScience 2008)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 5266))

Included in the following conference series:

Abstract

Closed, watertight, 3D geometries are represented by polyhedra. Current data models define these polyhedra basically as a set of polygons, leaving the test on intersecting polygons or open gaps to external validation rules. If this testing is not performed well, or not at all, non-valid polyhedra could be stored in geo-databases. This paper proposes the utilization of the Constrained Delaunay Tetrahedralization (CDT) for the validation (i.e. check on self-intersecting and closeness) of polyhedra on the one hand, and the efficient storage of valid polyhedra on the other hand. The paper stresses on the decomposition of a polyhedron through a CDT and the possibility to store and compose the polyhedron through the vertices of the CDT, a bitmap that indicates which faces of the Delaunay Tetrahedralization (DT) links to a CDT-face, and a list of non-recovered CDT-faces.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 89.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 119.00
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

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.

References

  1. Arens, C., Stoter, J., van Oosterom, P.: Modelling 3D spatial objects in a geo-dbms using a 3D primitive. Computers & Geosciences 31, 165–177 (2005)

    Article  Google Scholar 

  2. OGC: Implementation specification for geographic information - simple feature access (2006), http://www.opengeospatial.org/standards/sfa

  3. Kazar, B.M., Kothuri, R., van Oosterom, P., Ravada, S.: On valid and invalid three-dimensional geometries. In: Advances in 3D Geoinformation Systems (2008)

    Google Scholar 

  4. ISO: 19107 (2003), http://www.iso.org

  5. GML: The geographic markup language specification, version 3.3.1 (2003), www.opengeospatial.org/standards/gml

  6. van Oosterom, P., Quak, W., Tijssen, T.: About invalid, valid and clean polygons. In: Fisher, P.F. (ed.) Developments in Spatial Data Handling, 11th International Symposium on Spatial Data Handling, pp. 19–48 (2004)

    Google Scholar 

  7. Kettner, L.: CGAL Manual. In: 3D Polyhedral Surfaces, ch. 12 (2008), http://www.cgal.org/Manual/3.3/doc_html/cgal_manual/Polyhedron/Chapter_main.html

  8. Verbree, E.: Encoding and decoding of planar maps through Conforming Delaunay Triangulations. In: ISPRS Workshop on multiple representation and interoperability of spatial data (2006)

    Google Scholar 

  9. CGAL: Computational Geometry Algorithms Library (2007), http://www.cgal.org

  10. Verbree, E.: Piecewise linear complex representation through Conforming Delaunay Tetrahedronization. In: Raubal, M., Miller, H.J., Frank, A.U., Goodchild, M.F. (eds.) GIScience 2006. LNCS, vol. 4197, pp. 385–388. Springer, Heidelberg (2006)

    Google Scholar 

  11. Edelsbrunner, H., Tan, T.S.: An upper bound for conforming Delaunay triangulations. SIAM Journal on Computing 22, 527–551 (1993)

    Article  MATH  MathSciNet  Google Scholar 

  12. Penninga, F., van Oosterom, P.: A Simplicial Complex-based DBMS Approach To 3D Topographic Data Modelling. International Journal of Geographical Information Science 22, 751–779 (2008)

    Article  Google Scholar 

  13. Penninga, F., van Oosterom, P.: Updating Features in a TEN-based DBMS approach for 3D Topographic Data Modelling. In: Raubal, M., Miller, H.J., Frank, A.U., Goodchild, M.F. (eds.) GIScience 2006. LNCS, vol. 4197, pp. 147–152. Springer, Heidelberg (2006)

    Google Scholar 

  14. Edelsbrunner, H.: Geometry and topology for mesh generation. Cambridge University Press, Cambridge (2001)

    MATH  Google Scholar 

  15. Ziegler, G.M.: Lectures on Polytopes. Graduate Texts in Mathematics, vol. 152. Springer, New York (1995)

    MATH  Google Scholar 

  16. Delaunay, B.N.: Sur la sphère vide. Izvestia Akademii Nauk SSSR, Otdelenie Matematicheskikh i Estestvennykh Nauk 7, 793–800 (1934)

    Google Scholar 

  17. Aurenhammer, F.: Voronoi diagrams – a study of fundamental geometric data structure. ACM Comput. Surveys 23, 345–405 (1991)

    Article  Google Scholar 

  18. Schönhardt, E.: Über die zerlegung von dreieckspolyedern in tetraeder. Mathematische Annalen 98, 309–312 (1928)

    Article  MathSciNet  Google Scholar 

  19. Ruppert, J., Seidel, R.: On the difficulty of triangulating three-dimensional non-convex polyhedra. Discrete and Computational Geometry 7, 227–253 (1992)

    Article  MATH  MathSciNet  Google Scholar 

  20. Murphy, M., Mount, D.M., Gable, C.W.: A point-placement strategy for conforming Delaunay tetrahedralizations. In: Proc. 11th annual ACM-SIAM Symposium on Discrete Algorithms, pp. 67–74 (2000)

    Google Scholar 

  21. Cohen-Steiner, D., De Verdière, E.C., Yvinec, M.: Conforming Delaunay triangulation in 3D. In: Proc. 18th annual ACM Symposium on Computational Geometry (2002)

    Google Scholar 

  22. Cheng, S.W., Poon, S.H.: Graded conforming Delaunay tetrahedralization with bounded radius-edge ratio. In: Proc. 14th annual ACM-SIAM Symposium on Discrete Algorithms, pp. 295–304 (2003)

    Google Scholar 

  23. Chazelle, B.: Convex partition of a polyhedra: a lower bound and worest-case optimal algorithm. SIAM Journal on Computing 13, 488–507 (1984)

    Article  MATH  MathSciNet  Google Scholar 

  24. Chazelle, B., Palios, L.: Triangulating a nonconvex polytope. Discrete and Computational Geometry 5, 505–526 (1990)

    Article  MATH  MathSciNet  Google Scholar 

  25. Shewchuk, J.R.: General-dimensional constrained Delaunay and constrained regular triangulations I: Combinatorial properties. Discrete and Computational Geometry (2008)

    Google Scholar 

  26. Si, H., Gärtner, K.: Meshing piecewise linear complexes by constrained Delaunay tetrahedralizations. In: Proc. 14th International Meshing Roundtable, San Diego, CA, USA, Sandia National Laboratories, pp. 147–163 (2005)

    Google Scholar 

  27. Bern, M.: Compatible tetrahedralizations. In: Proc. 9th annual ACM Symposium on Computational Geometry, pp. 281–288 (1993)

    Google Scholar 

  28. Liu, A., Baida, M.: How far flipping can go towards 3D conforming/constrained triangulation. In: Proc. 9th International Meshing Roundtable, Sandia National Laboratories, pp. 307–315 (2000)

    Google Scholar 

  29. Karamete, B.K., Beall, M.W., Shephard, M.S.: Triangulation of arbitrary polyhedra to support automatic mesh generators. International Journal for Numerical Methods in Engineering 49, 167–191 (2000)

    Article  MATH  Google Scholar 

  30. George, P.L., Borouchaki, H., Saltel, E.: Ultimate robustness in meshing an arbitrary polyhedron. International Journal for Numerical Methods in Engineering 58, 1061–1089 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  31. Si, H.: TetGen (2007), http://tetgen.berlios.de

  32. Möller, T.: A fast triangle-triangle intersection test. Journal of Graphics Tools 2, 25–30 (1997)

    Google Scholar 

  33. Guigue, P., Devillers, O.: Fast and robust triangle-triangle overlap test using orientation predicates. Journal of graphics tools 8, 39–52 (2003)

    Google Scholar 

  34. Hoffmann, C.M.: Geometric and Solid Modeling – An Introduction. Morgan Kaufmann, San Mateo, CA (1989), http://www.cs.purdue.edu/homes/cmh/distribution/books/geo.html

  35. Dyken, C., Floater, M.S.: Preferred directions for resolving the non-uniqueness of Delaunay triangulations. Computational Geometry: Theory and Applications 34, 96–101 (2006)

    MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Research Institute OTB, Section GIS-technology, Delft University of Technology, Jaffalaan 9, 2628BX, Delft, the Netherlands

    Edward Verbree

  2. Weierstrass Institute for Applied Analysis and Stochastics, Research Group: Numerical Mathematics and Scientific Computing, Mohrenstr. 39, 10117, Berlin, Germany

    Hang Si

Authors
  1. Edward Verbree
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Hang Si
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Thomas J. Cova Harvey J. Miller Kate Beard Andrew U. Frank Michael F. Goodchild

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Verbree, E., Si, H. (2008). Validation and Storage of Polyhedra through Constrained Delaunay Tetrahedralization. In: Cova, T.J., Miller, H.J., Beard, K., Frank, A.U., Goodchild, M.F. (eds) Geographic Information Science. GIScience 2008. Lecture Notes in Computer Science, vol 5266. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-87473-7_23

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-87473-7_23

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-87472-0

  • Online ISBN: 978-3-540-87473-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation