|
1541
|
Computational Geometry: An Introduction
– Preparata, Shamos
- 1985
|
|
1258
|
Randomized Algorithms
– Motwani, Raghavan
- 1995
|
|
789
|
Computer Graphics: Principles and Practice
– Foley, Dam, et al.
- 1997
|
|
611
|
Algorithms in combinatorial geometry
– Edelsbrunner
- 1987
|
|
505
|
OBB-tree: A hierarchical structure for rapid interference detection
– GOTTSCHALK, LIN, et al.
- 1996
|
|
363
|
Adaptive display algorithm for interactive frame rates during visualization of complex virtual environments
– FUNKHOUSER, SÉQUIN
- 1993
|
|
345
|
Applications of random sampling in computational geometry
– Clarkson, Shor
- 1989
|
|
269
|
On visible surface generation by a priori tree structures
– Fuchs, Kedem, et al.
- 1980
|
|
240
|
Iterative Solution of Large Linear Systems
– Young
- 1971
|
|
231
|
Algorithms for Reporting and Counting Geometric Intersections
– Bentley, Ottmann
- 1979
|
|
210
|
Hierarchical Z-buffer visibility
– Greene, Kass, et al.
- 1993
|
|
209
|
A Subdivision Algorithm for Computer Display of Curved Surfaces
– Catmull
- 1974
|
|
204
|
Data structures for mobile data
– Basch, Guibas, et al.
- 1999
|
|
194
|
Geometric range searching and its relatives
– Agarwal, Erickson
- 1999
|
|
188
|
Epsilon-nets and simplex range queries
– Haussler, Welzl
- 1987
|
|
161
|
A Characterization of Ten Hidden-Surface Algorithms
– Sutherland, Sproull, et al.
- 1974
|
|
142
|
Ray shooting and parametric search
– Agarwal, Matouˇsek
- 1993
|
|
135
|
Hierarchical image caching for accelerated walkthroughs of complex environments
– Shade, Lischinski, et al.
- 1996
|
|
128
|
Topology, A first course
– Munkres
- 1975
|
|
125
|
Portals and Mirrors: Simple, Fast Evaluation of Potentially Visible Sets
– Luebke, Georges
- 1995
|
|
121
|
Parametric modeling
– HOFFMANN, ARINYO
- 2002
|
|
118
|
Optimizing triangle strips for fast rendering
– Evans, Skiena, et al.
- 1996
|
|
116
|
Visibility Computations in Densely Occluded Polyhedral Environments
– Teller
- 1992
|
|
113
|
Set Operations on Polyhedra Using Binary Space Partitioning Trees
– Thibault, Naylor
|
|
107
|
Real-Time Occlusion Culling for Models with Large Occluders. ACM symposium on interactive 3D graphics
– Coorg, Teller
- 1997
|
|
99
|
Efficient exact arithmetic for computational geometry
– Fortune, Wyk
- 1993
|
|
94
|
Visibility culling using hierarchical occlusion maps
– Zhang, Manocha, et al.
- 1997
|
|
91
|
Towards exact geometric computation
– Yap
- 1997
|
|
88
|
Near Real-Time Shadow Generation Using BSP Trees
– Chin, Feiner
|
|
87
|
InfiniteReality: A real-time graphics system
– Montrym, Baum, et al.
- 1997
|
|
85
|
The power of geometric duality
– Chazelle, Guibas, et al.
- 1985
|
|
83
|
Surface approximation and geometric partitions
– AGARWAL, SURI
- 1998
|
|
83
|
Efficient binary space partitions for hidden-surface removal and solid modeling. Discrete Comput. Geom
– Paterson, Yao
- 1990
|
|
78
|
Increasing Update Rates in the Building Walkthrough System with Automatic Model-Space Subdivision and Potentially Visible Set Calculations
– Airey
|
|
78
|
Merging BSP Trees Yields Polyhedral Set Operations
– Naylor, Amanatides, et al.
|
|
77
|
Realistic input models for geometric algorithms
– Berg, Katz, et al.
- 1997
|
|
77
|
A three-dimensional image cache for virtual reality
– Schaufler, Stürzlinger
- 1996
|
|
69
|
Accelerated Occlusion Culling using Shadow Frusta
– Hudson, Manocha, et al.
- 1997
|
|
66
|
Temporally Coherent Conservative Visibility
– COORG, TELLER
- 1996
|
|
65
|
A.: Ring: A client-server system for multi-user virtual environments
– FUNKHOUSER
- 1995
|
|
64
|
Fast object-precision shadow generation for areal light sources using BSP trees
– Chin, Feiner
- 1992
|
|
64
|
Approximation algorithms for geometric tour and network design problems
– Mata, Mitchell
- 1995
|
|
63
|
Hierarchical polygon tiling with coverage masks
– Greene
- 1996
|
|
62
|
Backwards analysis of randomized geometric algorithms
– Seidel
- 1993
|
|
61
|
J.: Evaluation of collision detection methods for virtual reality fly-throughs
– HELD, KLOSOWSKI, et al.
- 1995
|
|
59
|
der Stappen. Range searching and point location among fat objects
– Overmars, van
- 1996
|
|
54
|
Convex partitions of polyhedra: a lower bound and worst-case optimal algorithm
– Chazelle
- 1984
|
|
54
|
Study for Applying Computer-Generated Images to Visual Simulation
– Schumacker, Brand, et al.
- 1969
|
|
51
|
Making radiosity usable: automatic preprocessing and meshing techniques for the generation of accurate radiosity solutions
– Baum, Mann, et al.
- 1991
|
|
50
|
Analytical geometry of three dimensions
– Sommerville
- 1959
|
