Quadratic bounds for hidden line elimination
SCG '86 Proceedings of the second annual symposium on Computational geometry
Worst-case optimal hidden-surface removal
ACM Transactions on Graphics (TOG)
Set operations on polyhedra using binary space partitioning trees
SIGGRAPH '87 Proceedings of the 14th annual conference on Computer graphics and interactive techniques
An introduction to solid modeling
An introduction to solid modeling
The algebraic degree of geometric optimization problems
Discrete & Computational Geometry
Near real-time shadow generation using BSP trees
SIGGRAPH '89 Proceedings of the 16th annual conference on Computer graphics and interactive techniques
An efficient algorithm for hidden surface removal
SIGGRAPH '89 Proceedings of the 16th annual conference on Computer graphics and interactive techniques
Computer graphics: principles and practice (2nd ed.)
Computer graphics: principles and practice (2nd ed.)
Binary space partitioning trees as an alternative representation of polytopes
Computer-Aided Design
Merging BSP trees yields polyhedral set operations
SIGGRAPH '90 Proceedings of the 17th annual conference on Computer graphics and interactive techniques
A simple output-sensitive algorithm for hidden surface removal
ACM Transactions on Graphics (TOG)
Visibility preprocessing for interactive walkthroughs
Proceedings of the 18th annual conference on Computer graphics and interactive techniques
A polygonal approach to hidden-line and hidden-surface elimination
CVGIP: Graphical Models and Image Processing
Partitioning tree image representation and generation from 3D geometric models
Proceedings of the conference on Graphics interface '92
Efficient hidden surface removal for objects with small union size
Computational Geometry: Theory and Applications
Space reduction and an extension for a hidden line elimination algorithm
Computational Geometry: Theory and Applications
Primitives for the manipulation of general subdivisions and the computation of Voronoi
ACM Transactions on Graphics (TOG)
Generic programming and the STL: using and extending the C++ Standard Template Library
Generic programming and the STL: using and extending the C++ Standard Template Library
SCG '99 Proceedings of the fifteenth annual symposium on Computational geometry
SCG '85 Proceedings of the first annual symposium on Computational geometry
A Characterization of Ten Hidden-Surface Algorithms
ACM Computing Surveys (CSUR)
Planar Geometric Projections and Viewing Transformations
ACM Computing Surveys (CSUR)
A Visible Polygon Reconstruction Algorithm
ACM Transactions on Graphics (TOG)
On the design of CGAL a computational geometry algorithms library
Software—Practice & Experience - Special issue on discrete algorithm engineering
Communications of the ACM
An algorithm for hidden line elimination
Communications of the ACM
Modeling acoustics in virtual environments using the uniform theory of diffraction
Proceedings of the 28th annual conference on Computer graphics and interactive techniques
The design and implementation of panar maps in CGAL
Journal of Experimental Algorithmics (JEA)
Hidden surface removal using polygon area sorting
SIGGRAPH '77 Proceedings of the 4th annual conference on Computer graphics and interactive techniques
A solution to the hidden surface problem
ACM '72 Proceedings of the ACM annual conference - Volume 1
IEEE Computer Graphics and Applications
Front-to-Back Display of BSP Trees
IEEE Computer Graphics and Applications
A Complete and Efficient Algorithm for the Intersection of a General and a Convex Polyhedron
WADS '93 Proceedings of the Third Workshop on Algorithms and Data Structures
The notion of quantitative invisibility and the machine rendering of solids
ACM '67 Proceedings of the 1967 22nd national conference
A linear time exact hidden surface algorithm
SIGGRAPH '80 Proceedings of the 7th annual conference on Computer graphics and interactive techniques
On visible surface generation by a priori tree structures
SIGGRAPH '80 Proceedings of the 7th annual conference on Computer graphics and interactive techniques
Beam tracing polygonal objects
SIGGRAPH '84 Proceedings of the 11th annual conference on Computer graphics and interactive techniques
Application of binary space partitioning trees to geometric modeling and ray-tracing
Application of binary space partitioning trees to geometric modeling and ray-tracing
GWB: A Solid Modeler with Euler Operators
IEEE Computer Graphics and Applications
A Solution to the Hidden-Line Problem for Computer-Drawn Polyhedra
IEEE Transactions on Computers
Computing an exact spherical visibility map for meshed polyhedra
Proceedings of the 2007 ACM symposium on Solid and physical modeling
An optimal hidden-surface algorithm and its parallelization
ICCSA'11 Proceedings of the 2011 international conference on Computational science and its applications - Volume Part III
A vision modeling framework for DHM using geometrically estimated FoV
Computer-Aided Design
Scalable visibility color map construction in spatial databases
Information Systems
| Hi-index | 0.00 |
We introduce a novel representation for visibility in three dimensions and describe an efficient algorithm to construct it. The data structure is a spherical map that consists of a doubly-connected edge list embedded on the surface of a sphere. Each face of the spherical map is labeled with the polygon visible in the corresponding cone. We demonstrate that the algorithm is efficient and robust by presenting the statistics of its time and space requirements for handling several classes of input.