{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:10:49Z","timestamp":1725664249510},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540577850"},{"type":"electronic","value":"9783540483328"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1994]]},"DOI":"10.1007\/3-540-57785-8_127","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T13:18:53Z","timestamp":1330262333000},"page":"1-17","source":"Crossref","is-referenced-by-count":4,"title":["The nature and meaning of perturbations in geometric computing"],"prefix":"10.1007","author":[{"given":"Raimund","family":"Seidel","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,31]]},"reference":[{"key":"1_CR1","unstructured":"C. Burnikel, K. Mehlhorn, and S. Schirra, On Degeneracy in Geometric Computations. Proc. 5th Annual ACM-SIAM Symp. on Discrete Algorithms (1994)."},{"key":"1_CR2","unstructured":"J. Canny, Private Communication."},{"key":"1_CR3","volume-title":"Linear Programming and Extensions","author":"G.B. Dantzig","year":"1963","unstructured":"G.B. Dantzig, Linear Programming and Extensions. Princeton Univ. Press, Princeton, 1963."},{"key":"1_CR4","volume-title":"Diplomarbeit, FB 14","author":"K. Dobrindt","year":"1990","unstructured":"K. Dobrindt, Algorithmen f\u00fcr Polyeder. Diplomarbeit, FB 14, Informatik, Univ. des Saarlandes, Saarbr\u00fccken (1990)."},{"issue":"1","key":"1_CR5","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1145\/77635.77639","volume":"9","author":"H. Edelsbrunner","year":"1990","unstructured":"H. Edelsbrunner and E.P. M\u00fccke, Simulation of Simplicity: A technique to Cope with Degenerate Cases in Geometric Algorithms. ACM Trans. Graphics, 9(1), (1990), 67\u2013104.","journal-title":"ACM Trans. Graphics"},{"key":"1_CR6","doi-asserted-by":"crossref","unstructured":"I. Emiris and J. Canny, A General Approach to Removing Degeneracies. Proc. 32nd Annual IEEE Symp. FOCS (1991), 405\u2013413.","DOI":"10.1109\/SFCS.1991.185399"},{"key":"1_CR7","doi-asserted-by":"crossref","unstructured":"I. Emiris and J. Canny, An Efficient Approach to Removing Geometric Degeneracies. Proc. 8th Annual ACM Symp. on Comp. Geom. (1991), 74\u201382.","DOI":"10.1145\/142675.142694"},{"key":"1_CR8","unstructured":"A. Griewank and G.F. Corliss, Automatic Differentiation of Algorithms: Theory, Implementation, and Applications. SIAM (1991)."},{"issue":"2","key":"1_CR9","doi-asserted-by":"crossref","first-page":"74","DOI":"10.1145\/282918.282923","volume":"4","author":"L.J. Guibas","year":"1985","unstructured":"L.J. Guibas and J. Stolfi, Primitives for Manipulation of General Subdivisions and Computation of Voronoi Diagrams. ACM Trans. Graphics, 4(2), (1985), 74\u2013123.","journal-title":"ACM Trans. Graphics"},{"key":"1_CR10","doi-asserted-by":"crossref","unstructured":"S.G. Krantz and H.R. Parks, A Primer of Real Analytic Functions. Birkh\u00e4user Verlag (1992).","DOI":"10.1007\/978-3-0348-7644-5"},{"key":"1_CR11","doi-asserted-by":"crossref","unstructured":"C. Monma, M. Paterson, S. Suri, and F. Yao, Computing Euclidean Maximum Spanning Trees. Proc. 4th Annual ACM Symp. on Comp. Geom. (1988), 241\u2013251.","DOI":"10.1145\/73393.73418"},{"key":"1_CR12","doi-asserted-by":"crossref","unstructured":"F.P. Preparata and M.I. Shamos, Computational Geometry, An Introduction. Springer Verlag (1985).","DOI":"10.1007\/978-1-4612-1098-6"},{"issue":"4","key":"1_CR13","doi-asserted-by":"crossref","first-page":"701","DOI":"10.1145\/322217.322225","volume":"27","author":"J.T. Schwartz","year":"1980","unstructured":"J.T. Schwartz, Fast Probabilistic Algorithms for Verification of Polynomial Identities. JACM 27(4), (1980), 701\u2013717.","journal-title":"JACM"},{"key":"1_CR14","unstructured":"R. Seidel, Output-Size Sensitive Algorithms for Constructive Problems in Computational Geometry. PhD thesis, Computer Science Dept., Cornell Univ., (1986)."},{"key":"1_CR15","unstructured":"T. Thiele, Private Communication."},{"key":"1_CR16","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1016\/S0747-7171(08)80069-7","volume":"10","author":"C.-K. Yap","year":"1990","unstructured":"C.-K. Yap, Symbolic Treatment of Geometric Degeneracies, J. Symbolic Computation 10 (1990), 349\u2013370.","journal-title":"J. Symbolic Computation"},{"key":"1_CR17","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1016\/0022-0000(90)90016-E","volume":"40","author":"C.-K. Yap","year":"1990","unstructured":"C.-K. Yap, A Geometric Consistency Theorem for a Symbolic Perturbation Scheme. J. Computer and Systems Science 40 (1990), 2\u201318.","journal-title":"J. Computer and Systems Science"}],"container-title":["Lecture Notes in Computer Science","STACS 94"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-57785-8_127.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:13:50Z","timestamp":1605647630000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-57785-8_127"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540577850","9783540483328"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/3-540-57785-8_127","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1994]]}}}