Abstract
Consider the following problem: A viewpoint moves amongst a set of line segments in the plane and it is desired to maintain the sequence of lines visible from the viewpoint at every increment in its position. The sequence of visible lines is identical for most increments in the position of the viewpoint. It is different only when the viewpoint crosses a visual discontinuity line. Our objective is to be able to quickly report whether the sequence of visible lines needs to be updated and perform the update quickly in that case. We propose an algorithm that satisfies both criteria while using space linear in the number of visual discontinuity lines. This last condition is important because constructing the arrangement of these lines would take space quadratic in their number.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
J. Arvo and D. B. Kirk. Fast ray tracing by ray classification. In Maureen C. Stone, editor, Computer Graphics (SIGGRAPH’ 87 Proceedings), volume 21, pages 55–64, July 1987.
M. Bern, D. Dobkin, D. Eppstein, and R. Grossman. Visibility with a moving point of view. In Proc. 1st ACM-SIAM Sympos. Discrete Algorithms, pages 107–117, 1990.
B. Chazelle, L. J. Guibas, and D. T. Lee. The power of geometric duality. BIT, 25:76–90, 1985.
S. Coorg and S. Teller. Temporally coherent conservative visibility. In Proc. 12th Annu. ACM Sympos. Comput. Geom., pages 78–87, 1996.
G. Drettakis and E. Fiume. A fast shadow algorithm for area light sources using backprojection. Computer Graphics Proceedings, Annual Conference Series 1994, 28:223–230, August 1994.
H. Fuchs, Z. M. Kedem, and B. Naylor. On visible surface generation by a priori tree structures. Comput. Graph., 14(3): 124–133, 1980.
S. Ghali and A. J. Stewart. Maintenance of the set of segments visible from a moving viewpoint in two dimensions. In Proc. 12th Annu. ACM Sympos. Comput. Geom., pages V3–V4, 1996.
Z. Gigus, J. Canny, and R. Seidel. Efficiently computing and representing aspect graphs of polyhedral objects. IEEE Trans. PAMI, 13(6):542–551, 1991.
Z. Gigus and J. Malik. Computing the aspect graphs for line drawings of polyhedral objects. IEEE Transactions on Pattern Analysis and Machine Intelligence, 12(2): 113–122, February 1990.
E. Groller and W. Purgathofer. Using temporal and spatial coherence for accelerating the calculation of animation sequences. In Werner Purgathofer, editor, Eurographics’ 91, pages 103–113. North-Holland, September 1991.
P. Heckbert. Discontinuity meshing for radiosity. Third Eurographics Workshop on Rendering, pages 203–215, May 1992.
H. Hubschman and S. W. Zucker. Frame-to-frame coherence and the hidden surface computation: Constraints for a convex world. ACM Transactions on Graphics, 1(2):129–162, 1982.
D. Lischinski, F. Tampieri, and D. Greenberg. Discontinuity meshing for accurate radiosity. IEEE Computer Graphics & Applications, pages 25–39, November 1992.
K. Mehlhorn and S. Näher. LEDA: a platform for combinatorial and geometric computing. CACM, 38:96–102, 1995.
K. Mulmuley. Hidden surface removal with respect to a moving point. In Proc. 23rd Annu. ACM Sympos. Theory Comput., pages 512–522, 1991.
M. H. Overmars and J. van Leeuwen. Dynamically maintaining configurations in the plane. In Proc. 12th Annu. ACM Sympos. Theory Comput., pages 135–145,1980.
M. H. Overmars and E. Welzl. New methods for computing visibility graphs. In Proc. 4th Annu. ACM Sympos. Comput. Geom., pages 164–171, 1988.
M.S. Paterson and F. F. Yao. Efficient binary space partitions for hiddensurface removal and solid modeling. Discrete Comput. Geom., 5:485–503, 1990.
H. Plantinga and C. R. Dyer. Visibility, occlusion, and the aspect graph. Internat. J. Comput. Vision, 5(2): 137–160, 1990.
M. Pocchiola. Graphics in Flatland revisited. In Proc. 2nd Scand. Workshop Algorithm Theory, volume 447 of Lecture Notes in Computer Science, pages 85–96. Springer-Verlag, 1990.
M. Pocchiola and G. Vegter. The visibility complex. In Proc. 9th Annu. ACM Sympos. Comput. Geom., pages 328–337, 1993.
F. P. Preparata and M. I. Shamos. Computational Geometry: an Introduction. Springer-Verlag, New York, NY, 1985.
D. M. Y. Sommerville. Analytical Geometry in three dimensions. Cambridge University Press, 1934.
J. Stewart and S. Ghali. Fast computation of shadow boundaries using spatial coherence and backprojections. Computer Graphics Proceedings, Annual Conference Series 1994, 28:231–238, August 1994.
E. Torres. Optimization of the binary space partition algorithm (BSP) for the visualization of dynamic scenes. In C. E. Vandoni and D. A. Duce, editors, Eurographics’ 90, pages 507–518. North-Holland, September 1990.
D. Tost. An algorithm of hidden surface removal based on frame-to-frame coherence. In Werner Purgathofer, editor, Eurographics’ 91, pages 261–273. North-Holland, September 1991.
E. Welzl. Constructing the visibility graph for n line segments in O(n 2) time. Inform. Process. Lett., 20:167–171, 1985.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1996 Springer-Verlag/Wien
About this paper
Cite this paper
Ghali, S., Stewart, A.J. (1996). Incremental Update of the Visibility Map as Seen by a Moving Viewpoint in Two Dimensions. In: Boulic, R., Hégron, G. (eds) Computer Animation and Simulation ’96. Eurographics. Springer, Vienna. https://doi.org/10.1007/978-3-7091-7486-9_1
Download citation
DOI: https://doi.org/10.1007/978-3-7091-7486-9_1
Publisher Name: Springer, Vienna
Print ISBN: 978-3-211-82885-4
Online ISBN: 978-3-7091-7486-9
eBook Packages: Springer Book Archive