307 search results - page 5 / 62 » The convex hull of ellipsoids |
ICPP
2002
IEEE
14 years 18 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...
COMPGEOM
1996
ACM
13 years 11 months ago
1996
ACM
We show that in the worst case, (ndd=2e;1 +n logn) sidedness queries are required to determine whether the convex hull of n points in IRd is simplicial, or to determine the number ...
COMPGEOM
2009
ACM
14 years 2 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...
COSIT
2003
Springer
14 years 26 days ago
2003
Springer
This paper looks at axioms for convexity, and shows how they can be applied to discrete spaces. Two structures for a discrete geometry are considered: oriented matroids, and cell c...
ICPR
2008
IEEE
14 years 8 months ago
2008
IEEE
We propose a linear in time and easy-to-implement algorithm that robustly decomposes a digital curve into convex and concave parts. This algorithm is based on classical tools in d...