{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,6]],"date-time":"2025-11-06T11:38:26Z","timestamp":1762429106719,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540877431"},{"type":"electronic","value":"9783540877448"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-87744-8_62","type":"book-chapter","created":{"date-parts":[[2008,8,30]],"date-time":"2008-08-30T09:20:52Z","timestamp":1220088052000},"page":"744-755","source":"Crossref","is-referenced-by-count":12,"title":["How Reliable Are Practical Point-in-Polygon Strategies?"],"prefix":"10.1007","author":[{"given":"Stefan","family":"Schirra","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"62_CR1","unstructured":"Akenine-M\u00f6ller, T., Haines, E.: Real-Time Rendering, 2nd edn. AK Peters, Ltd. (2002)"},{"key":"62_CR2","doi-asserted-by":"crossref","unstructured":"Auer, T., Held, M.: Heuristics for the generation of random polygons. In: Proc. of CCCG 1996, pp. 38\u201344 (1996)","DOI":"10.1515\/9780773591134-009"},{"key":"62_CR3","unstructured":"CGAL, Computational Geometry Algorithms Library, \n                      http:\/\/www.cgal.org"},{"key":"62_CR4","series-title":"NATO ASI","first-page":"707","volume-title":"Fundamental Algorithms for Computer Graphics","author":"A.R. Forrest","year":"1985","unstructured":"Forrest, A.R.: Computational geometry in practice. In: Earnshaw, R.A. (ed.) Fundamental Algorithms for Computer Graphics. NATO ASI, vol.\u00a0F17, pp. 707\u2013724. Springer, Heidelberg (1985)"},{"key":"62_CR5","unstructured":"Franklin, W.R.: PNPOLY\u2013point inclusion in polygon test, \n                      http:\/\/www.ecse.rpi.edu\/Homepages\/wrf\/Research\/Short_Notes\/pnpoly.html"},{"key":"62_CR6","doi-asserted-by":"publisher","first-page":"606","DOI":"10.1145\/355580.369118","volume":"5","author":"R. Hacker","year":"1962","unstructured":"Hacker, R.: Certification of algorithm 112: position of point relative to polygon. Commun. ACM\u00a05, 606 (1962)","journal-title":"Commun. ACM"},{"key":"62_CR7","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":"Haines, E.: Point in polygon strategies. In: Heckbert, P. (ed.) Graphics Gems IV, pp. 24\u201346. Academic Press, Boston (1994), \n                      http:\/\/tog.acm.org\/editors\/erich\/ptinpoly\/"},{"key":"62_CR8","doi-asserted-by":"crossref","unstructured":"Haran, I., Halperin, D.: An experimental study of point location in general planar arrangements. In: Proc. of ALENEX 2006, pp. 16\u201325 (2006)","DOI":"10.1137\/1.9781611972863.2"},{"issue":"1","key":"62_CR9","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1016\/j.comgeo.2007.06.003","volume":"40","author":"L. Kettner","year":"2008","unstructured":"Kettner, L., Mehlhorn, K., Pion, S., Schirra, S., Yap, C.: Classroom examples of robustness problems in geometric computations. Comput. Geom. Theory Appl.\u00a040(1), 61\u201378 (2008)","journal-title":"Comput. Geom. Theory Appl."},{"key":"62_CR10","volume-title":"LEDA: A Platform for Combinatorial and Geometric Computing","author":"K. Mehlhorn","year":"2000","unstructured":"Mehlhorn, K., N\u00e4her, S.: LEDA: A Platform for Combinatorial and Geometric Computing. Cambridge University Press, Cambridge (2000)"},{"key":"62_CR11","unstructured":"Nassar, A., Walden, P., Haines, E., Dickens, T., Capelli, R., Narasimhan, S., Jam, C., MacMartin, S.: Fastest point in polygon test. Ray Tracing News\u00a05(3) (1992)"},{"key":"62_CR12","unstructured":"Schirra, S.: Companion pages to How reliable are practical point in polygon strategies? \n                      http:\/\/wwwisg.cs.uni-magdeburg.de\/ag\/pointInPolygonReliability\/"},{"issue":"3","key":"62_CR13","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1007\/PL00009321","volume":"18","author":"J.R. Shewchuk","year":"1997","unstructured":"Shewchuk, J.R.: Adaptive precision floating-point arithmetic and fast robust geometric predicates. Discrete & Computational Geometry\u00a018(3), 305\u2013368 (1997)","journal-title":"Discrete & Computational Geometry"},{"key":"62_CR14","doi-asserted-by":"publisher","first-page":"434","DOI":"10.1145\/368637.368653","volume":"5","author":"M. Shimrat","year":"1962","unstructured":"Shimrat, M.: Algorithm 112: position of point relative to polygon. Commun. ACM\u00a05, 434 (1962)","journal-title":"Commun. ACM"},{"key":"62_CR15","first-page":"767","volume-title":"Handbook of Discrete and Computational Geometry, ch. 34","author":"J. Snoeyink","year":"2004","unstructured":"Snoeyink, J.: Point location. In: Goodman, J.E., O\u2019Rourke, J. (eds.) Handbook of Discrete and Computational Geometry, ch. 34, 2nd edn., pp. 767\u2013786. CRC Press LLC, Boca Raton (2004)","edition":"2"},{"key":"62_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1007\/3-540-48518-X_7","volume-title":"Algorithm Engineering and Experimentation","author":"R. Walker","year":"1999","unstructured":"Walker, R., Snoeyink, J.: Practical point-in-polygon tests using CSG representations of polygons. In: Goodrich, M.T., McGeoch, C.C. (eds.) ALENEX 1999. LNCS, vol.\u00a01619, pp. 114\u2013123. Springer, Heidelberg (1999)"},{"key":"62_CR17","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1016\/B978-0-12-336156-1.50012-4","volume-title":"Graphics Gems IV","author":"K. Weiler","year":"1994","unstructured":"Weiler, K.: An incremental angle point in polygon test. In: Heckbert, P. (ed.) Graphics Gems IV, pp. 16\u201323. Academic Press, Boston (1994)"},{"key":"62_CR18","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/0925-7721(95)00040-2","volume":"7","author":"C.-K. Yap","year":"1997","unstructured":"Yap, C.-K.: Towards exact geometric computation. Comput. Geom.\u2013Theory and Appl.\u00a07, 3\u201323 (1997)","journal-title":"Comput. Geom.\u2013Theory and Appl."}],"container-title":["Lecture Notes in Computer Science","Algorithms - ESA 2008"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-87744-8_62","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,7]],"date-time":"2024-05-07T05:20:05Z","timestamp":1715059205000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-540-87744-8_62"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540877431","9783540877448"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-87744-8_62","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}