Select / remove query terms:
Found 397 results in 0.058 sec. (Time to generate facets: 0 sec.)
: A Subexponential Bound for Linear Programming.
Symposium on Computational Geometry
(COMPGEOM)
1992
: Applications of Parametric Searching in Geometric Optimization.
J. Algorithms
(JAL)
17(3):292-318 (1994)
: Piecewise-Linear Interpolation between Polygonal Slices.
Computer Vision and Image Understanding
(CVIU)
63(2):251-272 (1996)
: Piecewise-Linear Interpolation Between Polygonal Slices.
Symposium on Computational Geometry
(COMPGEOM)
1994
: New Bounds for Lower Envelopes in Three Dimensions, with Applications to Visibility in Terrains.
Symposium on Computational Geometry
(COMPGEOM)
1993
: An Expander-Based Approach to Geometric Optimization.
SIAM J. Comput.
(SIAMCOMP)
26(5):1384-1408 (1997)
: An Expander-Based Approach to Geometric Optimization.
Symposium on Computational Geometry
(COMPGEOM)
1993
: A Near-Linear Algorithm for the Planar 2-Center Problem.
Discrete & Computational Geometry
(DCG)
18(2):125-134 (1997)
Refine search by KEYWORD:
show counts
algorithm arrangements bounds computing convex dimension envelope geometric line motion number object planar planning point polygons segments sets space union