{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:43:18Z","timestamp":1725489798418},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540739487"},{"type":"electronic","value":"9783540739517"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/978-3-540-73951-7_23","type":"book-chapter","created":{"date-parts":[[2007,8,20]],"date-time":"2007-08-20T06:18:03Z","timestamp":1187590683000},"page":"251-262","source":"Crossref","is-referenced-by-count":1,"title":["Computing the Visibility Map of Fat Objects"],"prefix":"10.1007","author":[{"given":"Mark","family":"de Berg","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chris","family":"Gray","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"4","key":"23_CR1","doi-asserted-by":"publisher","first-page":"794","DOI":"10.1137\/0222051","volume":"22","author":"P.K. Agarwal","year":"1993","unstructured":"Agarwal, P.K., Matou\u0161ek, J.: Ray shooting and parametric search. SIAM Journal on Computing\u00a022(4), 794\u2013806 (1993)","journal-title":"SIAM Journal on Computing"},{"key":"23_CR2","doi-asserted-by":"publisher","first-page":"643","DOI":"10.1109\/TC.1979.1675432","volume":"28","author":"J. Bentley","year":"1979","unstructured":"Bentley, J., Ottmann, T.: Algorithms for reporting and counting geometric intersections. IEEE Transactions on Computers\u00a028, 643\u2013647 (1979)","journal-title":"IEEE Transactions on Computers"},{"key":"23_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/BFb0029813","volume-title":"Ray Shooting, Depth Orders and Hidden Surface Removal","author":"M. Berg de","year":"1993","unstructured":"de Berg, M.: Ray Shooting, Depth Orders and Hidden Surface Removal. LNCS, vol.\u00a0703. Springer, Heidelberg (1993)"},{"key":"23_CR4","doi-asserted-by":"crossref","unstructured":"de Berg, M.: Vertical ray shooting for fat objects. In: Proc. 21st Annual Symposium on Computational Geometry, pp. 288\u2013295 (2005)","DOI":"10.1145\/1064092.1064137"},{"key":"23_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1007\/11590156_9","volume-title":"FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science","author":"M. Berg de","year":"2005","unstructured":"de Berg, M.: Improved bounds for the union complexity of fat objects. In: Ramanujam, R., Sen, S. (eds.) FSTTCS 2005. LNCS, vol.\u00a03821, pp. 116\u2013127. Springer, Heidelberg (2005)"},{"key":"23_CR6","doi-asserted-by":"crossref","unstructured":"de Berg, M., Gray, C.: Vertical ray shooting and computing depth orders for fat objects. In: Proc. 17th Annual Symposium on Discrete Algorithms, pp. 494\u2013503 (2006)","DOI":"10.1145\/1109557.1109612"},{"key":"23_CR7","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1016\/0925-7721(92)90007-F","volume":"1","author":"M. Berg de","year":"1992","unstructured":"de Berg, M., Overmars, M.H.: Hidden-surface removal for c-oriented polyhedra. Comput. Geom. Theory Appl.\u00a01, 247\u2013268 (1992)","journal-title":"Comput. Geom. Theory Appl."},{"key":"23_CR8","doi-asserted-by":"crossref","unstructured":"de Berg, M., Streppel, M.: Approximate range searching using binary space partitions. In: Proc. 24th Conference on Foundations of Software Technology and Theoretical Computer Science, pp. 110\u2013121 (2004)","DOI":"10.1007\/978-3-540-30538-5_10"},{"issue":"1","key":"23_CR9","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1007\/s00453-002-0961-x","volume":"34","author":"M. Berg de","year":"2002","unstructured":"de Berg, M., van der Stappen, A.F., Vleugels, J., Katz, M.J.: Realistic input models for geometric algorithms. Algorithmica\u00a034(1), 81\u201397 (2002)","journal-title":"Algorithmica"},{"key":"23_CR10","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1016\/0022-0000(90)90018-G","volume":"40","author":"M. Bern","year":"1990","unstructured":"Bern, M.: Hidden surface removal for rectangles. J. Comp. Syst. Sciences\u00a040, 49\u201369 (1990)","journal-title":"J. Comp. Syst. Sciences"},{"key":"23_CR11","unstructured":"Duncan, C.: Balanced Aspect Ratio Trees. PhD thesis, Johns Hopkins University (1999)"},{"key":"23_CR12","unstructured":"Duncan, C., Goodrich, M., Kobourov, S.: Balanced aspect ratio trees: Combining the advantages of k-d trees and octtrees. In: Proc. 10th Annual ACM-SIAM Sympos. on Discrete Algorithms, pp. 300\u2013309 (1999)"},{"key":"23_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"689","DOI":"10.1007\/BFb0032067","volume-title":"Automata, Languages and Programming","author":"M.T. Goodrich","year":"1990","unstructured":"Goodrich, M.T., Atallah, M.J., Overmars, M.H.: An input-size\/output-size trade-off in the time-complexity of rectilinear hidden surface removal. In: Paterson, M.S. (ed.) Automata, Languages and Programming. LNCS, vol.\u00a0443, pp. 689\u2013702. Springer, Heidelberg (1990)"},{"key":"23_CR14","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1016\/S0734-189X(87)80114-7","volume":"40","author":"R.H. G\u00fcting","year":"1987","unstructured":"G\u00fcting, R.H., Ottmann, T.: New algorithms for special cases of the hidden line elimination problem. Comp. Vision, Graphics and Image Processing\u00a040, 188\u2013204 (1987)","journal-title":"Comp. Vision, Graphics and Image Processing"},{"key":"23_CR15","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., Overmars, M., Sharir, M.: Efficient hidden surface removal for objects with small union size. Computational Geometry: Theory and Applications\u00a02, 223\u2013234 (1992)","journal-title":"Computational Geometry: Theory and Applications"},{"key":"23_CR16","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, 28\u201335 (1983)","journal-title":"SIAM J. Comput."},{"key":"23_CR17","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. Graphics\u00a06, 19\u201328 (1987)","journal-title":"ACM Trans. Graphics"},{"key":"23_CR18","doi-asserted-by":"publisher","first-page":"1745","DOI":"10.1137\/S0097539700382169","volume":"31","author":"J. Pach","year":"2002","unstructured":"Pach, J., Tardos, G.: On the boundary complexity of the union of fat triangles. SIAM J. Comput.\u00a031, 1745\u20131760 (2002)","journal-title":"SIAM J. Comput."},{"key":"23_CR19","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1145\/78964.78967","volume":"9","author":"F.P. Preparata","year":"1990","unstructured":"Preparata, F.P., Vitter, J.S., Yvinec, M.: Computation of the axial view of a set of isothetic parallellipipes. ACM Trans. Graphics\u00a09, 278\u2013300 (1990)","journal-title":"ACM Trans. Graphics"},{"key":"23_CR20","doi-asserted-by":"crossref","unstructured":"Reif, J., Sen, S.: An efficient out-sensitive hidden surface removal algorithm and its parallelization. In: Proc. 4th Annual Symposium on Computational Geometry, pp. 193\u2013200 (1988)","DOI":"10.1145\/73393.73413"},{"key":"23_CR21","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/102377.112141","volume":"11","author":"M. Sharir","year":"1992","unstructured":"Sharir, M., Overmars, M.H.: A simple method for output-sensitive hidden surface removal. ACM Trans. Graphics\u00a011, 1\u201311 (1992)","journal-title":"ACM Trans. Graphics"}],"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-540-73951-7_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,2]],"date-time":"2019-05-02T04:45:25Z","timestamp":1556772325000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-73951-7_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540739487","9783540739517"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-73951-7_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2007]]}}}