{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:40:39Z","timestamp":1725565239794},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540220572"},{"type":"electronic","value":"9783540247678"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-24767-8_21","type":"book-chapter","created":{"date-parts":[[2010,9,11]],"date-time":"2010-09-11T00:45:04Z","timestamp":1284165904000},"page":"198-206","source":"Crossref","is-referenced-by-count":0,"title":["The Employment of Regular Triangulation for Constrained Delaunay Triangulation"],"prefix":"10.1007","author":[{"given":"Pavel","family":"Maur","sequence":"first","affiliation":[]},{"given":"Ivana","family":"Kolingerov\u00e1","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"2","key":"21_CR1","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1016\/S0097-8493(96)00085-4","volume":"21","author":"M.V. Anglada","year":"1997","unstructured":"Anglada, M.V.: An improved incremental algorithm for constructing restricted Delaunay triangulations. Comput. & Graphics\u00a021(2), 215\u2013223 (1997)","journal-title":"Comput. & Graphics"},{"key":"21_CR2","volume-title":"Proceedings of 3rd Annual Symposium on Computational Geometry","author":"L.P. Chew","year":"1987","unstructured":"Chew, L.P.: Constrained Delaunay Triangulations. In: Proceedings of 3rd Annual Symposium on Computational Geometry, ACM, New York (1987)"},{"key":"21_CR3","doi-asserted-by":"crossref","unstructured":"Edelsbrunner, H.: Triangulations and meshes in computational geometry. Acia Numerica, 1\u201381 (2000)","DOI":"10.1017\/S0962492900001331"},{"key":"21_CR4","first-page":"43","volume-title":"Proceedings of the 8th Annual Computational Geometry","author":"H. Edelsbrunner","year":"1992","unstructured":"Edelsbrunner, H., Shah, N.R.: Incremental Topological FlippingWorks for Regular Triangulations. In: Proceedings of the 8th Annual Computational Geometry, pp. 43\u201352. ACM, New York (1992)"},{"key":"21_CR5","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1016\/0167-8396(94)00018-N","volume":"12","author":"M.A. Facello","year":"1995","unstructured":"Facello, M.A.: Implementation of a randomized algorithm for Delaunay and regular triangulations in three dimensions. Computer Aided Geometric Design\u00a012, 349\u2013370 (1995)","journal-title":"Computer Aided Geometric Design"},{"key":"21_CR6","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-1098-6","volume-title":"Computational Geometry","author":"F.P. Preparata","year":"1985","unstructured":"Preparata, F.P., Shamos, M.I.: Computational Geometry. Springer, Heidelberg (1985)"},{"key":"21_CR7","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1145\/276884.276893","volume-title":"Proceedings of the Fourteenth Annual Symposium on Computational Geometry","author":"J.R. Shewchuk","year":"1998","unstructured":"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\u201385. ACM, New York (1998)"},{"key":"21_CR8","doi-asserted-by":"crossref","unstructured":"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\u2013359 (2000)","DOI":"10.1145\/336154.336222"},{"key":"21_CR9","unstructured":"Shewchuk, J.R.: Constrained Delaunay Tetrahedralizations and Provably Good Boundary Recovery. To appear in the 11th International Meshing Roundtable (2002)"},{"key":"21_CR10","volume-title":"Proceedings of the Twelfth Annual Symposium on Computational Geometry","author":"J.R. Shewchuk","year":"1996","unstructured":"Shewchuk, J.R.: Robust Adaptive Floating-Point Geometric Predicates. In: Proceedings of the Twelfth Annual Symposium on Computational Geometry, ACM, New York (1996)"},{"issue":"3","key":"21_CR11","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1016\/0045-7949(93)90239-A","volume":"47","author":"S.W. Sloan","year":"1993","unstructured":"Sloan, S.W.: A Fast Algorithm for Generating Constrained Delaunay Triangulations. Computers & Structures\u00a047(3), 441\u2013450 (1993)","journal-title":"Computers & Structures"}],"container-title":["Lecture Notes in Computer Science","Computational Science and Its Applications \u2013 ICCSA 2004"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24767-8_21.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T03:08:00Z","timestamp":1620011280000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24767-8_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540220572","9783540247678"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24767-8_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}