Abstract
We present an efficient algorithm for finding the sequence of extreme vertices of a moving convex polyhedron P with respect to a fixed plane H. Using the spherical extreme vertex diagram due to the point-plane duality, we are able to find such a sequence in O(log n + ∑ s j=1 m j ) time, where s is the number of extreme vertices in the sequence, and m j , 1 ≤ j ≤ s, is the number of edges of the spherical region S v j corresponding to an extreme vertex v j in the sequence.
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.
