{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T17:51:19Z","timestamp":1725472279917},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540486282"},{"type":"electronic","value":"9783540486312"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11919476_68","type":"book-chapter","created":{"date-parts":[[2006,11,2]],"date-time":"2006-11-02T13:39:16Z","timestamp":1162474756000},"page":"682-691","source":"Crossref","is-referenced-by-count":3,"title":["Constrained Delaunay Triangulation Using Delaunay Visibility"],"prefix":"10.1007","author":[{"given":"Yi-Jun","family":"Yang","sequence":"first","affiliation":[]},{"given":"Hui","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Jun-Hai","family":"Yong","sequence":"additional","affiliation":[]},{"given":"Wei","family":"Zeng","sequence":"additional","affiliation":[]},{"given":"Jean-Claude","family":"Paul","sequence":"additional","affiliation":[]},{"given":"Jiaguang","family":"Sun","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"3","key":"68_CR1","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1111\/1467-8659.1330281","volume":"13","author":"R.P. Ronfard","year":"1994","unstructured":"Ronfard, R.P., Rossignac, J.R.: Triangulating multiply-connected polygons: A simple, yet efficient algorithm. Computer Graphics Forum\u00a013(3), 281\u2013292 (1994)","journal-title":"Computer Graphics Forum"},{"issue":"3","key":"68_CR2","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1145\/74334.74344","volume":"23","author":"A. Rockwood","year":"1989","unstructured":"Rockwood, A., Heaton, K., Davis, T.: Real-time rendering of trimmed surfaces. Computers & Graphics\u00a023(3), 107\u2013116 (1989)","journal-title":"Computers & Graphics"},{"issue":"8","key":"68_CR3","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1016\/0010-4485(92)90011-X","volume":"24","author":"X. Sheng","year":"1992","unstructured":"Sheng, X., Hirsch, B.E.: Triangulation of trimmed surfaces in parametric space. Computer-Aided Design\u00a024(8), 437\u2013444 (1992)","journal-title":"Computer-Aided Design"},{"issue":"2","key":"68_CR4","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1145\/142920.134019","volume":"26","author":"H. Obabe","year":"1992","unstructured":"Obabe, H., Imaoka, H., Tomiha, T., Niwaya, H.: Three dimensional apparel CAD system. Computer & Graphics\u00a026(2), 105\u2013110 (1992)","journal-title":"Computer & Graphics"},{"key":"68_CR5","doi-asserted-by":"crossref","unstructured":"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.\u00a05403, pp. 337\u2013348 (2004)","DOI":"10.1117\/12.532615"},{"issue":"3","key":"68_CR6","doi-asserted-by":"publisher","first-page":"467","DOI":"10.1111\/1467-8659.00439","volume":"19","author":"M. Gopi","year":"2000","unstructured":"Gopi, M., Krishnan, S., Silva, C.T.: Surface reconstruction based on lower dimensional localized Delaunay triangulation. Computer Graphics Forum\u00a019(3), 467\u2013478 (2000)","journal-title":"Computer Graphics Forum"},{"issue":"2","key":"68_CR7","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1111\/1467-8659.00486","volume":"20","author":"L.G. Nonato","year":"2001","unstructured":"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\u00a020(2), 161\u2013174 (2001)","journal-title":"Computer Graphics Forum"},{"issue":"3","key":"68_CR8","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1111\/1467-8659.00438","volume":"19","author":"A. Marco","year":"2000","unstructured":"Marco, A., Michela, S.: Automatic surface reconstruction from point sets in space. Computer Graphics Forum\u00a019(3), 457\u2013465 (2000)","journal-title":"Computer Graphics Forum"},{"issue":"1","key":"68_CR9","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/0010-4485(88)90138-8","volume":"20","author":"K. Ho-Le","year":"1988","unstructured":"Ho-Le, K.: Finite element mesh generation methods: a review and classification. Computer-Aided Design\u00a020(1), 27\u201338 (1988)","journal-title":"Computer-Aided Design"},{"key":"68_CR10","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/BF02187695","volume":"1","author":"D.T. Lee","year":"1986","unstructured":"Lee, D.T., Lin, A.K.: Generalized Delaunay triangulations. Discrete & Computational Geometry\u00a01, 201\u2013217 (1986)","journal-title":"Discrete & Computational Geometry"},{"issue":"4","key":"68_CR11","doi-asserted-by":"publisher","first-page":"606","DOI":"10.1016\/j.cag.2005.05.011","volume":"29","author":"Y.J. Yang","year":"2005","unstructured":"Yang, Y.J., Yong, J.H., Sun, J.G.: An algorithm for tetrahedral mesh generation based on conforming constrained Delaunay tetrahedralization. Computers & Graphics\u00a029(4), 606\u2013615 (2005)","journal-title":"Computers & Graphics"},{"key":"68_CR12","unstructured":"Shewchuk, J.R.: Constrained Delaunay tetrahedralizations and provably good boundary recovery. In: Eleventh International Meshing Roundtable, pp. 193\u2013204 (2002)"},{"issue":"3","key":"68_CR13","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1111\/1467-8659.1230129","volume":"12","author":"P. Cignoni","year":"1993","unstructured":"Cignoni, P., Montani, C., Perego, R., Scopigno, R.: Parallel 3D Delaunay triangulation. Computer Graphics Forum\u00a012(3), 129\u2013142 (1993)","journal-title":"Computer Graphics Forum"},{"issue":"2","key":"68_CR14","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1007\/BF02573974","volume":"10","author":"H. Edelsbrunner","year":"1993","unstructured":"Edelsbrunner, H., Tan, T.S.: An Upper Bound for Conforming Delaunay Triangulations. Discrete & Computational Geometry\u00a010(2), 197\u2013213 (1993)","journal-title":"Discrete & Computational Geometry"},{"key":"68_CR15","unstructured":"Nackman, L.R., Srinivasan, V.: Point placement for Delaunay triangulation of polygonal domains. In: Proceeding of Third Canadian Conference Computational Geometry, pp. 37\u201340 (1991)"},{"key":"68_CR16","unstructured":"Saalfeld, A.: Delaunay edge refinements. In: Proceeding of Third Canadian Conference on Computational Geometry, pp. 33\u201336 (1991)"},{"key":"68_CR17","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/BF01553881","volume":"4","author":"L.P. Chew","year":"1989","unstructured":"Chew, L.P.: Constrained Delaunay triangulations. Algorithmica\u00a04, 97\u2013108 (1989)","journal-title":"Algorithmica"},{"key":"68_CR18","volume-title":"Delaunay Triangulation and Meshing: Application to Finite Elements","author":"P.L. George","year":"1998","unstructured":"George, P.L., Borouchaki, H.: Delaunay Triangulation and Meshing: Application to Finite Elements. Hermes, Paris (1998)"},{"key":"68_CR19","doi-asserted-by":"crossref","unstructured":"Klein, R.: Construction of the constrained Delaunay triangulation of a polygonal domain. In: CAD Systems Development, pp. 313\u2013326 (1995)","DOI":"10.1007\/978-3-642-60718-9_22"},{"issue":"5","key":"68_CR20","doi-asserted-by":"publisher","first-page":"563","DOI":"10.1016\/0097-8493(93)90007-V","volume":"17","author":"L.A. Piegl","year":"1993","unstructured":"Piegl, L.A., Richard, A.M.: Algorithm and data structure for triangulating multiply connected polygonal domains. Computer & Graphics\u00a017(5), 563\u2013574 (1993)","journal-title":"Computer & Graphics"},{"issue":"4","key":"68_CR21","doi-asserted-by":"publisher","first-page":"563","DOI":"10.1145\/355921.355927","volume":"6","author":"J.L. Bentley","year":"1980","unstructured":"Bentley, J.L., Weide, B.W., Yao, A.C.: Optimal expected-time algorithms for closest point problems. ACM Transactions on Mathematical Software\u00a06(4), 563\u2013580 (1980)","journal-title":"ACM Transactions on Mathematical Software"},{"issue":"5","key":"68_CR22","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1142\/S0218195903001244","volume":"13","author":"O. Devillers","year":"2003","unstructured":"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\u00a013(5), 391\u2013398 (2003)","journal-title":"International Journal of Computational Geometry and Applications"},{"issue":"3","key":"68_CR23","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1109\/38.210490","volume":"13","author":"T.P. Fang","year":"1993","unstructured":"Fang, T.P., Piegl, L.: Delaunay triangulation using a uniform grid. IEEE Computer Graphics and Applications\u00a013(3), 36\u201347 (1993)","journal-title":"IEEE Computer Graphics and Applications"},{"issue":"1","key":"68_CR24","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1145\/77635.77639","volume":"9","author":"H. Edelsbrunner","year":"1990","unstructured":"Edelsbrunner, H., Mcke, E.P.: Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms. ACM Transactions on Graphics\u00a09(1), 66\u2013104 (1990)","journal-title":"ACM Transactions on Graphics"}],"container-title":["Lecture Notes in Computer Science","Advances in Visual Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11919476_68.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T19:58:48Z","timestamp":1605643128000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11919476_68"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540486282","9783540486312"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/11919476_68","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}