Skip header Section
Skip Bibliometrics Section
Ray Shooting, Depth Orders and Hidden Surface RemovalOctober 1993
- Author:
- Mark de Berg
Abstract
No abstract available.
Cited By
- Aronov B, Miller E and Sharir M Eliminating depth cycles among triangles in three dimensions Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, (2476-2494)
- Schulz A and TóTh C (2013). The union of colorful simplices spanned by a colored point set, Computational Geometry: Theory and Applications, 46:5, (574-590), Online publication date: 1-Jul-2013.
- Schulz A and Tóth C The union of colorful simplices spanned by a colored point set Proceedings of the 4th international conference on Combinatorial optimization and applications - Volume Part I, (324-338)
- de Berg M and Gray C (2010). Decompositions and boundary coverings of non-convex fat polyhedra, Computational Geometry: Theory and Applications, 43:2, (73-83), Online publication date: 1-Feb-2010.
- Aronov B, de Berg M, Gray C and Mumford E Cutting cycles of rods in space Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms, (1241-1248)
- de Berg M and Gray C Computing the visibility map of fat objects Proceedings of the 10th international conference on Algorithms and Data Structures, (251-262)
Aronov B, de Berg M and Gray C Ray shooting and intersection searching amidst fat convex polyhedra in 3-space Proceedings of the twenty-second annual symposium on Computational geometry, (88-94)- de Berg M and Gray C Vertical ray shooting and computing depth orders for fat objects Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm, (494-503)
- de Berg M Vertical ray shooting for fat objects Proceedings of the twenty-first annual symposium on Computational geometry, (288-295)
- Aronov B, Koltun V and Sharir M Cutting triangular cycles of lines in space Proceedings of the thirty-fifth annual ACM symposium on Theory of computing, (547-555)
- Asano T, De Berg M, Cheong O, Guibas L, Snoeyink J and Tamaki H (2003). Spanning Trees Crossing Few Barriers, Discrete & Computational Geometry, 30:4, (591-606), Online publication date: 1-Oct-2003.
- Erickson J Dense point sets have sparse Delaunay triangulations Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms, (125-134)
- Koltun V Segment intersection searching problems in general settings Proceedings of the seventeenth annual symposium on Computational geometry, (197-206)
- Halperin D, Latombe J and Wilson R A general framework for assembly planning Proceedings of the fourteenth annual symposium on Computational geometry, (9-18)
- Silva C, Mitchell J and Williams P An exact interactive time visibility ordering algorithm for polyhedral cell complexes Proceedings of the 1998 IEEE symposium on Volume visualization, (87-94)
- Floriani L and Magillo P (1997). Visibility Computations on Hierarchical Triangulated Terrain Models, Geoinformatica, 1:3, (219-250), Online publication date: 1-Oct-1997.
- Sbert M (1997). Error and Complexity of Random Walk Monte Carlo Radiosity, IEEE Transactions on Visualization and Computer Graphics, 3:1, (23-38), Online publication date: 1-Jan-1997.
- Silva C and Mitchell J (1997). The Lazy Sweep Ray Casting Algorithm for Rendering Irregular Grids, IEEE Transactions on Visualization and Computer Graphics, 3:2, (142-157), Online publication date: 1-Apr-1997.
- Pocchiola M and Vegter G Pseudo-triangulations Proceedings of the twelfth annual symposium on Computational geometry, (291-300)
- Silva C, Mitchell J and Kaufman A Fast rendering of irregular grids Proceedings of the 1996 symposium on Volume visualization, (15-ff.)
- Agarwal P, de Berg M, Halperin D and Sharir M Efficient generation of k-directional assembly sequences Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms, (122-131)
- Berg M, Guibas L and Halperin D (1996). Vertical decompositions for triangles in 3-space, Discrete & Computational Geometry, 15:1, (35-61), Online publication date: 1-Jan-1996.
- Overmars M, Rao A, Schwarzkopf O and Wentink C Immobilizing polygons against a wall Proceedings of the eleventh annual symposium on Computational geometry, (29-38)
- Halperin D and Overmars M Spheres, molecules, and hidden surface removal Proceedings of the tenth annual symposium on Computational geometry, (113-122)
Recommendations
Two dimensional hidden surface removal with frame-to-frame coherence
SCCG '15: Proceedings of the 31st Spring Conference on Computer GraphicsWe describe a hidden surface removal algorithm for two-dimensional layered scenes built from arbitrary primitives, particularly suited to interaction and animation in rich scenes (for example, in illustration). The method makes use of a set-based raster ...
GPU-accelerated high-quality hidden surface removal
HWWS '05: Proceedings of the ACM SIGGRAPH/EUROGRAPHICS conference on Graphics hardwareHigh-quality off-line rendering requires many features not natively supported by current commodity graphics hardware: wide smooth filters, high sampling rates, order-independent transparency, spectral opacity, motion blur, depth of field. We present a ...
Accelerating ray shooting through aggressive 5D visibility preprocessing
AFRIGRAPH '03: Proceedings of the 2nd international conference on Computer graphics, virtual Reality, visualisation and interaction in AfricaWe present a new approach to accelerating general ray shooting. Our technique uses a five-dimensional ray space partition and is based on the classic ray-classification algorithm. Where the original algorithm evaluates intersection candidates at run-...