On the classification of views of piecewise smooth objects
Image and Vision Computing - Special issue: papers from the second Alvey Vision Conference
Image understanding 1985-86
Computing the Aspect Graph for Line Drawings of Polyhedral Objects
IEEE Transactions on Pattern Analysis and Machine Intelligence
The geometry of view space of opaque objects bounded by smooth surfaces
Artificial Intelligence
Hidden surface removal with respect to a moving view point
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Visibility, occlusion, and the aspect graph
International Journal of Computer Vision
Oriented projective geometry
Computing the antipenumbra of an area light source
SIGGRAPH '92 Proceedings of the 19th annual conference on Computer graphics and interactive techniques
Global bifurcation sets and stable projections of nonsingular algebraic surfaces
International Journal of Computer Vision
Computing exact aspect graphs of curved objects: algebraic surfaces
International Journal of Computer Vision
SCG '93 Proceedings of the ninth annual symposium on Computational geometry
Visibility computations in densely occluded polyhedral environments
Visibility computations in densely occluded polyhedral environments
Computing view graphs of algebraic surfaces
Journal of Symbolic Computation
A fast shadow algorithm for area light sources using backprojection
SIGGRAPH '94 Proceedings of the 21st annual conference on Computer graphics and interactive techniques
The visibility complex made visibly simple: an introduction to 2D structures of visibility
Proceedings of the eleventh annual symposium on Computational geometry
The enumerative geometry of projective algebraic surfaces and the complexity of aspect graphs
International Journal of Computer Vision
SIGGRAPH '96 Proceedings of the 23rd annual conference on Computer graphics and interactive techniques
SIGGRAPH '96 Proceedings of the 23rd annual conference on Computer graphics and interactive techniques
Temporally coherent conservative visibility (extended abstract)
Proceedings of the twelfth annual symposium on Computational geometry
Proceedings of the twelfth annual symposium on Computational geometry
Casting light on illumination: a computational model and dimensional analysis of sources
Computer Vision and Image Understanding - Special issue on physics-based modeling and reasoning in computer vision
Real-time occlusion culling for models with large occluders
Proceedings of the 1997 symposium on Interactive 3D graphics
The visibility skeleton: a powerful and efficient multi-purpose global visibility tool
Proceedings of the 24th annual conference on Computer graphics and interactive techniques
Realistic input models for geometric algorithms
SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
Dynamic visibility in polygonal scenes with the visibility complex
SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
The 3D visibility complex: a new approach to the problems of accurate visibility
Proceedings of the eurographics workshop on Rendering techniques '96
Multiple-center-of-projection images
Proceedings of the 25th annual conference on Computer graphics and interactive techniques
Algorithmic geometry
Fast and accurate hierarchical radiosity using global visibility
ACM Transactions on Graphics (TOG)
Radiosity and Global Illumination
Radiosity and Global Illumination
The Visual Hull Concept for Silhouette-Based Image Understanding
IEEE Transactions on Pattern Analysis and Machine Intelligence
Visibility-Based Pursuit-Evasion in a Polygonal Environment
WADS '97 Proceedings of the 5th International Workshop on Algorithms and Data Structures
Hauptvortrag: Quantifier elimination for real closed fields by cylindrical algebraic decomposition
Proceedings of the 2nd GI Conference on Automata Theory and Formal Languages
Almost Tight Upper Bounds for Vertical Decompositions in Four Dimensions
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
On lines avoiding unit balls in three dimensions
SCG '04 Proceedings of the twentieth annual symposium on Computational geometry
The number of lines tangent to arbitrary convex polyhedra in 3D
SCG '04 Proceedings of the twentieth annual symposium on Computational geometry
The Visual Hull of Smooth Curved Objects
IEEE Transactions on Pattern Analysis and Machine Intelligence
The Local Projective Shape of Smooth Surfaces and Their Outlines
International Journal of Computer Vision
A first-order analysis of lighting, shading, and shadows
ACM Transactions on Graphics (TOG)
SCG '07 Proceedings of the twenty-third annual symposium on Computational geometry
Visibility-based feature extraction from discrete models
Proceedings of the 2008 ACM symposium on Solid and physical modeling
On the Size of the 3D Visibility Skeleton: Experimental Results
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
On the degree of standard geometric predicates for line transversals in 3D
Computational Geometry: Theory and Applications
On the complexity of umbra and penumbra
Computational Geometry: Theory and Applications
ACM SIGGRAPH Asia 2009 papers
On the complexity of sets of free lines and line segments among balls in three dimensions
Proceedings of the twenty-sixth annual symposium on Computational geometry
Lazy Visibility Evaluation for Exact Soft Shadows
Computer Graphics Forum
Technical Section: Analytic ambient occlusion using exact from-polygon visibility
Computers and Graphics
Combining higher-order wavelets and discontinuity meshing: a compact representation for radiosity
EGSR'04 Proceedings of the Fifteenth Eurographics conference on Rendering Techniques
| Hi-index | 0.00 |
Visibility problems are central to many computer graphics applications. The most common examples include hidden-part removal for view computation, shadow boundaries, mutual visibility of objects for lighting simulation. In this paper, we present a theoretical study of 3D visibility properties for scenes of smooth convex objects. We work in the space of light rays, or more precisely, of maximal free segments. We group segments that "see" the same object; this defines the 3D visibility complex. The boundaries of these groups of segments correspond to the visual events of the scene (limits of shadows, disappearance of an object when the viewpoint is moved, etc.). We provide a worst case analysis of the complexity of the visibility complex of 3D scenes, as well as a probabilistic study under a simple assumption for "normal" scenes. We extend the visibility complex to handle temporal visibility. We give an output-sensitive construction algorithm and present applications of our approach.