1879 search results - page 6 / 376 » Computational geometry algorithms library |
DIMACS
2001
13 years 8 months ago
2001
We investigate visibility computations with moving viewpoints. The initial problems are of discrete and algorithmic nature, but even for simple classes of objects (such as balls an...
PLDI
2006
ACM
14 years 1 months ago
2006
ACM
Dependence graphs and memoization can be used to efficiently update the output of a program as the input changes dynamically. Recent work has studied techniques for combining the...
WADS
2001
Springer
13 years 11 months ago
2001
Springer
ESA
2000
Springer
13 years 11 months ago
2000
Springer
ICPP
2002
IEEE
14 years 10 days ago
2002
IEEE
We develop efficient algorithms for problems in computational geometry—convex hull, smallest enclosing box, ECDF, two-set dominance, maximal points, all-nearest neighbor, and c...