{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T12:14:28Z","timestamp":1763468068037},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540572732"},{"type":"electronic","value":"9783540480327"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1993]]},"DOI":"10.1007\/3-540-57273-2_49","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T12:36:30Z","timestamp":1330259790000},"page":"121-132","source":"Crossref","is-referenced-by-count":6,"title":["Trekking in the Alps without freezing or getting tired"],"prefix":"10.1007","author":[{"given":"Mark","family":"Berg","sequence":"first","affiliation":[]},{"given":"Marc","family":"Kreveld","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"11_CR1","unstructured":"Bern, M., D. Dobkin, D. Eppstein, and R. Grossman, Visibility with a Moving Point of View, Proc. 1st ACM-SIAM Symp. on Discrete Algorithms (1990), pp. 107\u2013117."},{"key":"11_CR2","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1007\/BF01840366","volume":"3","author":"B. Chazelle","year":"1987","unstructured":"Chazelle, B., Computing on a Free Tree via Complexity-Perserving Mappings, Algorithmica\n3 (1987), pp. 337\u2013361.","journal-title":"Algorithmica"},{"key":"11_CR3","doi-asserted-by":"crossref","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 Comput. Geom.\n6 (1991), pp. 485\u2013524.","journal-title":"Discrete Comput. Geom."},{"key":"11_CR4","doi-asserted-by":"crossref","unstructured":"Chazelle, B., H. Edelsbrunner, L. J. Guibas, and M. Sharir, Lines in Space: Combinatorics, Algorithms and Applications, Proc. 21nd ACM Symp. on the Theory of Computing (1989), pp. 382\u2013393.","DOI":"10.1145\/73007.73044"},{"key":"11_CR5","doi-asserted-by":"crossref","unstructured":"Chen, J., and Y. Han, Shortest Paths on a Polyhedron, Proc. 6th ACM Symp. on Comp. Geometry (1990), pp. 360\u2013369.","DOI":"10.1145\/98524.98601"},{"key":"11_CR6","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1016\/S0747-7171(89)80003-3","volume":"7","author":"R. Cole","year":"1989","unstructured":"Cole, R., and M. Sharir, Visibility Problems for Polyhedral Terrains, J. Symb. Computation\n7 (1989), pp. 11\u201330.","journal-title":"J. Symb. Computation"},{"key":"11_CR7","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1137\/0215023","volume":"15","author":"H. Edelsbrunner","year":"1986","unstructured":"Edelsbrunner, H., L. J. Guibas, and J. Stolfi, Optimal Point Location in a Monotone Subdivision, SIAM J. Computing\n15 (1986), pp. 317\u2013340.","journal-title":"SIAM J. Computing"},{"key":"11_CR8","doi-asserted-by":"crossref","first-page":"338","DOI":"10.1137\/0213024","volume":"13","author":"D. Harel","year":"1984","unstructured":"Harel, D., and R. E. Tarjan, Fast Algorithms for Finding Nearest Common Ancestors, SIAM J. Computing\n13 (1984), pp. 338\u2013355.","journal-title":"SIAM J. Computing"},{"key":"11_CR9","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1016\/0925-7721(92)90024-M","volume":"2","author":"M.J. Katz","year":"1992","unstructured":"Katz, M.J., M.H. Overmars and M. Sharir, Efficient Hidden Surface Removal for Objects with Small Union Size, Computational Geometry: Theory and Applications\n2 (1992), pp. 223\u2013234.","journal-title":"Computational Geometry: Theory and Applications"},{"key":"11_CR10","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1137\/0212002","volume":"12","author":"D. G. Kirkpatrick","year":"1983","unstructured":"Kirkpatrick, D. G., Optimal Search in Planar Subdivisions, SIAM J. Computing\n12 (1983), pp. 28\u201335.","journal-title":"SIAM J. Computing"},{"key":"11_CR11","doi-asserted-by":"crossref","unstructured":"Reif, J., and S. Sen, An Efficient Output-Sensitive Hidden Surface Removal Algorithm and its Parallelization, Proc. 4th ACM Symp. on Comp. Geometry, 1988, pp. 193\u2013200.","DOI":"10.1145\/73393.73413"},{"key":"11_CR12","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1137\/0215014","volume":"15","author":"M. Sharir","year":"1986","unstructured":"Sharir, M., and A. Schorr, On Shortest Paths in Polyhedral Spaces, SIAM J. Comput.\n15 (1986), pp. 193\u2013215.","journal-title":"SIAM J. Comput."}],"container-title":["Lecture Notes in Computer Science","Algorithms\u2014ESA '93"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-57273-2_49.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T01:02:25Z","timestamp":1619571745000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-57273-2_49"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993]]},"ISBN":["9783540572732","9783540480327"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-57273-2_49","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1993]]}}}