Conference paper
An algorithm for splitting an orthogonal polyhedron with an orthogonal polyplane
IEEE
International Conference on Uncertainty Reasoning and Knowledge Engineering, URKE 2011 (Bali, Indonesia, 04/08/2011–07/08/2011)
2011
Abstract
Splitting of an orthogonal polyhedron is an essential operation in many orthogonal polyhedron related problems. This paper proposes an algorithm for splitting an orthogonal polyhedron with an orthogonal polyplane. There are four major steps of this algorithm: 1) sort the vertices of the orthogonal polyhedron in ABC-sorted order; 2) calculate the vertices at the intersection between the orthogonal polyhedron and the polyplane; 3) find the polyplane vertices, and 4) group the updated vertices into two groups of orthogonal polyhedra. Overall, the algorithm performs with O(n log n) time where n is the number of vertices of a given orthogonal polyhedron.
Details
- Title
- An algorithm for splitting an orthogonal polyhedron with an orthogonal polyplane
- Authors/Creators
- J. Marzal (Author/Creator) - Murdoch UniversityH. Xie (Author/Creator) - Murdoch UniversityC.C. Fung (Author/Creator) - Murdoch University
- Conference
- International Conference on Uncertainty Reasoning and Knowledge Engineering, URKE 2011 (Bali, Indonesia, 04/08/2011–07/08/2011)
- Publisher
- IEEE
- Identifiers
- 991005543409707891
- Copyright
- © 2011 IEEE
- Murdoch Affiliation
- School of Information Technology
- Language
- English
- Resource Type
- Conference paper
- Note
- Appears in: Proceedings of the International Conference on Uncertainty Reasoning and Knowledge Engineering, URKE 2011, pp 102 - 106
Metrics
229 File views/ downloads
139 Record Views