Some dynamic computational geometry problems
Mikhail J. Atallah · Computers & Mathematics with Applications · 1985
Cited by 151 works. doi:10.1016/0898-1221(85)90105-1 Open-access PDF
Authors
References
- An efficient algorith for determining the convex hull of a finite planar set
- Closest-point problems
- Geometric complexity
- Convex hulls of finite sets of points in two and three dimensions
- On Finding the Maxima of a Set of Vectors
- Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems
- Lower bounds for algebraic computation trees
- Divide-and-conquer in multidimensional space
- A Lower Bound to Finding Convex Hulls
- Linear-time algorithms for linear programming in R3 and related problems