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
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Ronfard, R.P., Rossignac, J.R.: Triangulating multiply-connected polygons: A simple, yet efficient algorithm. Computer Graphics Forum 13(3), 281–292 (1994)
Rockwood, A., Heaton, K., Davis, T.: Real-time rendering of trimmed surfaces. Computers & Graphics 23(3), 107–116 (1989)
Sheng, X., Hirsch, B.E.: Triangulation of trimmed surfaces in parametric space. Computer-Aided Design 24(8), 437–444 (1992)
Obabe, H., Imaoka, H., Tomiha, T., Niwaya, H.: Three dimensional apparel CAD system. Computer & Graphics 26(2), 105–110 (1992)
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)
Gopi, M., Krishnan, S., Silva, C.T.: Surface reconstruction based on lower dimensional localized Delaunay triangulation. Computer Graphics Forum 19(3), 467–478 (2000)
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)
Marco, A., Michela, S.: Automatic surface reconstruction from point sets in space. Computer Graphics Forum 19(3), 457–465 (2000)
Ho-Le, K.: Finite element mesh generation methods: a review and classification. Computer-Aided Design 20(1), 27–38 (1988)
Lee, D.T., Lin, A.K.: Generalized Delaunay triangulations. Discrete & Computational Geometry 1, 201–217 (1986)
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)
Shewchuk, J.R.: Constrained Delaunay tetrahedralizations and provably good boundary recovery. In: Eleventh International Meshing Roundtable, pp. 193–204 (2002)
Cignoni, P., Montani, C., Perego, R., Scopigno, R.: Parallel 3D Delaunay triangulation. Computer Graphics Forum 12(3), 129–142 (1993)
Edelsbrunner, H., Tan, T.S.: An Upper Bound for Conforming Delaunay Triangulations. Discrete & Computational Geometry 10(2), 197–213 (1993)
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)
Saalfeld, A.: Delaunay edge refinements. In: Proceeding of Third Canadian Conference on Computational Geometry, pp. 33–36 (1991)
Chew, L.P.: Constrained Delaunay triangulations. Algorithmica 4, 97–108 (1989)
George, P.L., Borouchaki, H.: Delaunay Triangulation and Meshing: Application to Finite Elements. Hermes, Paris (1998)
Klein, R.: Construction of the constrained Delaunay triangulation of a polygonal domain. In: CAD Systems Development, pp. 313–326 (1995)
Piegl, L.A., Richard, A.M.: Algorithm and data structure for triangulating multiply connected polygonal domains. Computer & Graphics 17(5), 563–574 (1993)
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)
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)
Fang, T.P., Piegl, L.: Delaunay triangulation using a uniform grid. IEEE Computer Graphics and Applications 13(3), 36–47 (1993)
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)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights 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)