A Survey of Aspect Graphs

ACKNOWLEDGMENT Special thanks to my advisor, Professor Boris Aronov of Polytechnic University, for providing copious amounts of valuable and much needed guidance while a rather lengthy sequence of revisions gradually converged to this final document.

[1]  Kevin W. Bowyer,et al.  Computing the Generalized Aspect Graph for Objects with Moving Parts , 1993, IEEE Trans. Pattern Anal. Mach. Intell..

[2]  Frédo Durand,et al.  The 3D Visibility Complex: A New Approach to the Problems of Accurate Visibility , 1996, Rendering Techniques.

[3]  Jezekiel Ben Arie.  Probabilistic models of observed features and aspects with application to weighted aspect graphs , 1990 .

[4]  Mark de Berg,et al.  Sparse Arrangements and the Number of Views of Polyhedral Scenes , 1997, Int. J. Comput. Geom. Appl..

[5]  Boris Aronov,et al.  On the Number of Views of Polyhedral Scenes , 2000, JCDCG.

[6]  Micha Sharir,et al.  Davenport-Schinzel sequences and their geometric applications , 1995, Handbook of Computational Geometry.

[7]  Jezekiel Ben-Arie.  Probabilistic models of observed features and aspects with application to weighted aspect graphs , 1990, Pattern Recognit. Lett..

[8]  Micha Sharir,et al.  The Common Exterior of Convex Polygons in the Plane , 1997, Comput. Geom..

[9]  Raimund Seidel,et al.  Efficiently Computing and Representing Aspect Graphs of Polyhedral Objects , 1991, IEEE Trans. Pattern Anal. Mach. Intell..

[10]  Richard Cole,et al.  Visibility Problems for Polyhedral Terrains , 2018, J. Symb. Comput..

[11]  Michael Werman,et al.  The visual potential: One convex polygon , 1989, Comput. Vis. Graph. Image Process..

[12]  Kevin W. Bowyer,et al.  Direct construction of the perspective projection aspect graph of convex polyhedra , 1990, Comput. Vis. Graph. Image Process..

[13]  Michel Pocchiola,et al.  The visibility complex , 1993, SCG '93.

[14]  Frédo Durand,et al.  The visibility skeleton: a powerful and efficient multi-purpose global visibility tool , 1997, SIGGRAPH.

[15]  Micha Sharir,et al.  New bounds for lower envelopes in three dimensions, with applications to visibility in terrains , 1993, SCG '93.

[16]  Leonidas J. Guibas,et al.  On incremental rendering of silhouette maps of polyhedral scene , 2000, SODA '00.

[17]  Robert L. Grossman,et al.  Visibility with a moving point of view , 1994, SODA '90.

[18]  Jitendra Malik,et al.  Computing the aspect graph for line drawings of polyhedral objects , 1988, Proceedings. 1988 IEEE International Conference on Robotics and Automation.

[19]  Ketan Mulmuley.  A Fast Planar Partition Algorithm, I , 1990, J. Symb. Comput..

[20]  Micha Sharir,et al.  On the number of views of polyhedral terrains , 1993, CCCG.

[21]  Dmitry B. Goldgof,et al.  The Scale Space Aspect Graph , 1992, IEEE Trans. Pattern Anal. Mach. Intell..

[22]  Herbert Edelsbrunner,et al.  Algorithms in Combinatorial Geometry , 1987, EATCS Monographs in Theoretical Computer Science.

[23]  GigusZiv,et al.  Efficiently Computing and Representing Aspect Graphs of Polyhedral Objects , 1991 .

[24]  Daniel Cohen-Or,et al.  Conservative Visibility and Strong Occlusion for Viewspace Partitioning of Densely Occluded Scenes , 1998, Comput. Graph. Forum.

[25]  Jean Ponce,et al.  Finite-Resolution Aspect Graphs of Polyhedral Objects , 1997, IEEE Trans. Pattern Anal. Mach. Intell..