{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,29]],"date-time":"2025-08-29T00:03:11Z","timestamp":1756425791636,"version":"3.44.0"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540662273"},{"type":"electronic","value":"9783540485186"}],"license":[{"start":{"date-parts":[[1999,1,1]],"date-time":"1999-01-01T00:00:00Z","timestamp":915148800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[1999,1,1]],"date-time":"1999-01-01T00:00:00Z","timestamp":915148800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/3-540-48518-x_7","type":"book-chapter","created":{"date-parts":[[2007,11,14]],"date-time":"2007-11-14T13:57:15Z","timestamp":1195048635000},"page":"114-128","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Practical Point-in-Polygon Tests Using CSG Representations of Polygons"],"prefix":"10.1007","author":[{"given":"Robert J.","family":"Walker","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jack","family":"Snoeyink","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,4,19]]},"reference":[{"key":"7_CR1","first-page":"199","volume-title":"Graphics Gems III","author":"F. Antonio","year":"1992","unstructured":"Franklin Antonio. Faster line segment intersection. In David Kirk, editor, Graphics Gems III, chapter 1.4, pages 199\u2013202. Academic Press, Boston, MA, USA, 1992."},{"key":"7_CR2","doi-asserted-by":"crossref","first-page":"390","DOI":"10.1016\/B978-0-08-050753-8.50082-6","volume-title":"Graphics Gems","author":"D. Badouel","year":"1990","unstructured":"Didier Badouel. An efficient ray-polygon intersection. In Andrew S. Glassner, editor, Graphics Gems, pages 390\u2013393. Academic Press, Boston, MA, 1990."},{"issue":"9","key":"7_CR3","doi-asserted-by":"publisher","first-page":"993","DOI":"10.1109\/12.537122","volume":"45","author":"B. Bollig","year":"1996","unstructured":"B. Bollig and I. Wegener. Improving the variable ordering of OBDDs is NP-complete. IEEE Transactions on Computers, 45(9):993\u20131002, 1996.","journal-title":"IEEE Transactions on Computers"},{"issue":"6","key":"7_CR4","doi-asserted-by":"publisher","first-page":"677","DOI":"10.1109\/TC.1986.1676819","volume":"C-35","author":"R. E. Bryant","year":"1986","unstructured":"Randal E. Bryant. Graph-based algorithms for Boolean function manipulation. IEEE Transactions on Computers, C-35(6):677\u2013691, August 1986.","journal-title":"IEEE Transactions on Computers"},{"issue":"3","key":"7_CR5","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1145\/136035.136043","volume":"24","author":"R. E. Bryant","year":"1992","unstructured":"Randal E. Bryant. Symbolic Boolean manipulation with ordered binary-decision diagrams. ACM Computing Surveys, 24(3):293\u2013318, September 1992.","journal-title":"ACM Computing Surveys"},{"key":"7_CR6","doi-asserted-by":"crossref","unstructured":"David Dobkin, Leonidas Guibas, John Hershberger, and Jack Snoeyink. An effcient algorithm for finding the CSG representation of a simple polygon. In John Dill, editor, Computer Graphics (SIGGRAPH\u2019 88 Proceedings), volume 22, pages 31\u201340, August 1988.","DOI":"10.1145\/378456.378472"},{"key":"7_CR7","unstructured":"Chris Green. Simple, fast triangle intersection. Ray Tracing News, 6(1), 1993. ftp:\/\/ftp.princeton.edu\/pub\/Graphics\/RTNews."},{"key":"7_CR8","doi-asserted-by":"publisher","first-page":"606","DOI":"10.1145\/355580.369118","volume":"5","author":"R. Hacker","year":"1962","unstructured":"R. Hacker. Certification of algorithm 112: position of point relative to polygon. Communications of the ACM, 5:606, 1962.","journal-title":"Communications of the ACM"},{"key":"7_CR9","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1016\/B978-0-12-336156-1.50013-6","volume-title":"Graphics Gems IV","author":"E. Haines","year":"1994","unstructured":"Eric Haines. Point in polygon strategies. In Paul S. Heckbert, editor, Graphics Gems IV, chapter 1.4, pages 24\u201346. Academic Press, Boston, MA, USA, 1994."},{"key":"7_CR10","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-1098-6","volume-title":"Computational Geometry: An Introduction","author":"F. P. Preparata","year":"1985","unstructured":"Franco P. Preparata and Micheal Ian Shamos. Computational Geometry: An Introduction. Springer-Verlag, Berlin, Germany, 1985."},{"key":"7_CR11","doi-asserted-by":"publisher","first-page":"434","DOI":"10.1145\/368637.368653","volume":"5","author":"M. Shimrat","year":"1962","unstructured":"M. Shimrat. Algorithm 112: position of point relative to polygon. Communications of the ACM, 5:434, 1962.","journal-title":"Communications of the ACM"},{"issue":"4","key":"7_CR12","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1145\/37402.37417","volume":"21","author":"J. M. Snyder","year":"1987","unstructured":"John M. Snyder and Alan H. Barr. Ray tracing complex models containing surface tessellations. Computer Graphics (SIGGRAPH\u2019 87 Proceedings), 21(4):119\u2013128, July 1987.","journal-title":"Computer Graphics (SIGGRAPH\u2019 87 Proceedings)"},{"key":"7_CR13","unstructured":"John Spackman. Simple, fast triangle intersection, part II. Ray Tracing News, 6(2), 1993. ftp:\/\/ftp.princeton.edu\/pub\/Graphics\/RTNews."},{"key":"7_CR14","doi-asserted-by":"crossref","unstructured":"Jorge Stolfi. Oriented Projective Geometry: A Framework for Geometric Computations. Academic Press, 1991.","DOI":"10.1016\/B978-0-12-672025-9.50004-6"}],"container-title":["Lecture Notes in Computer Science","Algorithm Engineering and Experimentation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48518-X_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,28]],"date-time":"2025-08-28T07:51:30Z","timestamp":1756367490000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/3-540-48518-X_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540662273","9783540485186"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3-540-48518-x_7","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[1999]]},"assertion":[{"value":"19 April 2002","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}