947 search results - page 112 / 190 » Discrete Geometry |
COMPGEOM
2009
ACM
15 years 4 months ago
2009
ACM
Color red and blue the n vertices of a convex polytope P in R3 . Can we compute the convex hull of each color class in o(n log n)? What if we have χ > 2 colors? What if the co...
COMPGEOM
2009
ACM
15 years 4 months ago
2009
ACM
We present the Iterated-Tverberg algorithm, the first deterministic algorithm for computing an approximate centerpoint of a set S ∈ Rd with running time sub-exponential in d. T...
JCDCG
2004
Springer
15 years 3 months ago
2004
Springer
We prove that all single-vertex origami shapes are reachable from the open flat state via simple, non-crossing motions. We also consider conical paper, where the total sum of the ...
102
click to vote
DGCI
2000
Springer
15 years 2 months ago
2000
Springer
Abstract. We present a new algorithm for modeling and characterizing shape changes in 3D image sequences of biomedical structures. Our algorithm tracks the shape changes of the obj...
COMPGEOM
1999
ACM
15 years 2 months ago
1999
ACM
Several motion planning methods using networks of randomly generated nodes in the free space have been shown to perform well in a number of cases, however their performance degrad...