Time and Space Bounds for Hidden Line and Hidden Surface Algorithms.
Alfred SchmittPublished in: Eurographics (1981)
Keyphrases
- learning algorithm
- upper and lower bounds
- randomized algorithms
- space requirements
- data structure
- worst case
- upper bound
- average case
- computational complexity
- data sets
- theoretical analysis
- three dimensional
- linear space
- computational cost
- significant improvement
- optimization problems
- machine learning
- theoretical guarantees
- data mining