Efficient primitive traversal using adaptive linear edge function algorithms.
Marcus D. WallerJon P. EwinsMartin WhitePaul F. ListerPublished in: Comput. Graph. (1999)
Keyphrases
- data structure
- computationally efficient
- computationally demanding
- adaptive algorithms
- linear space
- computational cost
- optimization problems
- theoretical analysis
- computationally expensive
- tree structure
- efficient solutions
- computationally intensive
- efficient implementation
- orders of magnitude
- computational complexity
- learning algorithm
- times faster
- data mining
- highly efficient
- linear models
- worst case
- computationally tractable
- high level