{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T23:24:44Z","timestamp":1773271484588,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540425120","type":"print"},{"value":"9783540446910","type":"electronic"}],"license":[{"start":{"date-parts":[[2001,1,1]],"date-time":"2001-01-01T00:00:00Z","timestamp":978307200000},"content-version":"tdm","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":[[2001]]},"DOI":"10.1007\/3-540-44691-5_15","type":"book-chapter","created":{"date-parts":[[2007,6,2]],"date-time":"2007-06-02T22:32:07Z","timestamp":1180823527000},"page":"171-182","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Two-Dimensional Arrangements in CGAL and Adaptive Point Location for Parametric Curves"],"prefix":"10.1007","author":[{"given":"Iddo","family":"Hanniel","sequence":"first","affiliation":[]},{"given":"Dan","family":"Halperin","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,8,24]]},"reference":[{"key":"15_CR1","unstructured":"N. Amenta. Directory of computational geometry software. \nhttp:\/\/www.geom.umn.edu\/software\/cglist\/\n\n."},{"key":"15_CR2","unstructured":"N. Amenta.Computational geometry software. In J.E. Goodman and J. O\u2019Rourke, editors, Handbook of Discrete and Computational Geometry, chapter 52, pages 951\u2013960. CRC Press LLC, Boca Raton, FL, 1997."},{"key":"15_CR3","unstructured":"M. Austern.Generic Programming and the STL-Using and Extending the C ++ Standard Template Library. Addison-Wesley, 1999."},{"key":"15_CR4","unstructured":"H. Br\u00f6nniman, L. Kettner, S. Schirra, and R. Veltkamp. Applications of the generic programming paradigm in the design of CGAL.Technical Report MPI\u2013I\u201398\u20131\u2013030, Max-Planck-Insitut f \u00fcr Informatik, 66123 Saarbr\u00fccken, Germany, 1998."},{"key":"15_CR5","doi-asserted-by":"crossref","unstructured":"M. de Berg, M. van Kreveld, M. Overmars, and O. chwarzkopf. Computational Geometry:Algorithms and Applications. Springer-Verlag, Heidelberg, Germany, 1997.","DOI":"10.1007\/978-3-662-03427-9"},{"key":"15_CR6","doi-asserted-by":"crossref","unstructured":"H. Edelsbrunner. Algorithms in Combinatorial Geometry, volume 10 of EATCS Monographs on Theoretical Computer Science. Springer-Verlag, Heidelberg, West Germany, 1987.","DOI":"10.1007\/978-3-642-61568-9"},{"key":"15_CR7","doi-asserted-by":"crossref","unstructured":"A. Fabri, G. Giezeman, L. Kettner, S. Schirra, and S. Sch\u00f6nherr.The CGAL kernel:A basis for geometric computation. In M.C. Lin and D. Manocha, editors, Proc.1st ACM Workshop on Appl.Comput.Geom., volume 1148 of Lecture Notes Comput.Sci., pages 191\u2013202. Springer-Verlag, 1996.","DOI":"10.1007\/BFb0014496"},{"key":"15_CR8","doi-asserted-by":"crossref","unstructured":"G. Farin. Curves and Surfaces for Computer Aided Geometric Design. Academic Press, 3rd edition,1993.","DOI":"10.1016\/B978-0-12-249052-1.50005-2"},{"key":"15_CR9","doi-asserted-by":"crossref","unstructured":"E. Flato, D. Halperin, I. Hanniel, and O. Nechushtan. The design andimplementation of planar maps in CGAL. In Proc. of the 3rd Workshop of Algorithm Engineering, volume 1668 of Lecture Notes Comput.Sci., pages 154\u2013168. Springer-Verlag, 1999.","DOI":"10.1007\/3-540-48318-7_14"},{"issue":"3","key":"15_CR10","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1145\/231731.231735","volume":"15","author":"S. Fortune","year":"1996","unstructured":"S. Fortune and C. J. van Wyk. Static analysis yields efficient exact integer arithmetic for computational geometry. ACM Trans.Graph., 15(3): 223\u2013248, July 1996.","journal-title":"ACM Trans.Graph."},{"key":"15_CR11","unstructured":"E. Gamma, R. Helm, R. Johnson, and J. Vlissides. Design Patterns-Elements of Reusable Object-Oriented Software. Addison-Wesley, 1995."},{"key":"15_CR12","doi-asserted-by":"crossref","unstructured":"M. Goldwasser. An implementation for maintaining arrangements of polygons. In Proc. 11th Annu. ACM Sympos. Comput. Geom., pages C32\u2013C33, 1995.","DOI":"10.1145\/220279.220337"},{"key":"15_CR13","doi-asserted-by":"crossref","unstructured":"M. Goodrich, L.J. Guibas, J. Hershberger, and P. Tanenbaum. Snap rounding line segments efficiently in two andthree dimensions. In Proc. 13th Annu. ACM Sympos. Comput. Geom., pages 284\u2013293, 1997.","DOI":"10.1145\/262839.262985"},{"key":"15_CR14","first-page":"389","volume-title":"Handbook of Discrete and Computational Geometry","author":"D. Halperin","year":"1997","unstructured":"D. Halperin. Arrangements. In J.E. Goodman and J. O \u2019Rourke, editors, Handbook of Discrete and Computational Geometry, chapter 21, pages 389\u2013412. CRC Press LLC, Boca Raton,FL, 1997."},{"key":"15_CR15","unstructured":"I. Hanniel. The design and implementation of planar arrangements of curves in CGAL. M. Sc. thesis, Dept. Comput. Sci., Tel Aviv University, Tel Aviv, Israel. Forthcoming, \nhttp:\/\/www.math.tau.ac.il\/hanniel\/ARRG00\/\n\n."},{"key":"15_CR16","doi-asserted-by":"crossref","unstructured":"J. Keyser, T. Culver, D. Manocha, and S. Krishnan. MAPC:a library for efficient manipulation of algebraic points andcurves. In Proc. 15th Annu. ACM Sympos. Comput. Geom., pages 360\u2013369, 1999. \nhttp:\/\/www.cs.unc.edu\/.geom\/MAPC\/\n\n.","DOI":"10.1145\/304893.304990"},{"key":"15_CR17","unstructured":"K. Mehlhorn, S. N\u00e4her, C. Uhrig, and M. Seel. The LEDA User Manual, Version 4.1. Max-Planck-Insitut f\u00fcr Informatik, 66123 Saarbr\u00fccken, Germany, 2000."},{"key":"15_CR18","unstructured":"K. Melhorn and S. N\u00e4her. The LEDA Platform of Combinatorial and Geometric Computing. Cambridge University Press, 1999."},{"key":"15_CR19","unstructured":"M. Neagu and B. Lacolle.Computing the combinatorial structure of arrangements of curves using polygonal approximations. Manuscript.A preliminary version appearedin Proc.14th European Workshop on Computational Geometry, 1998."},{"key":"15_CR20","unstructured":"M. Sharir and P. Agarwal. Davenport-Schinzel Sequences and Their Geometric Applications. Cambridge University Press, 1995."},{"issue":"3","key":"15_CR21","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1007\/PL00009321","volume":"18","author":"J.R. Shewchuk","year":"1997","unstructured":"J.R. Shewchuk. 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_CR22","unstructured":"S. Skiena. The Algorithm Design Manual. Telos\/Springer-Verlag, 1997. \nhttp:\/\/www.cs.sunysb.edu\/.algorith\/index.html\n\n."}],"container-title":["Lecture Notes in Computer Science","Algorithm Engineering"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44691-5_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,29]],"date-time":"2020-04-29T13:04:32Z","timestamp":1588165472000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44691-5_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540425120","9783540446910"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/3-540-44691-5_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2001]]},"assertion":[{"value":"24 August 2001","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}