{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,24]],"date-time":"2025-12-24T12:13:20Z","timestamp":1766578400407,"version":"3.43.0"},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2000,2,1]],"date-time":"2000-02-01T00:00:00Z","timestamp":949363200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2000,2,1]],"date-time":"2000-02-01T00:00:00Z","timestamp":949363200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Reliable Computing"],"published-print":{"date-parts":[[2000,2]]},"DOI":"10.1023\/a:1009942427413","type":"journal-article","created":{"date-parts":[[2002,12,22]],"date-time":"2002-12-22T19:25:11Z","timestamp":1040585111000},"page":"61-79","source":"Crossref","is-referenced-by-count":10,"title":["Removing Degeneracies by Perturbing the Problem or Perturbing the World"],"prefix":"10.1007","volume":"6","author":[{"given":"Pierre","family":"Alliez","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Olivier","family":"Devillers","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jack","family":"Snoeyink","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"260008_CR1","doi-asserted-by":"crossref","first-page":"522","DOI":"10.1007\/BF01759057","volume":"6","author":"L. De Floriani","year":"1991","unstructured":"De Floriani, L., Falcidieno, B., Nagy, G., and Pienovi, C.: On Sorting Triangles in a Delaunay Tessellation, Algorithmica\n6 (1991), pp. 522-532.","journal-title":"Algorithmica"},{"key":"260008_CR2","unstructured":"Denny, M. and Sohler, Ch.: Encoding a Triangulation as a Permutation of Its Point Set, in: Canadian Conference on Computational Geometry, 1997, pp. 39-43."},{"key":"260008_CR3","doi-asserted-by":"crossref","unstructured":"Dillencourt, M. B. and Smith, W. D.: A Simple Method for Resolving Degeneracies in Delaunay Triangulation, in: Proc. 20th Internat. Colloq. Automata Lang. Program., volume 700 of Lecture Notes Comput. Sci., Springer-Verlag, 1993, pp. 177-188.","DOI":"10.1007\/3-540-56939-1_71"},{"key":"260008_CR4","unstructured":"Drysdale, III, R. L.: A Practical Algorithm for Computing the Delaunay Triangulation for Convex Distance Functions, in: Proc. 1st ACM-SIAM Sympos. Discrete Algorithms, 1990, pp. 159-168."},{"issue":"1","key":"260008_CR5","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1145\/77635.77639","volume":"9","author":"H. Edelsbrunner","year":"1990","unstructured":"Edelsbrunner, H. and M\u00fccke, E. P.: Simulation of Simplicity: A Technique to Cope with Degenerate Cases in Geometric Algorithms, ACM Trans. Graph.\n9(1) (1990), pp. 66-104.","journal-title":"ACM Trans. Graph."},{"key":"260008_CR6","doi-asserted-by":"crossref","first-page":"650","DOI":"10.1137\/S0097539792235918","volume":"24","author":"I. Z. Emiris","year":"1995","unstructured":"Emiris, I. Z. and Canny, J. F.: A General Approach to Removing Degeneracies, SIAM J. Comput.\n24 (1995), pp. 650-664.","journal-title":"SIAM J. Comput."},{"issue":"1-2","key":"260008_CR7","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1007\/PL00014417","volume":"19","author":"I. Z. Emiris","year":"1997","unstructured":"Emiris, I. Z., Canny, J. F., and Seidel, R.: Efficient Perturbations for Handling Geometric Degeneracies, Algorithmica\n19(1\u20132) (1997), pp. 219-242.","journal-title":"Algorithmica"},{"key":"260008_CR8","doi-asserted-by":"crossref","first-page":"353","DOI":"10.3233\/FI-1995-2243","volume":"22","author":"D. Kirkpatrick","year":"1995","unstructured":"Kirkpatrick, D. and Snoeyink, J.: Tentative Prune-and-Search for Computing Fixed-Points with Applications to Geometric Computation, Fundam. Inform.\n22 (1995), pp. 353-370.","journal-title":"Fundam. Inform."},{"key":"260008_CR9","doi-asserted-by":"crossref","unstructured":"Klein, R.: Concrete and Abstract Voronoi Diagrams, volume 400 of Lecture Notes Comput. Sci., Springer-Verlag, 1989.","DOI":"10.1007\/3-540-52055-4"},{"issue":"3","key":"260008_CR10","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1016\/0925-7721(93)90033-3","volume":"3","author":"R. Klein","year":"1993","unstructured":"Klein, R., Mehlhorn, K., and Meiser, S.: Randomized Incremental Construction of Abstract Voronoi Diagrams, Comput. Geom. Theory Appl.\n3(3) (1993), pp. 157-184.","journal-title":"Comput. Geom. Theory Appl."},{"key":"260008_CR11","doi-asserted-by":"crossref","unstructured":"Mount, D. M. and Saalfeld, A.: Globally-Equiangular Triangulations of Co-Circular Points in O(n log n) Time, in: Proc. 4th Annu. ACM Sympos. Comput. Geom., 1988, pp. 143-152.","DOI":"10.1145\/73393.73408"},{"key":"260008_CR12","unstructured":"Neuhauser, M. A.: Symbolic Perturbations and Special Arithmetics for Controlled Handling of Geometric Degeneracies, in: Proc 5th WSCG'97, Plzen, Czech Republic, 1997, pp. 386-395."},{"key":"260008_CR13","doi-asserted-by":"crossref","unstructured":"Seidel, R.: The Nature and Meaning of Perturbations in Geometric Computing, in: Proc. 11th Sympos. Theoret. Aspects Comput. Sci., volume 775 of Lecture Notes Comput. Sci., Springer-Verlag, 1994, pp. 3-17.","DOI":"10.1007\/3-540-57785-8_127"},{"key":"260008_CR14","doi-asserted-by":"crossref","unstructured":"Snoeyink, J. and van Kreveld, M.: Good Orders for Incremental (Re)constructions, in: Proc. 13th Annu. ACM Sympos. Comput. Geom., 1997, pp. 400-402.","DOI":"10.1145\/262839.263025"},{"issue":"1","key":"260008_CR15","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1016\/0022-0000(90)90016-E","volume":"40","author":"C. K. Yap","year":"1990","unstructured":"Yap, C. K.: A Geometric Consistency Theorem for a Symbolic Perturbation Scheme, J. Comput. Syst. Sci.\n40(1) (1990), pp. 2-18.","journal-title":"J. Comput. Syst. Sci."}],"container-title":["Reliable Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1009942427413.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1009942427413\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1009942427413.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,6]],"date-time":"2025-08-06T09:38:31Z","timestamp":1754473111000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1009942427413"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,2]]},"references-count":15,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2000,2]]}},"alternative-id":["260008"],"URL":"https:\/\/doi.org\/10.1023\/a:1009942427413","relation":{},"ISSN":["1385-3139","1573-1340"],"issn-type":[{"type":"print","value":"1385-3139"},{"type":"electronic","value":"1573-1340"}],"subject":[],"published":{"date-parts":[[2000,2]]}}}