31 search results - page 1 / 7 » How Good are Convex Hull Algorithms |
COMPGEOM
1995
ACM
13 years 8 months ago
1995
ACM
A convex polytope P can be speci ed in two ways: as the convex hull of the vertex set V of P, or as the intersection of the set H of its facet-inducing halfspaces. The vertex enum...
ICCSA
2004
Springer
13 years 10 months ago
2004
Springer
Finding the fastest algorithm to solve a problem is one of the main issues in Computational Geometry. Focusing only on worst case analysis or asymptotic computations leads to the d...
COMPGEOM
1995
ACM
13 years 8 months ago
1995
ACM
This paper presents an experimental comparison of a number of different algorithms for computing the Deluanay triangulation. The algorithms examined are: Dwyer’s divide and conq...
COSIT
2003
Springer
13 years 10 months 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...
COMPGEOM
2009
ACM
13 years 11 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...