Information and Control
Fundamentals of interactive computer graphics
Fundamentals of interactive computer graphics
Power diagrams: properties, algorithms and applications
SIAM Journal on Computing
Algorithms in combinatorial geometry
Algorithms in combinatorial geometry
On visible surface generation by a priori tree structures
SIGGRAPH '80 Proceedings of the 7th annual conference on Computer graphics and interactive techniques
Area and volume coherence for efficient visualization of 3D scalar functions
VVS '90 Proceedings of the 1990 workshop on Volume visualization
Optimality of the Delaunay triangulation in Rd
SCG '91 Proceedings of the seventh annual symposium on Computational geometry
Voronoi diagrams—a survey of a fundamental geometric data structure
ACM Computing Surveys (CSUR)
Volume rendering of 3D scalar and vector fields at LLNL
Proceedings of the 1993 ACM/IEEE conference on Supercomputing
| Hi-index | 0.00 |
Let C be a cell complex in d-dimensional Euclidean space whose faces are obtained by orthogonal projection of the faces of a convex polytope in d + 1 dimensions. For example, the Delaunay triangulation of a finite point set is such a cell complex. This paper shows that the in_front/behind relation defined for the faces of C with respect to any fixed viewpoint x is acyclic. This result has applications to hidden line/surface removal and other problems in computational geometry.