{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:23:01Z","timestamp":1725549781278},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540258605"},{"type":"electronic","value":"9783540320432"}],"license":[{"start":{"date-parts":[[2005,1,1]],"date-time":"2005-01-01T00:00:00Z","timestamp":1104537600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11424758_76","type":"book-chapter","created":{"date-parts":[[2010,3,12]],"date-time":"2010-03-12T11:56:24Z","timestamp":1268394984000},"page":"737-747","source":"Crossref","is-referenced-by-count":11,"title":["Flipping to Robustly Delete a Vertex in a Delaunay Tetrahedralization"],"prefix":"10.1007","author":[{"given":"Hugo","family":"Ledoux","sequence":"first","affiliation":[]},{"given":"Christopher M.","family":"Gold","sequence":"additional","affiliation":[]},{"given":"George","family":"Baciu","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"76_CR1","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1016\/0167-8396(91)90038-D","volume":"8","author":"B. Joe","year":"1991","unstructured":"Joe, B.: Construction of three-dimensional Delaunay triangulations using local transformations. Computer Aided Geometric Design\u00a08, 123\u2013142 (1991)","journal-title":"Computer Aided Geometric Design"},{"doi-asserted-by":"crossref","unstructured":"Cignoni, P., Montani, C., Scopigno, R.: DeWall: a fast divide & conquer Delaunay triangulation algorithm in E d . Computer-Aided Design\u00a030, 333\u2013341 (1998)","key":"76_CR2","DOI":"10.1016\/S0010-4485(97)00082-1"},{"key":"76_CR3","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1093\/comjnl\/24.2.167","volume":"24","author":"D.F. Watson","year":"1981","unstructured":"Watson, D.F.: Computing the n-dimensional Delaunay tessellation with application to Voronoi polytopes. Computer Journal\u00a024, 167\u2013172 (1981)","journal-title":"Computer Journal"},{"unstructured":"Chew, L.P.: Building Voronoi diagrams for convex polygons in linear expected time. Technical Report PCS-TR90-147, Dartmouth College, Computer Science, Hanover, NH (1990)","key":"76_CR4"},{"key":"76_CR5","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1142\/S0218195902000815","volume":"12","author":"O. Devillers","year":"2002","unstructured":"Devillers, O.: On deletion in Delaunay triangulations. International Journal of Computational Geometry and Applications\u00a012, 193\u2013205 (2002)","journal-title":"International Journal of Computational Geometry and Applications"},{"key":"76_CR6","doi-asserted-by":"publisher","first-page":"523","DOI":"10.1016\/S0098-3004(03)00017-7","volume":"29","author":"M.A. Mostafavi","year":"2003","unstructured":"Mostafavi, M.A., Gold, C.M., Dakowicz, M.: Delete and insert operations in Voronoi\/Delaunay methods and applications. Computers & Geosciences\u00a029, 523\u2013530 (2003)","journal-title":"Computers & Geosciences"},{"unstructured":"Devillers, O., Teillaud, M.: Perturbations and vertex removal in a 3D Delaunay tri-angulation. In: Proceedings 14th ACM-SIAM Symposium on Discrete Algorithms (SODA), Baltimore, MD, USA, pp. 313\u2013319 (2003)","key":"76_CR7"},{"key":"76_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/PL00009330","volume":"19","author":"R. Seidel","year":"1998","unstructured":"Seidel, R.: The nature and meaning of perturbations in geometric computing. Discrete & Computational Geometry\u00a019, 1\u201317 (1998)","journal-title":"Discrete & Computational Geometry"},{"key":"76_CR9","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/BF02187681","volume":"1","author":"H. Edelsbrunner","year":"1986","unstructured":"Edelsbrunner, H., Seidel, R.: Voronoi diagrams and arrangements. Discrete & Computational Geometry\u00a01, 25\u201344 (1986)","journal-title":"Discrete & Computational Geometry"},{"key":"76_CR10","doi-asserted-by":"publisher","first-page":"718","DOI":"10.1137\/0910044","volume":"10","author":"B. Joe","year":"1989","unstructured":"Joe, B.: Three-dimensional triangulations from local transformations. SIAM Journal on Scientific and Statistical Computing\u00a010, 718\u2013741 (1989)","journal-title":"SIAM Journal on Scientific and Statistical Computing"},{"doi-asserted-by":"crossref","unstructured":"Rajan, V.T.: Optimality of the Delaunay triangulation in \u211d d . In: Proceedings 7th Annual Symposium on Computational Geometry, North Conway, New Hampshire, USA, pp. 357\u2013363. ACM Press, New York (1991)","key":"76_CR11","DOI":"10.1145\/109648.109688"},{"key":"76_CR12","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1007\/BF01451597","volume":"98","author":"E Sch\u00f6nhardt","year":"1928","unstructured":"Sch\u00f6nhardt, E.: \u00dcber die zerlegung von dreieckspolyedern in tetraeder. Mathema- tische Annalen\u00a098, 309\u2013312 (1928)","journal-title":"Mathema- tische Annalen"},{"key":"76_CR13","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/0167-8396(86)90001-4","volume":"3","author":"C.L. Lawson","year":"1986","unstructured":"Lawson, C.L.: Properties of n-dimensional triangulations. Computer Aided Geometric Design\u00a03, 231\u2013246 (1986)","journal-title":"Computer Aided Geometric Design"},{"key":"76_CR14","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1145\/777792.777821","volume-title":"Proceedings 19th Annual Symposium on Computational Geometry","author":"J.R. Shewchuk","year":"2003","unstructured":"Shewchuk, J.R.: Updating and constructing constrained Delaunay and constrained regular triangulations by flips. In: Proceedings 19th Annual Symposium on Computational Geometry, San Diego, USA, pp. 181\u2013190. ACM Press, New York (2003)"},{"key":"76_CR15","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1145\/77635.77639","volume":"9","author":"H. Edelsbrunner","year":"1990","unstructured":"Edelsbrunner, H., M\u00fccke, E.P.: Simulation of Simplicity: a technique to cope with degenerate cases in geometric algorithms. ACM Transactions on Graphics\u00a09, 66\u2013104 (1990)","journal-title":"ACM Transactions on Graphics"},{"key":"76_CR16","doi-asserted-by":"crossref","first-page":"350","DOI":"10.1145\/336154.336222","volume-title":"Proceedings 16th Annual Symposium on Computational Geometry","author":"J.R. Shewchuk","year":"2000","unstructured":"Shewchuk, J.R.: Sweep algorithms for constructing higher-dimensional constrained Delaunay triangulations. In: Proceedings 16th Annual Symposium on Computational Geometry, Hong Kong, pp. 350\u2013359. ACM Press, New York (2000)"}],"container-title":["Lecture Notes in Computer Science","Computational Science and Its Applications \u2013 ICCSA 2005"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11424758_76","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,24]],"date-time":"2021-10-24T15:33:29Z","timestamp":1635089609000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11424758_76"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540258605","9783540320432"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/11424758_76","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}