Abstract
We present an algorithm polvol for the computation of the d-dimensional volume V(P) of a bounded polyhedron P ⊂ R d . It is shown that V(P) is determined by the local properties of P at all its vertices. So our method consists in letting a hyperplane “sweep” through R d, collecting the local information available at every vertex a k of P. This leads to an additive contribution to the volume from every a k , the sum of these contributions being V(P). It is assumed that P is represented in Boolean form as described in [13].
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
