{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,10]],"date-time":"2024-09-10T02:45:19Z","timestamp":1725936319170},"publisher-location":"Cham","reference-count":38,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319724522"},{"type":"electronic","value":"9783319724539"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-72453-9_15","type":"book-chapter","created":{"date-parts":[[2017,12,20]],"date-time":"2017-12-20T04:35:54Z","timestamp":1513744554000},"page":"211-226","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On Interval Methods with Zero Rewriting and Exact Geometric Computation"],"prefix":"10.1007","author":[{"given":"Stefan","family":"Schirra","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Martin","family":"Wilhelm","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,12,21]]},"reference":[{"key":"15_CR1","doi-asserted-by":"crossref","unstructured":"Benouamer, M.O., Jaillon, P., Michelucci, D., Moreau, J.M.: A lazy exact arithmetic. In: Proceedings of the 11th Symposium on Computer Arithmetic, pp. 242\u2013249. IEEE (1993)","DOI":"10.1109\/ARITH.1993.378086"},{"key":"15_CR2","unstructured":"Boost C++ Libraries. http:\/\/www.boost.org\/"},{"key":"15_CR3","doi-asserted-by":"crossref","unstructured":"Burnikel, C., Fleischer, R., Mehlhorn, K., Schirra, S.: Efficient exact geometric computation made easy. In: Proceedings of the 15th Symposium on Computational Geometry, pp. 341\u2013350. ACM (1999)","DOI":"10.1145\/304893.304988"},{"issue":"1","key":"15_CR4","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1007\/s00453-007-9132-4","volume":"55","author":"C Burnikel","year":"2009","unstructured":"Burnikel, C., Funke, S., Mehlhorn, K., Schirra, S., Schmitt, S.: A separation bound for real algebraic expressions. Algorithmica 55(1), 14\u201328 (2009)","journal-title":"Algorithmica"},{"key":"15_CR5","unstructured":"CGAL: Computational Geometry Algorithms Library. http:\/\/www.cgal.org\/"},{"key":"15_CR6","doi-asserted-by":"crossref","unstructured":"Emiris, I.Z., Mourrain, B., Tsigaridas, E.P.: The DMM bound: multivariate (aggregate) separation bounds. In: Proceedings of the 2010 International Symposium on Symbolic and Algebraic Computation, ISSAC 2010, pp. 243\u2013250. ACM, New York (2010). http:\/\/doi.acm.org\/10.1145\/1837934.1837981","DOI":"10.1145\/1837934.1837981"},{"issue":"3","key":"15_CR7","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1145\/231731.231735","volume":"15","author":"S Fortune","year":"1996","unstructured":"Fortune, S., van Wyk, C.J.: Static analysis yields efficient exact integer arithmetic for computational geometry. ACM Trans. Graph. 15(3), 223\u2013248 (1996)","journal-title":"ACM Trans. Graph."},{"issue":"1\u20133","key":"15_CR8","doi-asserted-by":"crossref","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. Comput. Geom. Theor. Appl. 22(1\u20133), 99\u2013118 (2002)","journal-title":"Comput. Geom. Theor. Appl."},{"issue":"3","key":"15_CR9","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1016\/j.comgeo.2004.12.007","volume":"31","author":"S Funke","year":"2005","unstructured":"Funke, S., Mehlhorn, K., N\u00e4her, S.: Structural filtering: a paradigm for efficient and exact geometric programs. Comput. Geom. Theor. Appl. 31(3), 179\u2013194 (2005)","journal-title":"Comput. Geom. Theor. Appl."},{"key":"15_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1007\/978-3-642-15582-6_19","volume-title":"Mathematical Software \u2013 ICMS 2010","author":"D Halperin","year":"2010","unstructured":"Halperin, D.: Controlled perturbation for certified geometric computing with fixed-precision arithmetic. In: Fukuda, K., Hoeven, J., Joswig, M., Takayama, N. (eds.) ICMS 2010. LNCS, vol. 6327, pp. 92\u201395. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-15582-6_19"},{"key":"15_CR11","doi-asserted-by":"crossref","unstructured":"Halperin, D., Leiserowitz, E.: Controlled perturbation for arrangements of circles. In: Proceedings of the 19th Symposium on Computational Geometry, pp. 264\u2013273. ACM (2003)","DOI":"10.1145\/777792.777832"},{"key":"15_CR12","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1016\/S0925-7721(98)00014-5","volume":"10","author":"D Halperin","year":"1998","unstructured":"Halperin, D., Shelton, C.R.: A perturbation scheme for spherical arrangements with application to molecular modeling. Comput. Geom. Theor. Appl. 10, 273\u2013287 (1998)","journal-title":"Comput. Geom. Theor. Appl."},{"key":"15_CR13","doi-asserted-by":"crossref","unstructured":"Karamcheti, V., Li, C., Pechtchanski, I., Yap, C.K.: A core library for robust numeric and geometric computation. In: Proceedings of the 15th Symposium on Computational Geometry, pp. 351\u2013359. ACM (1999)","DOI":"10.1145\/304893.304989"},{"issue":"4","key":"15_CR14","doi-asserted-by":"crossref","first-page":"176","DOI":"10.1145\/3055282.3055295","volume":"50","author":"A Katayama","year":"2016","unstructured":"Katayama, A., Shirayanagi, K.: A new idea on the interval-symbol method with correct zero rewriting for reducing exact computations. ACM Commun. Comput. Algebra 50(4), 176\u2013178 (2016). http:\/\/doi.acm.org\/10.1145\/3055282.3055295","journal-title":"ACM Commun. Comput. Algebra"},{"key":"15_CR15","unstructured":"Kettner, L., Welzl, E.: One sided error predicates in geometric computing. In: Proceedings of the 15th IFIP World Computer Congress, Fundamentals - Foundations of Computer Science, pp. 13\u201326 (1998)"},{"key":"15_CR16","unstructured":"LEDA: Library of Efficient Data Types and Algorithms. http:\/\/www.algorithmic-solutions.com\/"},{"issue":"1","key":"15_CR17","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1016\/j.jlap.2004.07.006","volume":"64","author":"C Li","year":"2005","unstructured":"Li, C., Pion, S., Yap, C.K.: Recent progress in exact geometric computation. J. Logic Algebr. Program. 64(1), 85\u2013111 (2005)","journal-title":"J. Logic Algebr. Program."},{"issue":"9","key":"15_CR18","doi-asserted-by":"crossref","first-page":"507","DOI":"10.1016\/j.comgeo.2011.06.001","volume":"44","author":"K Mehlhorn","year":"2011","unstructured":"Mehlhorn, K., Osbild, R., Sagraloff, M.: A general approach to the analysis of controlled perturbation algorithms. Comput. Geom. 44(9), 507\u2013528 (2011). http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0925772111000460","journal-title":"Comput. Geom."},{"key":"15_CR19","doi-asserted-by":"crossref","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 3, 197\u2013204 (1982)","journal-title":"J. Algorithms"},{"key":"15_CR20","unstructured":"M\u00f6rig, M.: Algorithm engineering for expression dag based number types. Ph.D. thesis, Otto-von-Guericke-Universit\u00e4t Magdeburg (2015)"},{"key":"15_CR21","unstructured":"MPFR: A multiple precision floating-point library. http:\/\/www.mpfr.org\/"},{"key":"15_CR22","volume-title":"Computational Geometry - An Introduction Through Randomized Algorithms","author":"K Mulmuley","year":"1994","unstructured":"Mulmuley, K.: Computational Geometry - An Introduction Through Randomized Algorithms. Prentice Hall, Englewood Cliffs (1994)"},{"issue":"4","key":"15_CR23","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1016\/j.scico.2010.09.003","volume":"76","author":"S Pion","year":"2011","unstructured":"Pion, S., Fabri, A.: A generic lazy evaluation scheme for exact geometric computations. Sci. Comput. Program. 76(4), 307\u2013323 (2011)","journal-title":"Sci. Comput. Program."},{"issue":"1\u20133","key":"15_CR24","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1016\/j.tcs.2006.09.010","volume":"369","author":"S Pion","year":"2006","unstructured":"Pion, S., Yap, C.K.: Constructive root bound for $$k$$ k -ary rational input numbers. Theor. Comput. Sci. 369(1\u20133), 361\u2013376 (2006)","journal-title":"Theor. Comput. Sci."},{"key":"15_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"408","DOI":"10.1007\/978-3-642-03456-5_27","volume-title":"Efficient Algorithms","author":"S Schirra","year":"2009","unstructured":"Schirra, S.: Much ado about zero. In: Albers, S., Alt, H., N\u00e4her, S. (eds.) Efficient Algorithms. LNCS, vol. 5760, pp. 408\u2013421. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-03456-5_27"},{"key":"15_CR26","unstructured":"Sekigawa, H.: Zero determination of algebraic numbers using approximate computation and its application to algorithms in computer algebra. Ph.D. thesis, University of Tokyo (2004)"},{"issue":"3","key":"15_CR27","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1007\/PL00009321","volume":"18","author":"JR Shewchuk","year":"1997","unstructured":"Shewchuk, J.R.: Adaptive precision floating-point arithmetic and fast robust geometric predicates. Discrete Comput. Geom. 18(3), 305\u2013363 (1997)","journal-title":"Discrete Comput. Geom."},{"key":"15_CR28","unstructured":"Shirayanagi, K., Sweedler, M.: A theory of stabilizing algebraic algorithms. Technical report, Mathematical Sciences Institute, Cornell University (1995)"},{"issue":"6","key":"15_CR29","doi-asserted-by":"crossref","first-page":"761","DOI":"10.1006\/jsco.1998.0238","volume":"26","author":"K Shirayanagi","year":"1998","unstructured":"Shirayanagi, K., Sweedler, M.: Remarks on automatic algorithm stabilization. J. Symb. Comput. 26(6), 761\u2013765 (1998)","journal-title":"J. Symb. Comput."},{"issue":"4\u20136","key":"15_CR30","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1016\/S0378-4754(96)00027-4","volume":"42","author":"K Shirayanagi","year":"1996","unstructured":"Shirayanagi, K.: Floating point Gr\u00f6bner bases. Math. Comput. Simul. 42(4\u20136), 509\u2013528 (1996). https:\/\/doi.org\/10.1016\/S0378-4754(96)00027-4","journal-title":"Math. Comput. Simul."},{"issue":"3\/4","key":"15_CR31","doi-asserted-by":"crossref","first-page":"102","DOI":"10.1145\/1823931.1823950","volume":"43","author":"K Shirayanagi","year":"2009","unstructured":"Shirayanagi, K., Sekigawa, H.: A new method of reducing exact computations to obtain exact results. ACM Commun. Comput. Algebra 43(3\/4), 102\u2013104 (2009). http:\/\/doi.acm.org\/10.1145\/1823931.1823950","journal-title":"ACM Commun. Comput. Algebra"},{"key":"15_CR32","doi-asserted-by":"crossref","unstructured":"Shirayanagi, K., Sekigawa, H.: Reducing exact computations to obtain exact results based on stabilization techniques. In: Proceedings of Numeric Computation 2009, pp. 191\u2013198 (2009). http:\/\/doi.acm.org\/10.1145\/1577190.1577219","DOI":"10.1145\/1577190.1577219"},{"key":"15_CR33","unstructured":"Shirayanagi, K., Sekigawa, H.: Interval-symbol method with correct zero rewriting: reducing exact computations to obtain exact results. In: Proceedings of the 18th Asian Technology Conference in Mathematics, pp. 226\u2013235 (2013)"},{"key":"15_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/978-3-319-13287-7_13","volume-title":"Discrete and Computational Geometry and Graphs","author":"K Sugihara","year":"2014","unstructured":"Sugihara, K.: Computational geometry in the human brain. In: Akiyama, J., Ito, H., Sakai, T. (eds.) JCDCGG 2013. LNCS, vol. 8845, pp. 145\u2013160. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-13287-7_13"},{"issue":"2","key":"15_CR35","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1142\/S0218195994000124","volume":"4","author":"K Sugihara","year":"1994","unstructured":"Sugihara, K., Iri, M.: A robust topology-oriented incremental algorithm for Voronoi diagrams. Int. J. Comput. Geom. Appl. 4(2), 179\u2013228 (1994)","journal-title":"Int. J. Comput. Geom. Appl."},{"issue":"1","key":"15_CR36","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1007\/s004530010002","volume":"27","author":"K Sugihara","year":"2000","unstructured":"Sugihara, K., Iri, M., Inagaki, H., Imai, T.: Topology-oriented implementation - an approach to robust geometric algorithms. Algorithmica 27(1), 5\u201320 (2000)","journal-title":"Algorithmica"},{"issue":"1\u20132","key":"15_CR37","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/0925-7721(95)00040-2","volume":"7","author":"CK Yap","year":"1997","unstructured":"Yap, C.K.: Towards exact geometric computation. Comput. Geom. Theor. Appl. 7(1\u20132), 3\u201323 (1997)","journal-title":"Comput. Geom. Theor. Appl."},{"key":"15_CR38","doi-asserted-by":"crossref","unstructured":"Yap, C.K.: Robust geometric computation. In: Goodman, J.E., O\u2019Rourke, J. (eds.) Handbook of Discrete and Computational Geometry, Chap. 41, 2nd edn., pp. 927\u2013952. CRC, Boca Raton (2004)","DOI":"10.1201\/9781420035315.ch41"}],"container-title":["Lecture Notes in Computer Science","Mathematical Aspects of Computer and Information Sciences"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-72453-9_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,10]],"date-time":"2022-08-10T18:13:53Z","timestamp":1660155233000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-72453-9_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319724522","9783319724539"],"references-count":38,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-72453-9_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}