{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T20:30:38Z","timestamp":1761597038120},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540441809"},{"type":"electronic","value":"9783540457497"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45749-6_19","type":"book-chapter","created":{"date-parts":[[2007,7,4]],"date-time":"2007-07-04T11:42:44Z","timestamp":1183549364000},"page":"174-186","source":"Crossref","is-referenced-by-count":22,"title":["A Computational Basis for Conic Arcs and Boolean Operations on Conic Polygons"],"prefix":"10.1007","author":[{"given":"Eric","family":"Berberich","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Arno","family":"Eigenwillig","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Hemmer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Susan","family":"Hert","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kurt","family":"Mehlhorn","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Elmar","family":"Sch\u00f6mer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,8,29]]},"reference":[{"issue":"9","key":"19_CR1","doi-asserted-by":"crossref","first-page":"643","DOI":"10.1109\/TC.1979.1675432","volume":"C-28","author":"Bentley","year":"1979","unstructured":"J. Bentley and T. Ottmann. Algorithms for reporting and counting geometric intersections. IEEE Transaction on Computers C 28, pages 643\u2013647, 1979.","journal-title":"IEEE Transactions on Computers"},{"key":"19_CR2","doi-asserted-by":"crossref","unstructured":"R. Bix. Conics and Cubics: A Concrete Introduction to Algebraic Curves. Springer Verlag, 1998.","DOI":"10.1007\/978-1-4757-2975-7"},{"key":"19_CR3","series-title":"Research Report","volume-title":"Robust plane sweep for intersecting segments","author":"J.-D. Boissonnat","year":"1997","unstructured":"J.-D. Boissonnat and F. P. Preparata. Robust plane sweep for intersecting segments. Research Report 3270, INRIA, Sophia Antipolis, Sept. 1997."},{"key":"19_CR4","doi-asserted-by":"crossref","unstructured":"J.-D. Boissonnat and J. Snoeyink. Efficient algorithms for line and curve segment intersection using restricted predicates. In Proc. 15th Annu. ACM Sympos. Comput. Geom., pages 370\u2013379, 1999.","DOI":"10.1145\/304893.304991"},{"key":"19_CR5","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1007\/3-540-44676-1_21","volume-title":"ESA 2001","author":"C. Burnikel","year":"2001","unstructured":"C. Burnikel, S. Funke, K. Mehlhorn, S. Schirra, and S. Schmitt. A separation bound for real algebraic expressions. In ESA 2001, volume 2161 of LNCS, pages 254\u2013265, 2001."},{"issue":"4","key":"19_CR6","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1016\/S0925-7721(00)00012-2","volume":"16","author":"T.M. Chan","year":"2000","unstructured":"T.M. Chan. Reporting curve segment intersection using restricted predicates. Computational Geometry, 16(4):245\u2013256, 2000.","journal-title":"Computational Geometry"},{"key":"19_CR7","doi-asserted-by":"publisher","first-page":"272","DOI":"10.1145\/800205.806346","volume-title":"SYMSAC","author":"G.E. Collins","year":"1976","unstructured":"G.E. Collins and A.-G. Akritas. Polynomial real root isolation using Descartes\u2019 rule of sign. In SYMSAC, pages 272\u2013275, Portland, OR, 1976."},{"key":"19_CR8","volume-title":"Ideals, Varieties, and Algorithms","author":"D. Cox","year":"1997","unstructured":"D. Cox, J. Little, and D. O\u2019Shea. Ideals, Varieties, and Algorithms. Springer-Verlag New York, Inc., 2nd edition, 1997.","edition":"2nd edition"},{"key":"19_CR9","doi-asserted-by":"crossref","unstructured":"M. de Berg, M. Kreveld, M. Overmars, and O. Schwarzkopf. Computational Geometry: Algorithms and Applications. Springer, 1997.","DOI":"10.1007\/978-3-662-03427-9"},{"key":"19_CR10","unstructured":"O. Devillers, A. Fronville, B. Mourrain, and M. Teillaud. Exact predicates for circle arcs arrangements. In Proc. 16th Annu. ACM Sympos. Comput. Geom., 2000."},{"key":"19_CR11","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1007\/BF01840397","volume":"5","author":"D.P. Dobkin","year":"1990","unstructured":"D.P. Dobkin and D.L. Souvaine. Computational geometry in a curved world. Algorithmica, 5:421\u2013457, 1990.","journal-title":"Algorithmica"},{"key":"19_CR12","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1007\/BF01762127","volume":"3","author":"D.P. Dobkin","year":"1988","unstructured":"D.P. Dobkin, D. L. Souvaine, and C. J. Van Wyk. Decomposition and intersection of simple splinegons. Algorithmica, 3:473\u2013486, 1988.","journal-title":"Algorithmica"},{"key":"19_CR13","doi-asserted-by":"crossref","unstructured":"L. Dupont, D. Lazard, S. Lazard, and S. Petitjean. A new algorithm for the robuts intersection of two general quadrics. submitted to Solid Modelling 2002.","DOI":"10.1007\/978-1-4615-0813-7_5"},{"key":"19_CR14","doi-asserted-by":"publisher","first-page":"1167","DOI":"10.1002\/1097-024X(200009)30:11<1167::AID-SPE337>3.0.CO;2-B","volume":"30","author":"A. Fabri","year":"2000","unstructured":"A. Fabri, G.-J. Giezeman, L. Kettner, S. Schirra, and S. Sch\u00f6nherr. On the design of CGAL, the computational geometry algorithms library. Software\u2014Practice and Experience, 30:1167\u20131202, 2000.","journal-title":"Software\u2014Practice and Experience"},{"key":"19_CR15","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"154","DOI":"10.1007\/3-540-48318-7_14","volume-title":"1999","author":"E. Flato","year":"1999","unstructured":"E. Flato, D. Halperin, I. Hanniel, and O. Nechushtan. The design and implementation of planar maps in CGAL. In Proceedings of the 3rd Workshop on Algorithm Engineering, volume 1668 of Lecture Notes in Computer Science, pages 154\u2013168. Springer, 1999."},{"key":"19_CR16","doi-asserted-by":"crossref","unstructured":"S. Funke and K. Mehlhorn. Look\u2014a lazy object-oriented kernel for geometric computation. In Proceedings of the 16th Annual Symposium on Computational Geometry (SCG-00), pages 156\u2013165, Hong Kong, China, June 2000. Association of Computing Machinery (ACM), ACM Press.","DOI":"10.1145\/336154.336196"},{"key":"19_CR17","doi-asserted-by":"crossref","unstructured":"N. Geismann, M. Hemmer, and E. Sch\u00f6mer. Computing a 3-dimensional cell in an arrangement of quadrics: Exactly and actually. In ACM Conference on Computational Geometry, 2001.","DOI":"10.1145\/378583.378689"},{"key":"19_CR18","unstructured":"M. Hemmer. Reliable computation of planar and spatial arrangements of quadrics. Master\u2019s thesis, Max-Planck-Institut f\u00fcr Informatik, 2002."},{"key":"19_CR19","doi-asserted-by":"crossref","unstructured":"J. Keyser, T. Culver, M. Foskey, S. Krishnan, and D. Manocha. Esolid\u2014a system for exact boundary evaluation. submitted to Solid Modelling 2002.","DOI":"10.1145\/566282.566289"},{"key":"19_CR20","series-title":"Technical Report","volume-title":"MAPC: A library for efficient and exact manipulation of algebraic points and curves","author":"J. Keyser","year":"1998","unstructured":"J. Keyser, T. Culver, D. Manocha, and S. Krishnan. MAPC: A library for efficient and exact manipulation of algebraic points and curves. Technical Report TR98-038, University of N. Carolina, Chapel Hill, 1998."},{"key":"19_CR21","unstructured":"K. Mehlhorn and S. N\u00e4her. The LEDA Platform for Combinatorial and Geometric Computing. Cambridge University Press, 1999. 1018 pages."},{"key":"19_CR22","series-title":"Lect Notes Comput Sci","first-page":"13","volume-title":"Generic programming","author":"D.R. Musser","year":"1996","unstructured":"D.R. Musser and A.A. Stepanov. Generic programming. In 1st Intl. Joint Conf. of ISSAC-88 and AAEC-6, pages 13\u201325. Springer LNCS 358, 1989."},{"key":"19_CR23","unstructured":"F. Rouillier and P. Zimmermann. Efficient isolation of polynomial real roots. Technical Report 4113, INRIA, 2001."},{"key":"19_CR24","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1016\/0196-6774(87)90028-9","volume":"8","author":"A. A. Sch\u00e4ffer","year":"1987","unstructured":"A. A. Sch\u00e4ffer and C. J. Van Wyk. Convex hulls of piecewise-smooth Jordan curves. J. Algorithms, 8:66\u201394, 1987.","journal-title":"J. Algorithms"},{"key":"19_CR25","doi-asserted-by":"crossref","first-page":"884","DOI":"10.1007\/3-540-45749-6_76","volume-title":"Algorithms \u2014 ESA 2002","author":"Ron Wein","year":"2002","unstructured":"R. Wein. High-level.ltering for arrangements of conic arcs. In Proceedings of ESA 2002, 2002."}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2014 ESA 2002"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45749-6_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,29]],"date-time":"2019-04-29T23:06:23Z","timestamp":1556579183000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45749-6_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540441809","9783540457497"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/3-540-45749-6_19","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}