29 search results - page 3 / 6 » Generalizing Halfspaces |
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...
JCT
2002
13 years 7 months ago
2002
In [1], the author generalized Ehrhart's idea ([2]) of counting lattice points in dilated rational polytopes: Given a rational polytope, that is, a polytope with rational vert...
COMBINATORICS
1999
13 years 7 months ago
1999
Abstract. We generalize Ehrhart's idea ([Eh]) of counting lattice points in dilated rational polytopes: Given a rational simplex, that is, an n-dimensional polytope with n + 1...
ESA
2003
Springer
14 years 21 days ago
2003
Springer
Abstract. We describe a data structure for three-dimensional Nef complexes, algorithms for boolean operations on them, and our implementation of data structure and algorithms. Nef ...
WADS
2007
Springer
14 years 1 months ago
2007
Springer
Range searching is a well known problem in the area of geometric data structures. We consider this problem in the context of approximation, where an approximation parameter ε >...