Sciweavers

CCCG
2003
13 years 6 months ago
On the Complexity of Halfspace Volume Queries
Given a polyhedron P in Rd with n vertices, a halfspace volume query asks for the volume of P ∩ H for a given halfspace H. We show that, for d ≥ 3, such queries can require â„...
Erik D. Demaine, Jeff Erickson, Stefan Langerman