{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T20:21:48Z","timestamp":1725740508631},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642401039"},{"type":"electronic","value":"9783642401046"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-40104-6_5","type":"book-chapter","created":{"date-parts":[[2013,7,11]],"date-time":"2013-07-11T05:36:30Z","timestamp":1373520990000},"page":"49-60","source":"Crossref","is-referenced-by-count":1,"title":["Distance-Sensitive Planar Point Location"],"prefix":"10.1007","author":[{"given":"Boris","family":"Aronov","sequence":"first","affiliation":[]},{"given":"Mark","family":"de Berg","sequence":"additional","affiliation":[]},{"given":"Marcel","family":"Roeloffzen","sequence":"additional","affiliation":[]},{"given":"Bettina","family":"Speckmann","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"5_CR1","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1145\/1240233.1240240","volume":"3","author":"S. Arya","year":"2007","unstructured":"Arya, S., Malamatos, T., Mount, D.M.: A simple entropy-based algorithm for planar point location. ACM Trans. Algorithms 3, article 17 (2007)","journal-title":"ACM Trans. Algorithms"},{"key":"5_CR2","doi-asserted-by":"publisher","first-page":"584","DOI":"10.1137\/S0097539704446724","volume":"37","author":"S. Arya","year":"2007","unstructured":"Arya, S., Malamatos, T., Mount, D.M., Wong, K.C.: Optimal expected-case planar point location. SIAM J. Comput.\u00a037, 584\u2013610 (2007)","journal-title":"SIAM J. Comput."},{"key":"5_CR3","doi-asserted-by":"crossref","unstructured":"de Berg, M., Cheong, O., van Kreveld, M., Overmars, M.: Computational Geometry: Algorithms and Applications, 3rd edn. Springer (2008)","DOI":"10.1007\/978-3-540-77974-2"},{"key":"5_CR4","doi-asserted-by":"crossref","unstructured":"Bern, M.: Triangulations and mesh generation. In: Goodman, J.E., O\u2019Rourke, J. (eds.) Handbook of Discrete and Computational Geometry, 2nd edn., ch.\u00a025. Chapman & Hall\/CRC (2004)","DOI":"10.1201\/9781420035315.ch25"},{"issue":"3","key":"5_CR5","doi-asserted-by":"publisher","first-page":"384","DOI":"10.1016\/S0022-0000(05)80059-5","volume":"48","author":"M. Bern","year":"1994","unstructured":"Bern, M., Eppstein, D., Gilbert, J.: Provably good mesh generation. J. of Computer and System Sciences\u00a048(3), 384\u2013409 (1994)","journal-title":"J. of Computer and System Sciences"},{"issue":"1","key":"5_CR6","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1007\/BF02570715","volume":"14","author":"M. Bern","year":"1995","unstructured":"Bern, M., Mitchell, S., Ruppert, J.: Linear-size nonobtuse triangulation of polygons. Discrete & Computational Geometry\u00a014(1), 411\u2013428 (1995)","journal-title":"Discrete & Computational Geometry"},{"key":"5_CR7","doi-asserted-by":"publisher","first-page":"485","DOI":"10.1007\/BF02574703","volume":"6","author":"B. Chazelle","year":"1991","unstructured":"Chazelle, B.: Triangulating a simple polygon in linear time. Discrete & Computational Geometry\u00a06, 485\u2013524 (1991)","journal-title":"Discrete & Computational Geometry"},{"issue":"3","key":"5_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2229163.2229173","volume":"8","author":"S. Collette","year":"2012","unstructured":"Collette, S., Dujmovi\u0107, V., Iacono, J., Langerman, S., Morin, P.: Entropy, triangulation, and point location in planar subdivisions. ACM Trans. Algorithms\u00a08(3), 1\u201318 (2012)","journal-title":"ACM Trans. Algorithms"},{"key":"5_CR9","doi-asserted-by":"crossref","unstructured":"Edelsbrunner, H.: Algorithms in Combinatorial Geometry. Springer (1987)","DOI":"10.1007\/978-3-642-61568-9"},{"key":"5_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/BFb0015744","volume-title":"Automata, Languages and Programming","author":"S. Fortune","year":"1985","unstructured":"Fortune, S.: A fast algorithm for polygon containment by translation. In: Brauer, W. (ed.) ICALP 1985. LNCS, vol.\u00a0194, pp. 189\u2013198. Springer, Heidelberg (1985)"},{"issue":"1","key":"5_CR11","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1016\/j.comgeo.2004.03.010","volume":"29","author":"J. Iacono","year":"2004","unstructured":"Iacono, J.: Expected asymptotically optimal planar point location. Computational Geometry\u00a029(1), 19\u201322 (2004)","journal-title":"Computational Geometry"},{"issue":"4","key":"5_CR12","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1142\/S0218195912600084","volume":"22","author":"J. Iacono","year":"2012","unstructured":"Iacono, J., Mulzer, W.: A static optimality transformation with applications to planar point location. Int. J. of Comput. Geom. and Appl.\u00a022(4), 327\u2013340 (2012)","journal-title":"Int. J. of Comput. Geom. and Appl."},{"issue":"1","key":"5_CR13","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1137\/0212002","volume":"12","author":"D. Kirkpatrick","year":"1983","unstructured":"Kirkpatrick, D.: Optimal search in planar subdivisions. SIAM J. Comput.\u00a012(1), 28\u201335 (1983)","journal-title":"SIAM J. Comput."},{"key":"5_CR14","unstructured":"Knuth, D.E.: Sorting and Searching, 2nd edn. The Art of Computer Programming, vol.\u00a03. Addison-Wesley (1998)"},{"issue":"3","key":"5_CR15","doi-asserted-by":"publisher","first-page":"548","DOI":"10.1006\/jagm.1995.1021","volume":"18","author":"J. Ruppert","year":"1995","unstructured":"Ruppert, J.: A Delaunay refinement algorithm for quality 2-dimensional mesh generation. J. Algorithms\u00a018(3), 548\u2013585 (1995)","journal-title":"J. Algorithms"},{"key":"5_CR16","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1002\/j.1538-7305.1948.tb01338.x","volume":"27","author":"C.E. Shannon","year":"1948","unstructured":"Shannon, C.E.: A mathematical theory of communication. Bell Sys. Tech. Journal\u00a027, 379\u2013423, 623\u2013656 (1948)","journal-title":"Bell Sys. Tech. Journal"},{"key":"5_CR17","doi-asserted-by":"crossref","unstructured":"Snoeyink, J.: Point location. In: Goodman, J.E., O\u2019Rourke, J. (eds.) Handbook of Discrete and Computational Geometry, 2nd edn., ch.\u00a034. Chapman & Hall\/CRC (2004)","DOI":"10.1201\/9781420035315.pt4"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-40104-6_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,15]],"date-time":"2019-05-15T18:42:20Z","timestamp":1557945740000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-40104-6_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642401039","9783642401046"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-40104-6_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}