Abstract
Let T be a set of n disjoint triangles in three-dimensional space, let s be a line segment, and let t be a triangle, both disjoint from T. We consider the visibility map of s with respect to T, i.e., the portions of T that are visible from s. The visibility map of t is defined analogously. We look at two different notions of visibility: strong (complete) visibility, and weak (partial) visibility. The trivial Ω(n 2) lower bound for the combinatorial complexity of the strong visibility map of both s and t is almost tight: we prove an O(n 2 log n) upper bound for both structures. Furthermore, we prove that the weak visibility map of s has complexity Θ(n 5), and the weak visibility map of t has complexity Θ(n 7). If T is a polyhedral terrain, the complexity of the weak visibility map is Ω(n 4) and O(n 5), both for a segment and a triangle. We also present efficient algorithms to compute all discussed structures.
This research was initiated during a visit of the first author to Freie Universität Berlin, which was supported by a Marie-Curie scholarship.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
McKenna, M.: Worst-case optimal hidden-surface removal. ACM Trans. Graph. 6, 19–28 (1987)
O’Rourke, J.: Visibility. In: Goodman, J.E., O’Rourke, J. (eds.) Handbook of disc. and comput. geom., vol. 28. CRC Press, Inc., Boca Raton (2004)
Wang, C., Zhu, B.: Three-dimensional weak visibility: Complexity and applications. Theor. Comput. Sci. 234, 219–232 (2000)
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–117 (1990)
Plantinga, H., Dyer, C.R.: Visibility, occlusion, and the aspect graph. Int. J. Comput. Vision 5(2), 137–160 (1990)
Gigus, Z., Canny, J., Seidel, R.: Efficiently computing and representing aspect graphs of polyhedral objects. IEEE Trans. Pattern Anal. Mach. Intell. 13(6), 542–551 (1991)
Coll, N., Fort, M., Sellarès, J.: Approximate multi-visibility map computation. In: Abstr. Europ. Workshop Comput. Geom., pp. 97–100 (2005)
Koenderink, J.J., van Doorn, A.J.: The internal representation of solid shape with respect to vision. Biological Cybernetics 32, 211–216 (1979)
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. 7, 175–195 (1997)
Agarwal, P.K., Sharir, M.: On the number of views of polyhedral terrains. Discrete Comput. Geom. 12, 177–182 (1994)
Edelsbrunner, H., Mücke, E.P.: Simulation of simplicity: A technique to cope with degenerate cases in geometric algorithms. ACM Trans. Graph. 9(1), 66–104 (1990)
Pottmann, H., Wallner, J.: Computational Line Geometry. Springer, Heidelberg (2001)
Brönnimann, H., Everett, H., Lazard, S., Sottile, F., Whitesides, S.: Transversals to line segments in ℝ3. In: Proc. 15th Canad. Conf. Comput. Geom., pp. 174–177 (2003)
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–163 (1991)
Aronov, B., Sharir, M.: Castles in the air revisited. Discrete Comput. Geom. 12, 119–150 (1994)
Tagansky, B.: A new technique for analyzing substructures in arrangements of piecewise linear surfaces. Discrete Comput. Geom. 16, 455–479 (1996)
Moet, E., Knauer, C., van Kreveld, M.: Visibility maps of segments and triangles in 3D. Technical Report UU-CS-2005-049 (Universiteit Utrecht)
de Berg, M., Dobrindt, K., Schwarzkopf, O.: On lazy randomized incremental construction. Discrete Comput. Geom. 14, 261–286 (1995)
Suri, S., O’Rourke, J.: Worst-case optimal algorithms for constructing visibility polygons with holes. In: Proc. 2nd Annu. ACM Sympos. Comput. Geom., pp. 14–23 (1986)
Mulmuley, K.: Computational Geometry: An Introduction Through Randomized Algorithms. Prentice Hall, Englewood Cliffs (1993)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Moet, E., Knauer, C., van Kreveld, M. (2006). Visibility Maps of Segments and Triangles in 3D. In: Gavrilova, M., et al. Computational Science and Its Applications - ICCSA 2006. ICCSA 2006. Lecture Notes in Computer Science, vol 3980. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11751540_3
Download citation
DOI: https://doi.org/10.1007/11751540_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-34070-6
Online ISBN: 978-3-540-34071-3
eBook Packages: Computer ScienceComputer Science (R0)