• Login
    View Item 
    •   Eurographics DL Home
    • Computer Graphics Forum
    • Volume 03 (1984)
    • Issue 3
    • View Item
    •   Eurographics DL Home
    • Computer Graphics Forum
    • Volume 03 (1984)
    • Issue 3
    • View Item
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    An Algorithm for Determining the Intersection of Two Simple Polyhedra

    Thumbnail
    Date
    1984
    Author
    Szilvasi-Nagy, M.
    Pay-Per-View via TIB Hannover:

    Try if this item/paper is available.

    Metadata
    Show full item record
    Abstract
    An algorithm is presented for the construction of the intersection of two simple possibly non-convex polyhedra. The methods of descriptive geometry are applied, so that this three-dimensional problem can be solved in two dimensions.We have to find all intersections of the edges of each polyhedron with the faces of the other, and these points of intersection can be found in Monge’s model. Projecting both polyhedra on the xy and on the xz coordinate planes we obtain two superimposed maps in both projections. The algorithm to find the intersection of two maps is based upon the Shamos-Hoey, the Bentley-Ottmann and the Nievergelt-Preparata algorithms. The asymptotic time requirement for determining the polygon of intersection of two polyhedra is O((N + S)log N), where N is the sum of the numbers of vertices of the two polyhedra and S is the total number of intersections of all projected edges in the xy-plane (S = O(N2)).
    BibTeX
    @article {10.1111:j.1467-8659.1984.tb00071.x,
    journal = {Computer Graphics Forum},
    title = {{An Algorithm for Determining the Intersection of Two Simple Polyhedra}},
    author = {Szilvasi-Nagy, M.},
    year = {1984},
    publisher = {Blackwell Publishing Ltd and the Eurographics Association},
    ISSN = {1467-8659},
    DOI = {10.1111/j.1467-8659.1984.tb00071.x}
    }
    URI
    http://dx.doi.org/10.1111/j.1467-8659.1984.tb00071.x
    Collections
    • Issue 3

    Eurographics Association copyright © 2013 - 2021 
    Send Feedback | Contact - Imprint | Data Privacy Policy | Disable Google Analytics
    Theme by @mire NV
    System hosted at  Graz University of Technology.
    TUGFhA
     

     

    Browse

    All of Eurographics DLCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects

    My Account

    LoginRegister

    BibTeX | TOC

    Create BibTeX Create Table of Contents

    Eurographics Association copyright © 2013 - 2021 
    Send Feedback | Contact - Imprint | Data Privacy Policy | Disable Google Analytics
    Theme by @mire NV
    System hosted at  Graz University of Technology.
    TUGFhA