|
148
|
An optimal algorithm for intersecting line segments in the plane
– Bernard Chazelle, Herbert Edelsbrunner
- 1992
|
|
43
|
Worst-case optimal hidden-surface removal
– M McKenna
- 1987
|
|
275
|
Computational Geometry: An Introduction Through Randomized Algorithms
– K Mulmuley
- 1993
|
|
1611
|
Computational geometry: An introduction
– F P Preparata, M I Shamos
- 1985
|
|
2173
|
The Design and Analysis of Computer Algorithms
– A V Aho, J E Hopcroft, J D Ullman
- 1974
|
|
186
|
A characterization of ten hidden-surface algorithms
– Ivan E. Sutherland, Robert F. Sproull, Robert, A. Schumacker
- 1974
|
|
3
|
An approach to a calculation-minimized hidden line algorithm
– C Hornung
- 1982
|
|
3
|
Complexity of two-dimensional visibility computations
– F D'evai
- 1984
|
|
9
|
On the complexity of computing the measure of [[a i ; b i
– M L Fredman, B Weide
- 1978
|
|
12
|
A method for solving the visibility problem
– C Hornung
- 1984
|
|
10
|
Quadratic bounds for hidden-line elimination
– F Dévai
- 1986
|
|
167
|
Fundamentals of Interactive Computer Graphics
– J D Foley, A Van Dam
- 1982
|
|
188
|
bounds for algebraic computation trees
– Lower
- 1983
|
|
644
|
Data Structures and Algorithms
– A Aho, J Hopcroft, J D Ullman
- 1983
|
|
49
|
Fundamentals of three-dimensional computer graphics
– A Watt
- 1989
|
|
2
|
An intersection-sensitive hidden-surface algorithm
– F D'evai
- 1987
|
|
25
|
An efficient algorithm for hidden surface removal
– K Mulmuley
- 1994
|
|
17
|
Time and space bounds for hidden line and hidden surface algorithms
– A Schmitt
- 1981
|
|
247
|
Algorithms for reporting and counting geometric intersections
– Jon Louis Bentley, Thomas Ottmann
- 1979
|
