Catalog Home Page

An algorithm for splitting an orthogonal polyhedron with an orthogonal polyplane

Marzal, J., Xie, H. and Fung, C.C. (2011) An algorithm for splitting an orthogonal polyhedron with an orthogonal polyplane. In: International Conference on Uncertainty Reasoning and Knowledge Engineering, URKE 2011, 4 - 7 August, Bali, Indonesia pp. 102-106.

[img]
Preview
PDF - Authors' Version
Download (205kB) | Preview
    Link to Published Version: http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arn...
    *Subscription may be required

    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.

    Publication Type: Conference Paper
    Murdoch Affiliation: School of Information Technology
    Publisher: IEEE
    Copyright: © 2011 IEEE.
    Notes: Appears in: Proceedings of the International Conference on Uncertainty Reasoning and Knowledge Engineering, URKE 2011, pp 102 - 106
    URI: http://researchrepository.murdoch.edu.au/id/eprint/5629
    Item Control Page

    Downloads

    Downloads per month over past year