{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T11:56:38Z","timestamp":1725537398825},"publisher-location":"Berlin, Heidelberg","reference-count":31,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642034558"},{"type":"electronic","value":"9783642034565"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-03456-5_27","type":"book-chapter","created":{"date-parts":[[2009,8,31]],"date-time":"2009-08-31T22:39:16Z","timestamp":1251758356000},"page":"408-421","source":"Crossref","is-referenced-by-count":3,"title":["Much Ado about Zero"],"prefix":"10.1007","author":[{"given":"Stefan","family":"Schirra","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"27_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1007\/3-540-68530-8_13","volume-title":"Algorithms - ESA \u201998","author":"J. Bl\u00f6mer","year":"1998","unstructured":"Bl\u00f6mer, J.: A Probabilistic Zero-Test for Expressions Involving Roots of Rational Numbers. In: Bilardi, G., Pietracaprina, A., Italiano, G.F., Pucci, G. (eds.) ESA 1998. LNCS, vol.\u00a01461, pp. 151\u2013162. Springer, Heidelberg (1998)"},{"key":"27_CR2","first-page":"341","volume-title":"15th ACM Symposium on Computational Geometry","author":"C. Burnikel","year":"1999","unstructured":"Burnikel, C., Fleischer, R., Mehlhorn, K., Schirra, S.: Efficient Exact Geometric Computation Made Easy. In: 15th ACM Symposium on Computational Geometry, pp. 341\u2013350. ACM, New York (1999)"},{"issue":"1","key":"27_CR3","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/s004530010005","volume":"27","author":"C. Burnikel","year":"2000","unstructured":"Burnikel, C., Fleischer, R., Mehlhorn, K., Schirra, S.: A Strong and Easily Computable Separation Bound for Arithmetic Expressions Involving Radicals. Algorithmica\u00a027(1), 87\u201399 (2000)","journal-title":"Algorithmica"},{"key":"27_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1007\/3-540-44676-1_21","volume-title":"Algorithms - ESA 2001","author":"C. Burnikel","year":"2001","unstructured":"Burnikel, C., Funke, S., Mehlhorn, K., Schirra, S., Schmitt, S.: A Separation Bound for Real Algebraic Expressions. In: Meyer auf der Heide, F. (ed.) ESA 2001. LNCS, vol.\u00a02161, pp. 254\u2013265. Springer, Heidelberg (2001)"},{"key":"27_CR5","doi-asserted-by":"crossref","unstructured":"Burnikel, C., K\u00f6nnemann, J., Mehlhorn, K., N\u00e4her, S., Schirra, S., Uhrig, C.: Exact Geometric Computation in LEDA. In: 11th ACM Symposium on Computational Geometry, pp. C18\u2013C19. ACM, New York (1995)","DOI":"10.1145\/220279.220330"},{"key":"27_CR6","volume-title":"The Complexity of Robot Motion Planning","author":"J.F. Canny","year":"1988","unstructured":"Canny, J.F.: The Complexity of Robot Motion Planning. MIT Press, Cambridge (1988)"},{"key":"27_CR7","first-page":"75","volume-title":"2nd Library-Centric Software Design","author":"A. Fabri","year":"2006","unstructured":"Fabri, A., Pion, S.: A Generic Lazy Evaluation Scheme for Exact Geometric Computations. In: 2nd Library-Centric Software Design, pp. 75\u201384. ACM, New York (2006)"},{"key":"27_CR8","first-page":"163","volume-title":"9th ACM Symposium on Computational Geometry","author":"S. Fortune","year":"1993","unstructured":"Fortune, S., Van Wyk, C.J.: Efficient Exact Arithmetic for Computational Geometry. In: 9th ACM Symposium on Computational Geometry, pp. 163\u2013172. ACM, New York (1993)"},{"issue":"1-3","key":"27_CR9","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/S0925-7721(01)00046-3","volume":"22","author":"S. Funke","year":"2002","unstructured":"Funke, S., Mehlhorn, K.: Look: A Lazy Object-Oriented Kernel Design for Geometric Computation. Computational Geometry: Theory and Applications\u00a022(1-3), 99\u2013118 (2002)","journal-title":"Computational Geometry: Theory and Applications"},{"key":"27_CR10","first-page":"351","volume-title":"15th ACM Symposium on Computational Geometry","author":"V. Karamcheti","year":"1999","unstructured":"Karamcheti, V., Li, C., Pechtchanski, I., Yap, C.: A Core Library for Robust Numeric and Geometric Computation. In: 15th ACM Symposium on Computational Geometry, pp. 351\u2013359. ACM, New York (1999)"},{"key":"27_CR11","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1145\/99902.99905","volume":"10","author":"M. Karasick","year":"1991","unstructured":"Karasick, M., Lieber, D., Nackman, L.R.: Efficient Delaunay Triangulation Using Rational Arithmetic. ACM Trans. on Graphics\u00a010, 71\u201391 (1991)","journal-title":"ACM Trans. on Graphics"},{"issue":"1","key":"27_CR12","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/j.comgeo.2007.06.003","volume":"40","author":"L. Kettner","year":"2008","unstructured":"Kettner, L., Mehlhorn, K., Pion, S., Schirra, S., Yap, C.: Classroom Examples of Robustness Problems in Geometric Computations. Computational Geometry: Theory and Applications\u00a040(1), 61\u201378 (2008)","journal-title":"Computational Geometry: Theory and Applications"},{"key":"27_CR13","unstructured":"Li, C., Yap, C.: A New Constructive Root Bound for Algebraic Expressions. In: 12th ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 496\u2013505 (2001)"},{"key":"27_CR14","first-page":"223","volume-title":"IFIP 13th World Computer Congress","author":"K. Mehlhorn","year":"1994","unstructured":"Mehlhorn, K., N\u00e4her, S.: The Implementation of Geometric Algorithms. In: Pehrson, B., Simon, I. (eds.) IFIP 13th World Computer Congress, pp. 223\u2013231. North-Holland, Amsterdam (1994)"},{"key":"27_CR15","volume-title":"LEDA: A Platform for Combinatorial and Geometric Computing","author":"K. Mehlhorn","year":"2000","unstructured":"Mehlhorn, K., N\u00e4her, S.: LEDA: A Platform for Combinatorial and Geometric Computing. Cambridge University Press, Cambridge (2000)"},{"key":"27_CR16","unstructured":"Mehlhorn, K., Schirra, S.: Generalized and Improved Constructive Separation Bound for Real Algebraic Expressions. Research Report MPI-I-2000-1-004, Max-Planck-Institut f\u00fcr Informatik (2000)"},{"key":"27_CR17","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/978-3-7091-6280-4_16","volume-title":"Symbolic Algebraic Methods and Verification Methods","author":"K. Mehlhorn","year":"2001","unstructured":"Mehlhorn, K., Schirra, S.: Exact Computation with leda real - Theory and Geometric Applications. In: Alefeld, G., Rohn, J., Rump, S.M., Yamamoto, T. (eds.) Symbolic Algebraic Methods and Verification Methods, pp. 163\u2013172. Springer, Wien (2001)"},{"issue":"3","key":"27_CR18","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1016\/0196-6774(82)90019-0","volume":"3","author":"M. Mignotte","year":"1982","unstructured":"Mignotte, M.: Identification of Algebraic Numbers. J. Algorithms\u00a03(3), 197\u2013204 (1982)","journal-title":"J. Algorithms"},{"key":"27_CR19","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4613-9171-5","volume-title":"Mathematics for Computer Algebra","author":"M. Mignotte","year":"1992","unstructured":"Mignotte, M.: Mathematics for Computer Algebra. Springer, New York (1992)"},{"key":"27_CR20","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1145\/190347.190430","volume-title":"International Symposium on Symbolic and Algebraic Computation (ISSAC)","author":"M.B. Monagan","year":"1994","unstructured":"Monagan, M.B., Gonnet, G.H.: Signature Functions for Algebraic Numbers. In: International Symposium on Symbolic and Algebraic Computation (ISSAC), pp. 291\u2013296. ACM, New York (1994)"},{"key":"27_CR21","first-page":"256","volume-title":"18th ACM Symposium on Computational Geometry","author":"S. Pion","year":"2003","unstructured":"Pion, S., Yap, C.: Constructive Root Bound Method for k-ary Rational Input Numbers. In: 18th ACM Symposium on Computational Geometry, pp. 256\u2013263. ACM, New York (2003)"},{"issue":"6","key":"27_CR22","doi-asserted-by":"publisher","first-page":"489","DOI":"10.2307\/2589344","volume":"107","author":"E.R. Scheinerman","year":"2000","unstructured":"Scheinerman, E.R.: When Close Enough is Close Enough. American Mathematical Monthly\u00a0107(6), 489\u2013499 (2000)","journal-title":"American Mathematical Monthly"},{"key":"27_CR23","unstructured":"Schmitt, S.: Common Subexpression Search in leda reals. Report ECG-TR-243105-01, Effective Computational Geometry for Curves and Surfaces (2003)"},{"key":"27_CR24","unstructured":"Schmitt, S.: Common Subexpression Search in leda reals \u2013 a Study of the Diamond Operator. Report ECG-TR-243107-01, Effective Computational Geometry for Curves and Surfaces (2004)"},{"key":"27_CR25","unstructured":"Schmitt, S.: Improved Separation Bounds for the Diamond Operator. Report ECG-TR-363108-01, Effective Computational Geometry for Curves and Surfaces (2004)"},{"issue":"4","key":"27_CR26","doi-asserted-by":"publisher","first-page":"701","DOI":"10.1145\/322217.322225","volume":"27","author":"J.T. Schwartz","year":"1980","unstructured":"Schwartz, J.T.: Fast Probabilistic Algorithms for Verification of Polynomial Identities. J. ACM\u00a027(4), 701\u2013717 (1980)","journal-title":"J. ACM"},{"issue":"1","key":"27_CR27","first-page":"83","volume":"9","author":"H. Sekigawa","year":"1998","unstructured":"Sekigawa, H.: Using Interval Computation with the Mahler Measure for Zero Determination of Algebraic Numbers. Josai University Information Sciences Research\u00a09(1), 83\u201399 (1998)","journal-title":"Josai University Information Sciences Research"},{"key":"27_CR28","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1007\/PL00009321","volume":"18","author":"J.R. Shewchuk","year":"1997","unstructured":"Shewchuk, J.R.: Adaptive Precision Floating-Point Arithmetic and Fast Robust Geometric Predicates. Discrete and Computational Geometry\u00a018, 305\u2013363 (1997)","journal-title":"Discrete and Computational Geometry"},{"key":"27_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1007\/3-540-45410-1_5","volume-title":"Automated Deduction in Geometry","author":"D. Tulone","year":"2001","unstructured":"Tulone, D., Yap, C., Li, C.: Randomized Zero Testing of Radical Expressions and Elementary Geometry Theorem Proving. In: Richter-Gebert, J., Wang, D. (eds.) ADG 2000. LNCS, vol.\u00a02061, pp. 58\u201382. Springer, Heidelberg (2001)"},{"key":"27_CR30","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/0925-7721(95)00040-2","volume":"7","author":"C. Yap","year":"1997","unstructured":"Yap, C.: Towards Exact Geometric Computation. Computational Geometry: Theory and Applications\u00a07, 3\u201323 (1997)","journal-title":"Computational Geometry: Theory and Applications"},{"key":"27_CR31","series-title":"Lecture Notes Series on Computing","doi-asserted-by":"publisher","first-page":"452","DOI":"10.1142\/9789812831699_0011","volume-title":"Computing in Euclidean Geometry","author":"C. Yap","year":"1995","unstructured":"Yap, C., Dub\u00e9, T.: The Exact Computation Paradigm. In: Du, D.Z., Hwang, F.K. (eds.) Computing in Euclidean Geometry. Lecture Notes Series on Computing, vol.\u00a04, pp. 452\u2013492. World Scientific, Singapore (1995)"}],"container-title":["Lecture Notes in Computer Science","Efficient Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-03456-5_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,22]],"date-time":"2019-05-22T04:56:02Z","timestamp":1558500962000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-03456-5_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642034558","9783642034565"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-03456-5_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}