{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T21:41:52Z","timestamp":1725745312736},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319022963"},{"type":"electronic","value":"9783319022970"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-319-02297-0_27","type":"book-chapter","created":{"date-parts":[[2013,8,14]],"date-time":"2013-08-14T07:37:38Z","timestamp":1376465858000},"page":"331-339","source":"Crossref","is-referenced-by-count":0,"title":["A Note on Sekigawa\u2019s Zero Separation Bound"],"prefix":"10.1007","author":[{"given":"Stefan","family":"Schirra","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"27_CR1","doi-asserted-by":"crossref","unstructured":"Burnikel, C., Fleischer, R., Mehlhorn, K., Schirra, S.: Efficient exact geometric computation made easy. In: Proc. 15th Annu. ACM Sympos. Comput. Geom., pp. 341\u2013350 (1999)","DOI":"10.1145\/304893.304988"},{"issue":"1","key":"27_CR2","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_CR3","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_CR4","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_CR5","unstructured":"Cgal, Computational Geometry Algorithms Library, \n                  \n                    http:\/\/www.cgal.org"},{"issue":"1","key":"27_CR6","doi-asserted-by":"publisher","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 Trans. Graph.\u00a09(1), 66\u2013104 (1990)","journal-title":"ACM Trans. Graph."},{"key":"27_CR7","doi-asserted-by":"crossref","unstructured":"Emiris, I.Z., Mourrain, B., Tsigaridas, E.P.: The DMM bound: multivariate (aggregate) separation bounds. In: ISSAC 2010, pp. 243\u2013250 (2010)","DOI":"10.1145\/1837934.1837981"},{"key":"27_CR8","doi-asserted-by":"crossref","unstructured":"Karamcheti, V., Li, C., Pechtchanski, I., Yap, C.: A core library for robust numeric and geometric computation. In: Proceedings of the 15th Annual ACM Symposium on Computational Geometry, Miami, Florida, pp. 351\u2013359 (1999)","DOI":"10.1145\/304893.304989"},{"issue":"1","key":"27_CR9","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_CR10","unstructured":"Li, C., Yap, C.: A new constructive root bound for algebraic expressions. In: 12th ACM-SIAM Symposium on Discrete Algorithms (SODA) (January 2001)"},{"key":"27_CR11","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_CR12","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-Verlag New York, Inc., New York (1992)"},{"issue":"4","key":"27_CR13","doi-asserted-by":"publisher","first-page":"539","DOI":"10.1007\/s11786-011-0086-1","volume":"4","author":"M. M\u00f6rig","year":"2010","unstructured":"M\u00f6rig, M., R\u00f6ssling, I., Schirra, S.: On design and implementation of a generic number type for real algebraic number computations based on expression dags. Mathematics in Computer Science\u00a04(4), 539\u2013556 (2010)","journal-title":"Mathematics in Computer Science"},{"issue":"1-3","key":"27_CR14","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1016\/j.tcs.2006.09.010","volume":"369","author":"S. Pion","year":"2006","unstructured":"Pion, S., Yap, C.: Constructive root bound for k-ary rational input numbers. Journal of Theoretical Computer Science (TCS)\u00a0369(1-3), 361\u2013376 (2006)","journal-title":"Journal of Theoretical Computer Science (TCS)"},{"issue":"6","key":"27_CR15","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. Am. Math. Mon.\u00a0107(6), 489\u2013499 (2000)","journal-title":"Am. Math. Mon."},{"key":"27_CR16","doi-asserted-by":"crossref","unstructured":"Schirra, S.: Robustness and precision issues in geometric computation. In: Sack, J.R., Urrutia, J. (eds.) Handbook of Computational Geometry, ch. 14, pp. 597\u2013632. Elsevier (1999)","DOI":"10.1016\/B978-044482537-7\/50015-2"},{"issue":"1","key":"27_CR17","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), 1\u201317 (1998)","journal-title":"Discrete & Computational Geometry"},{"issue":"1","key":"27_CR18","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_CR19","unstructured":"Sekigawa, H.: Zero Determination of Algebraic Numbers using Approximate Computation and its Application to Algorithms in Computer Algebra. PhD thesis, University of Tokyo (2004)"},{"key":"27_CR20","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/0925-7721(95)00040-2","volume":"7","author":"C.K. Yap","year":"1997","unstructured":"Yap, C.K.: Towards exact geometric computation. Computational Geometry: Theory and Applications\u00a07, 3\u201323 (1997)","journal-title":"Computational Geometry: Theory and Applications"},{"key":"27_CR21","unstructured":"Yap, C.-K.: Fundamental problems of algorithmic algebra. Oxford University Press (2000)"},{"key":"27_CR22","first-page":"927","volume-title":"Handbook of Discrete and Computational Geometry","author":"C.K. Yap","year":"2004","unstructured":"Yap, C.K.: Robust geometric computation. In: Goodman, J.E., O\u2019Rourke, J. (eds.) Handbook of Discrete and Computational Geometry, ch. 41, 2nd edn., pp. 927\u2013952. Chapmen & Hall\/CRC, Boca Raton (2004); revised and expanded from 1997 version","edition":"2"},{"key":"27_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"380","DOI":"10.1007\/978-3-642-03456-5_26","volume-title":"Efficient Algorithms","author":"C.K. Yap","year":"2009","unstructured":"Yap, C.K.: In praise of numerical computation. In: Albers, S., Alt, H., N\u00e4her, S. (eds.) Efficient Algorithms. LNCS, vol.\u00a05760, pp. 380\u2013407. Springer, Heidelberg (2009)"},{"key":"27_CR24","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.K. Yap","year":"1995","unstructured":"Yap, C.K., Dub\u00e9, T.: The exact computation paradigm. In: Du, D.-Z., Hwang, F.K. (eds.) Computing in Euclidean Geometry, 2nd edn. Lecture Notes Series on Computing, vol.\u00a04, pp. 452\u2013492. World Scientific, Singapore (1995)","edition":"2"}],"container-title":["Lecture Notes in Computer Science","Computer Algebra in Scientific Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-02297-0_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,16]],"date-time":"2019-05-16T12:21:36Z","timestamp":1558009296000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-02297-0_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783319022963","9783319022970"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-02297-0_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}