{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T16:24:31Z","timestamp":1725553471575},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540340706"},{"type":"electronic","value":"9783540340713"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11751540_3","type":"book-chapter","created":{"date-parts":[[2006,5,10]],"date-time":"2006-05-10T12:28:51Z","timestamp":1147264131000},"page":"20-29","source":"Crossref","is-referenced-by-count":2,"title":["Visibility Maps of Segments and Triangles in 3D"],"prefix":"10.1007","author":[{"given":"Esther","family":"Moet","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christian","family":"Knauer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marc","family":"van Kreveld","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"3_CR1","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1145\/27625.27627","volume":"6","author":"M. McKenna","year":"1987","unstructured":"McKenna, M.: Worst-case optimal hidden-surface removal. ACM Trans. Graph.\u00a06, 19\u201328 (1987)","journal-title":"ACM Trans. Graph."},{"key":"3_CR2","unstructured":"O\u2019Rourke, J.: Visibility. In: Goodman, J.E., O\u2019Rourke, J. (eds.) Handbook of disc. and comput. geom., vol.\u00a028. CRC Press, Inc., Boca Raton (2004)"},{"key":"3_CR3","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1016\/S0304-3975(98)00132-7","volume":"234","author":"C. Wang","year":"2000","unstructured":"Wang, C., Zhu, B.: Three-dimensional weak visibility: Complexity and applications. Theor. Comput. Sci.\u00a0234, 219\u2013232 (2000)","journal-title":"Theor. Comput. Sci."},{"key":"3_CR4","unstructured":"Bern, M., Dobkin, D., Eppstein, D., Grossman, R.: Visibility with a moving point of view. In: Proc. 1st ACM-SIAM Sympos. Discrete Algorithms, pp. 107\u2013117 (1990)"},{"issue":"2","key":"3_CR5","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1007\/BF00054919","volume":"5","author":"H. Plantinga","year":"1990","unstructured":"Plantinga, H., Dyer, C.R.: Visibility, occlusion, and the aspect graph. Int. J. Comput. Vision\u00a05(2), 137\u2013160 (1990)","journal-title":"Int. J. Comput. Vision"},{"issue":"6","key":"3_CR6","doi-asserted-by":"publisher","first-page":"542","DOI":"10.1109\/34.87341","volume":"13","author":"Z. Gigus","year":"1991","unstructured":"Gigus, Z., Canny, J., Seidel, R.: Efficiently computing and representing aspect graphs of polyhedral objects. IEEE Trans. Pattern Anal. Mach. Intell.\u00a013(6), 542\u2013551 (1991)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"3_CR7","unstructured":"Coll, N., Fort, M., Sellar\u00e8s, J.: Approximate multi-visibility map computation. In: Abstr. Europ. Workshop Comput. Geom., pp. 97\u2013100 (2005)"},{"key":"3_CR8","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1007\/BF00337644","volume":"32","author":"J.J. Koenderink","year":"1979","unstructured":"Koenderink, J.J., van Doorn, A.J.: The internal representation of solid shape with respect to vision. Biological Cybernetics\u00a032, 211\u2013216 (1979)","journal-title":"Biological Cybernetics"},{"key":"3_CR9","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1142\/S0218195997000120","volume":"7","author":"M. Berg de","year":"1997","unstructured":"de Berg, M., Halperin, D., Overmars, M., van Kreveld, M.: Sparse arrangements and the number of views of polyhedral scenes. Internat. J. Comput. Geom. Appl.\u00a07, 175\u2013195 (1997)","journal-title":"Internat. J. Comput. Geom. Appl."},{"key":"3_CR10","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/BF02574373","volume":"12","author":"P.K. Agarwal","year":"1994","unstructured":"Agarwal, P.K., Sharir, M.: On the number of views of polyhedral terrains. Discrete Comput. Geom.\u00a012, 177\u2013182 (1994)","journal-title":"Discrete Comput. Geom."},{"issue":"1","key":"3_CR11","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1145\/77635.77639","volume":"9","author":"H. Edelsbrunner","year":"1990","unstructured":"Edelsbrunner, H., M\u00fccke, E.P.: Simulation of simplicity: A technique to cope with degenerate cases in geometric algorithms. ACM Trans. Graph.\u00a09(1), 66\u2013104 (1990)","journal-title":"ACM Trans. Graph."},{"key":"3_CR12","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-04018-4","volume-title":"Computational Line Geometry","author":"H. Pottmann","year":"2001","unstructured":"Pottmann, H., Wallner, J.: Computational Line Geometry. Springer, Heidelberg (2001)"},{"key":"3_CR13","unstructured":"Br\u00f6nnimann, H., Everett, H., Lazard, S., Sottile, F., Whitesides, S.: Transversals to line segments in \u211d3. In: Proc. 15th Canad. Conf. Comput. Geom., pp. 174\u2013177 (2003)"},{"key":"3_CR14","doi-asserted-by":"crossref","unstructured":"Heintz, J., Reico, T., Roy, M.F.: Algorithms in real algebraic geometry and applications to computational geometry. In: Goodman, J.E., Pollack, R., Steiger, W. (eds.) Discrete Comput. Geom., pp. 137\u2013163 (1991)","DOI":"10.1090\/dimacs\/006\/08"},{"key":"3_CR15","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/BF02574371","volume":"12","author":"B. Aronov","year":"1994","unstructured":"Aronov, B., Sharir, M.: Castles in the air revisited. Discrete Comput. Geom.\u00a012, 119\u2013150 (1994)","journal-title":"Discrete Comput. Geom."},{"key":"3_CR16","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1007\/BF02712877","volume":"16","author":"B. Tagansky","year":"1996","unstructured":"Tagansky, B.: A new technique for analyzing substructures in arrangements of piecewise linear surfaces. Discrete Comput. Geom.\u00a016, 455\u2013479 (1996)","journal-title":"Discrete Comput. Geom."},{"key":"3_CR17","doi-asserted-by":"crossref","unstructured":"Moet, E., Knauer, C., van Kreveld, M.: Visibility maps of segments and triangles in 3D. Technical Report UU-CS-2005-049 (Universiteit Utrecht)","DOI":"10.1007\/11751540_3"},{"key":"3_CR18","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/BF02570705","volume":"14","author":"M. Berg de","year":"1995","unstructured":"de Berg, M., Dobrindt, K., Schwarzkopf, O.: On lazy randomized incremental construction. Discrete Comput. Geom.\u00a014, 261\u2013286 (1995)","journal-title":"Discrete Comput. Geom."},{"key":"3_CR19","doi-asserted-by":"crossref","unstructured":"Suri, S., O\u2019Rourke, J.: Worst-case optimal algorithms for constructing visibility polygons with holes. In: Proc. 2nd Annu. ACM Sympos. Comput. Geom., pp. 14\u201323 (1986)","DOI":"10.1145\/10515.10517"},{"key":"3_CR20","volume-title":"Computational Geometry: An Introduction Through Randomized Algorithms","author":"K. Mulmuley","year":"1993","unstructured":"Mulmuley, K.: Computational Geometry: An Introduction Through Randomized Algorithms. Prentice Hall, Englewood Cliffs (1993)"}],"container-title":["Lecture Notes in Computer Science","Computational Science and Its Applications - ICCSA 2006"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11751540_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,7]],"date-time":"2023-05-07T11:17:50Z","timestamp":1683458270000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11751540_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540340706","9783540340713"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/11751540_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}