{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,7]],"date-time":"2025-04-07T02:10:02Z","timestamp":1743991802857,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642331909"},{"type":"electronic","value":"9783642331916"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-33191-6_73","type":"book-chapter","created":{"date-parts":[[2012,8,21]],"date-time":"2012-08-21T19:47:07Z","timestamp":1345578427000},"page":"736-745","source":"Crossref","is-referenced-by-count":0,"title":["A New Visibility Walk Algorithm for Point Location in Planar Triangulation"],"prefix":"10.1007","author":[{"given":"Roman","family":"Soukal","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Martina","family":"Malkov\u00e1","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ivana","family":"Kolingerov\u00e1","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"73_CR1","doi-asserted-by":"crossref","unstructured":"Sundareswara, R., Schrater, P.: Extensible point location algorithm. In: International Conference on Geometric Modeling and Graphics, pp. 84\u201389 (2003)","DOI":"10.1109\/GMAG.2003.1219670"},{"key":"73_CR2","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1016\/j.procs.2010.04.025","volume":"1","author":"R. Soukal","year":"2010","unstructured":"Soukal, R., Kolingerov\u00e1, I.: Star-shaped polyhedron point location with orthogonal walk algorithm. Procedia Computer Science\u00a01, 219\u2013228 (2010)","journal-title":"Procedia Computer Science"},{"key":"73_CR3","unstructured":"Purchart, V., Kolingerov\u00e1, I., Bene\u0161, B.: Interactive sand-covered terrain surface model with haptic feedback. In: GIS Ostrava 2012 - Surface Models for Geosciences (2012)"},{"key":"73_CR4","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1016\/0141-1195(87)90043-X","volume":"9","author":"S.W. Sloan","year":"1987","unstructured":"Sloan, S.W.: A fast algorithm for constructing Delaunay triangulations in the plane. Advanced Engineering Software\u00a09, 34\u201355 (1987)","journal-title":"Advanced Engineering Software"},{"key":"73_CR5","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1016\/j.ipl.2004.09.020","volume":"93","author":"S. Zhou","year":"2005","unstructured":"Zhou, S., Jones, C.B.: HCPO: an efficient insertion order for incremental Delaunay triangulation. Information Processing Letters\u00a093, 37\u201342 (2005)","journal-title":"Information Processing Letters"},{"key":"73_CR6","first-page":"211","volume-title":"SCG 2003: Proceedings of the 19th Annual Symposium on Computational Geometry","author":"N. Amenta","year":"2003","unstructured":"Amenta, N., Choi, S., Rote, G.: Incremental constructions con brio. In: SCG 2003: Proceedings of the 19th Annual Symposium on Computational Geometry, pp. 211\u2013219. ACM, New York (2003)"},{"key":"73_CR7","unstructured":"Buchin, K.: Incremental construction along space-filling curves. In: EuroCG 2005: Proceedings of the 21th European Workshop on Computational Geometry, pp. 17\u201320 (2005)"},{"key":"73_CR8","doi-asserted-by":"crossref","unstructured":"M\u00fccke, E.P., Saias, I., Zhu, B.: Fast randomized point location without preprocessing in two and three-dimensional Delaunay triangulations. In: Proceedings of the 12th Annual Symposium on Computational Geometry, vol.\u00a026, pp. 274\u2013283 (1996)","DOI":"10.1145\/237218.237396"},{"key":"73_CR9","doi-asserted-by":"crossref","unstructured":"Devroye, L., Mucke, E.P., Zhu, B.: A note on point location in Delaunay triangulations of random points (1998)","DOI":"10.1007\/PL00009234"},{"key":"73_CR10","doi-asserted-by":"crossref","unstructured":"Mulmuley, K.: Randomized multidimensional search trees: Dynamic sampling. In: Proceedings of the 7th Annual Symposium on Computational Geometry, pp. 121\u2013131 (1991)","DOI":"10.1145\/109648.109662"},{"key":"73_CR11","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1142\/S0129054102001035","volume":"13","author":"O. Devillers","year":"2002","unstructured":"Devillers, O.: The Delaunay hierarchy. International Journal of Foundations of Computer Science\u00a013, 163\u2013180 (2002)","journal-title":"International Journal of Foundations of Computer Science"},{"key":"73_CR12","doi-asserted-by":"crossref","unstructured":"Su, P., Drysdale, R.L.S.: A comparison of sequential Delaunay triangulation algorithms. In: Proceedings of the 11th Annual Symposium on Computational Geometry, pp. 61\u201370 (1995)","DOI":"10.1145\/220279.220286"},{"key":"73_CR13","doi-asserted-by":"publisher","first-page":"384","DOI":"10.1007\/s00371-005-0293-3","volume":"21","author":"M. Zadravec","year":"2005","unstructured":"Zadravec, M., \u017dalik, B.: An almost distribution independent incremental Delaunay triangulation algorithm. The Visual Computer\u00a021, 384\u2013396 (2005)","journal-title":"The Visual Computer"},{"key":"73_CR14","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1080\/713811749","volume":"17","author":"B. \u017dalik","year":"2003","unstructured":"\u017dalik, B., Kolingerov\u00e1, I.: An incremental construction algorithm for Delaunay triangulation using the nearest-point paradigm. International Journal of Geographical Information Science\u00a017, 119\u2013138 (2003)","journal-title":"International Journal of Geographical Information Science"},{"key":"73_CR15","first-page":"161","volume-title":"Mathematical Software III; Software for C1 Surface Interpolation","author":"C.L. Lawson","year":"1977","unstructured":"Lawson, C.L.: In: Mathematical Software III; Software for C1 Surface Interpolation, pp. 161\u2013194. Academic Press, New York (1977)"},{"key":"73_CR16","doi-asserted-by":"crossref","unstructured":"Devillers, O., Pion, S., Teillaud, M.: Walking in a triangulation. In: Proceedings of the 17th Annual Symposium on Computational Geometry, pp. 106\u2013114 (2001)","DOI":"10.1145\/378583.378643"},{"key":"73_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1007\/978-3-540-45077-1_21","volume-title":"Fundamentals of Computation Theory","author":"B. Zhu","year":"2003","unstructured":"Zhu, B.: On Lawson\u2019s Oriented Walk in Random Delaunay Triangulations. In: Lingas, A., Nilsson, B.J. (eds.) FCT 2003. LNCS, vol.\u00a02751, pp. 222\u2013233. Springer, Heidelberg (2003)"},{"key":"73_CR18","unstructured":"Weller, F.: On the total correctness of Lawson\u2019s oriented walk. In: Proceedings of the 10th International Canadian Conference on Computational Geometry, pp. 10\u201312 (1998)"},{"key":"73_CR19","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1145\/204865.204889","volume":"38","author":"K. Mehlhorn","year":"1995","unstructured":"Mehlhorn, K., N\u00e4her, S.: Leda: A platform for combinatorial and geometric computing. Communications of the ACM\u00a038, 96\u2013102 (1995)","journal-title":"Communications of the ACM"},{"key":"73_CR20","unstructured":"Soukal, R., Kolingerov\u00e1, I.: Straight walk algorithm modification for point location in a triangulation. In: EuroCG 2009: Proceedings of the 25th European Workshop on Computational Geometry, Brussels, Belgium, pp. 219\u2013222 (2009)"},{"key":"73_CR21","unstructured":"Owens, K., Parikh, R.: Fast random number generator on the intel pentium 4 processor. Intel Software Network (2009)"}],"container-title":["Lecture Notes in Computer Science","Advances in Visual Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-33191-6_73.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,7]],"date-time":"2025-04-07T01:35:15Z","timestamp":1743989715000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-33191-6_73"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642331909","9783642331916"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-33191-6_73","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}