Constant-Working-Space Algorithms for Geometric Problems.
Tetsuo AsanoGünter RotePublished in: CCCG (2009)
Keyphrases
- computational geometry
- optimization problems
- search methods
- problems in computer vision
- difficult problems
- orders of magnitude
- times faster
- exact algorithms
- approximate solutions
- theoretical guarantees
- specific problems
- hard problems
- theoretical analysis
- computationally efficient
- inference problems
- data structure
- computational complexity
- search algorithm
- run times
- linear space
- computational problems
- np hard problems
- partial solutions
- practical problems
- related problems
- benchmark problems
- combinatorial optimization
- machine learning algorithms
- worst case
- search space
- feature space