5 search results - page 1 / 1 » On the Hardness of Computing Intersection, Union and Minkows... |
DCG
2008
13 years 4 months ago
2008
For polytopes P1, P2 Rd we consider the intersection P1 P2, the convex hull of the union CH(P1 P2), and the Minkowski sum P1 + P2. For Minkowski sum we prove that enumerating t...
COMPGEOM
2007
ACM
13 years 8 months ago
2007
ACM
For polytopes P, Q Rd we consider the intersection P Q; the convex hull of the union CH(P Q); and the Minkowski sum P + Q. We prove that given rational H-polytopes P1, P2, Q it...
COMPGEOM
2006
ACM
13 years 10 months ago
2006
ACM
In a Batched Colored Intersection Searching Problem (CI), one is given a set of n geometric objects (of a certain class). Each object is colored by one of c colors, and the goal i...
COMPGEOM
2010
ACM
13 years 9 months ago
2010
ACM
Let P be a set of n points in R3 . The 2-center problem for P is to find two congruent balls of the minimum radius whose union covers P. We present two randomized algorithms for ...
MICS
2010
12 years 11 months ago
2010
We describe the algorithms and implementation details involved in the concretizations of a generic framework that enables exact construction, maintenance, and manipulation of arran...