Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
PDF Tools
Image Tools
Text Tools
OCR Tools
Symbol and Emoji Tools
On-screen Keyboard
Latex Math Equation to Image
Smart IPA Phonetic Keyboard
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
99
click to vote
CCCG
2003
92
views
Computational Geometry
»
more
CCCG 2003
»
On the Complexity of Halfspace Volume Queries
15 years 4 months ago
Download
compgeom.cs.uiuc.edu
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
claim paper
Read More »