{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T21:03:38Z","timestamp":1725570218619},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540401568"},{"type":"electronic","value":"9783540448426"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-44842-x_94","type":"book-chapter","created":{"date-parts":[[2010,11,19]],"date-time":"2010-11-19T16:38:01Z","timestamp":1290184681000},"page":"923-930","source":"Crossref","is-referenced-by-count":0,"title":["On the Reliability of Triangle Intersection in 3D"],"prefix":"10.1007","author":[{"given":"Steven","family":"Robbins","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sue","family":"Whitesides","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2003,6,18]]},"reference":[{"key":"94_CR1","doi-asserted-by":"crossref","unstructured":"M.J. Aftosmis, M.J. Berger, and J.E. Melton. Robust and efficient cartesian mesh generation for component-based geometry. In 35th AIAA Aerospace Sciences Meeting, Reno NV, USA, January 1997. AIAA97-0196.","DOI":"10.2514\/6.1997-196"},{"key":"94_CR2","doi-asserted-by":"crossref","unstructured":"Herv\u00e9 Br\u00f6nnimann, Christoph Burnikel, and Sylvain Pion. Interval arithmetic yields efficient dynamic filters for computational geometry. In Proc. 14th Annu. ACM Sympos. Comput. Geom., pages 165\u2013174, 1998.","DOI":"10.1145\/276884.276903"},{"key":"94_CR3","doi-asserted-by":"crossref","unstructured":"Christoph Burnikel, Stefan Funke, and Michael Seel. Exact geometric predicates using cascaded computation. In Proc. 14th Annu. ACM Sympos. Comput. Geom., pages 175\u2013183, 1998.","DOI":"10.1145\/276884.276904"},{"key":"94_CR4","unstructured":"Christoph Burnikel, Kurt Mehlhorn, and Stefan Schirra. The LEDA class real number. Technical Report MPI-I-96-1-001, Max-Planck-Institut fur Informatik, January 1996."},{"key":"94_CR5","unstructured":"CORE. The core library, v1.5. Web Page, 2002. http:\/\/www.cs.nyu.edu\/exact\/core\/ ."},{"key":"94_CR6","doi-asserted-by":"publisher","first-page":"737","DOI":"10.1016\/S0010-4485(00)00050-6","volume":"32","author":"M. Gavrilova","year":"2000","unstructured":"Marina Gavrilova and Jon Rokne. Reliable line segment intersection testing. Computer-Aided Design, 32:737\u2013745, 2000.","journal-title":"Computer-Aided Design"},{"key":"94_CR7","doi-asserted-by":"crossref","unstructured":"S. Gottschalk, Ming C. Lin, and D. Manocha. OBBTree: A hierarchical structure for rapid interference detection. In ACM Siggraph, 1996.","DOI":"10.1145\/237170.237244"},{"issue":"4","key":"94_CR8","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1080\/10867651.1997.10487482","volume":"2","author":"M. Held","year":"1997","unstructured":"Martin Held. ERIT: A collection of efficient and reliable intersection tests. Journal of Graphics Tools, 2(4):25\u201344, 1997.","journal-title":"Journal of Graphics Tools"},{"key":"94_CR9","doi-asserted-by":"crossref","unstructured":"V. Karamcheti, C. Li, I. Pechtchanski, and C. Yap. A core library for robust numeric and geometric computation. In Proc. 15th Annual ACM Symp. Comput. Geom., pages 351\u2013359, 1999.","DOI":"10.1145\/304893.304989"},{"issue":"1","key":"94_CR10","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1145\/99902.99905","volume":"10","author":"M. Karasick","year":"1991","unstructured":"Michael Karasick, Derek Lieber, and Lee R. Nackman. Efficient delaunay triangulation using rational arithmetic. ACM Transactions on Graphics, 10(1):71\u201391, January 1991.","journal-title":"ACM Transactions on Graphics"},{"key":"94_CR11","unstructured":"Chen Li and Chee Yap. Recent progress in exact geometric computation. http:\/\/cs.nyu.edu\/exact\/doc\/dimacs.ps.gz , June 2001."},{"key":"94_CR12","unstructured":"K. Mehlhorn and S. Naher. The LEDA Platform of Combinatorial and Geometric Computing. Cambridge University Press, 1999."},{"issue":"2","key":"94_CR13","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1080\/10867651.1997.10487472","volume":"2","author":"T. M\u00f6ller","year":"1997","unstructured":"Tomas M\u00f6ller. A fast triangle-triangle intersection test. Journal of Graphics Tools, 2(2): 25\u201330, 1997.","journal-title":"Journal of Graphics Tools"},{"key":"94_CR14","unstructured":"Joseph O\u2019Rourke. Computational Geometry in C. Cambridge University Press, second edition, 1998."},{"key":"94_CR15","doi-asserted-by":"crossref","unstructured":"T. Ottmann, G. Theimt, and C. Ullrich. Numerical stability of geometric algorithms. In Proceedings of the third annual symposium on Computational geometry, pages 119\u2013125. ACM Press, 1987.","DOI":"10.1145\/41958.41970"},{"issue":"3","key":"94_CR16","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1007\/PL00009321","volume":"18","author":"J. R. Shewchuk","year":"1997","unstructured":"Jonathan Richard Shewchuk. Adaptive precision floating-point arithmetic and fast robust geometric predicates. Discrete and Computational Geometry, 18(3):305\u2013363, October 1997. Source code available at http:\/\/www.cs.cmu.edu\/~quake\/robust.html .","journal-title":"Discrete and Computational Geometry"},{"key":"94_CR17","doi-asserted-by":"crossref","unstructured":"Chee Yap and Thomas Dub\u00e9. The exact computation paradigm. In Ding-Zhu Du and Frank Hwang, editors, Computing in Euclidean Geometry. World Scientific, second edition, 1995.","DOI":"10.1142\/9789812831699_0011"},{"key":"94_CR18","unstructured":"Chee K. Yap. Robust geometric computation. In Jacob E. Goodman and Joseph O\u2019Rourke, editors, Handbook of Discrete and Computational Geometry. CRC Press, 1997."},{"key":"94_CR19","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1142\/S0218195902000785","volume":"12","author":"A. Zomorodian","year":"2002","unstructured":"Afra Zomorodian and Herbert Edelsbrunner. Fast software for box intersections. International Journal of Computational Geometry and Applications, 12:143\u2013172, 2002.","journal-title":"International Journal of Computational Geometry and Applications"}],"container-title":["Lecture Notes in Computer Science","Computational Science and Its Applications \u2014 ICCSA 2003"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44842-X_94","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,6]],"date-time":"2019-06-06T07:37:14Z","timestamp":1559806634000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44842-X_94"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540401568","9783540448426"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/3-540-44842-x_94","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2003]]}}}