{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:09:02Z","timestamp":1725487742793},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540349570"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-34958-7_3","type":"book-chapter","created":{"date-parts":[[2007,7,19]],"date-time":"2007-07-19T14:45:47Z","timestamp":1184856347000},"page":"39-56","source":"Crossref","is-referenced-by-count":5,"title":["Mesh Modification Under Local Domain Changes"],"prefix":"10.1007","author":[{"given":"Narc\u00eds","family":"Coll","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marit\u00e9","family":"Guerrieri","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J. Antoni","family":"Sellar\u00e8s","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"3_CR1","unstructured":"1. N. Amenta, M. Bern and D. Epstein. Optimal point placement for mesh smoothing. In SODA:ACM-SIAM Symposium on Discrete Algorithms, 1997."},{"issue":"2","key":"3_CR2","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1093\/comjnl\/24.2.162","volume":"24","author":"A. Bowyer","year":"1981","unstructured":"2. A. Bowyer. Computing Dirichlet Tessellations. Computer Journal, 24:2:162\u2013166, 1981.","journal-title":"Computer Journal"},{"key":"3_CR3","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1016\/0925-7721(93)90009-U","volume":"3","author":"K. Clarkson","year":"1993","unstructured":"3. K. Clarkson and K. Mehlhorn and R. Seidel. Four results on randomized incremental constructions. Computational Geometry: Theory and Applications, 3:185\u2013212, 1993.","journal-title":"Computational Geometry: Theory and Applications"},{"key":"3_CR4","doi-asserted-by":"crossref","unstructured":"4. O. Devillers. On deletion in Delaunay triangulation. 15th Annual ACM Symposium on Computational Geometry, 181\u2013188, 1999.","DOI":"10.1145\/304893.304969"},{"key":"3_CR5","doi-asserted-by":"crossref","unstructured":"5. L. Freitag and M. Jones and P. Plassmann. An efficient parallel algorithm for mesh smoothing. In Proceedings of the Fourth International Meshing Roundtable, 47\u201358, 1995.","DOI":"10.2172\/414390"},{"key":"3_CR6","doi-asserted-by":"crossref","unstructured":"6. N. Han-Wen and A.-F. van der Stappen. A Delaunay approach to interactive cutting in triangulated surfaces. In J.D. Boissonnat, J. Burdick, K. Goldbrg & S. Hutchinson (Eds.), Algorithmic Foundations of Robotics V, Springer-Verlag, 113\u2013129, 2004.","DOI":"10.1007\/978-3-540-45058-0_8"},{"key":"3_CR7","doi-asserted-by":"crossref","unstructured":"7. S. Har-Peled and A. \u00dcng \u00f6 r. A Time-Optimal Delaunay Refinement Algorithm in Two Dimensions. 21st Annual ACM Symposium on Computational Geometry (SoCG), 228\u2013229, 2005.","DOI":"10.1145\/1064092.1064128"},{"key":"3_CR8","doi-asserted-by":"crossref","unstructured":"8. M. Kallmann and H. Bieri and D. Thalmann. Fully Dynamic Constrained Delaunay Triangulation. Geometric Modelling For Scientific Visualization - Spring-Verlag, 2003.","DOI":"10.1007\/978-3-662-07443-5_15"},{"key":"3_CR9","doi-asserted-by":"crossref","unstructured":"9. C.-L. Lawson. Software for C 1 Surface Interpolation. Mathematical Software III(John R.Rice, editor), 161\u2013194, 1977.","DOI":"10.1016\/B978-0-12-587260-7.50011-X"},{"key":"3_CR10","unstructured":"10. G.-L. Miller and S.-E. Pav and N.-J. Walkington. Fully incremental 3d Delaunay mesh generation. In Proceedings 11th International Meshing Roundtable, 75\u201386, 2002."},{"key":"3_CR11","unstructured":"11. S.-E. Pav. Delaunay Refinement Algorithms. Department of Mathematical Sciences - Carnegie Mellon University - PhD thesis, 2003."},{"issue":"3","key":"3_CR12","doi-asserted-by":"publisher","first-page":"548","DOI":"10.1006\/jagm.1995.1021","volume":"18","author":"J. Ruppert","year":"1995","unstructured":"12. J. Ruppert. A Delaunay Refinement Algorithm for Quality 2-Dimensional Mesh Generation. Journal of Algorithms, 18:3:548\u2013585, 1995.","journal-title":"Journal of Algorithms"},{"key":"3_CR13","unstructured":"13. J.-R. Shewchuk. Delaunay Refinement Mesh Generation. School of Computer Science - Carnegie Mellon University - PhD thesis, 1997."},{"issue":"2","key":"3_CR14","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1093\/comjnl\/24.2.167","volume":"24","author":"D.-F. Watson","year":"1981","unstructured":"14. D.-F. Watson. Computing the n-dimensional Delaunay Tessellation with Application to Voronoi Polytopes. Computer Journal, 24:2:167\u2013172, 1981.","journal-title":"Computer Journal"}],"container-title":["Proceedings of the 15th International Meshing Roundtable"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-34958-7_3.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T03:46:09Z","timestamp":1620013569000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-34958-7_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540349570"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-34958-7_3","relation":{},"subject":[]}}