Ray shooting and intersection searching amidst fat convex polyhedra in 3-space

Boris Aronov, Mark De Berg, Chris Gray

    Research output: Contribution to journalArticle

    Abstract

    We present a data structure for ray-shooting queries in a set of convex fat polyhedra of total complexity n in R3. The data structure uses O(n2 +) storage and preprocessing time, and queries can be answered in O( log2n) time. A trade-off between storage and query time is also possible: for any m with n<m< n2, we can construct a structure that uses O(m1 +) storage and preprocessing time such that queries take O((n/m) log2n) time. We also describe a data structure for simplex intersection queries in a set of n convex fat constant-complexity polyhedra in R3. For any m with n<m< n3, we can construct a structure that uses O(m1 +) storage and preprocessing time such that all polyhedra intersecting a query simplex can be reported in O((n/m1 /3)logn+k) time, where k is the number of answers.

    Original languageEnglish (US)
    Pages (from-to)68-76
    Number of pages9
    JournalComputational Geometry: Theory and Applications
    Volume41
    Issue number1-2
    DOIs
    StatePublished - Oct 2008

    Fingerprint

    Ray Shooting
    Convex polyhedron
    Oils and fats
    Data structures
    Intersection
    Query
    Polyhedron
    Preprocessing
    Data Structures
    Trade-offs

    Keywords

    • Fat objects
    • Geometric data structures
    • Intersection searching
    • Ray shooting

    ASJC Scopus subject areas

    • Computational Theory and Mathematics
    • Computer Science Applications
    • Computational Mathematics
    • Control and Optimization
    • Geometry and Topology

    Cite this

    Ray shooting and intersection searching amidst fat convex polyhedra in 3-space. / Aronov, Boris; De Berg, Mark; Gray, Chris.

    In: Computational Geometry: Theory and Applications, Vol. 41, No. 1-2, 10.2008, p. 68-76.

    Research output: Contribution to journalArticle

    Aronov, Boris ; De Berg, Mark ; Gray, Chris. / Ray shooting and intersection searching amidst fat convex polyhedra in 3-space. In: Computational Geometry: Theory and Applications. 2008 ; Vol. 41, No. 1-2. pp. 68-76.
    @article{931e85e7de684b9681d9a3af2019b3f8,
    title = "Ray shooting and intersection searching amidst fat convex polyhedra in 3-space",
    abstract = "We present a data structure for ray-shooting queries in a set of convex fat polyhedra of total complexity n in R3. The data structure uses O(n2 +) storage and preprocessing time, and queries can be answered in O( log2n) time. A trade-off between storage and query time is also possible: for any m with n<m< n2, we can construct a structure that uses O(m1 +) storage and preprocessing time such that queries take O((n/m) log2n) time. We also describe a data structure for simplex intersection queries in a set of n convex fat constant-complexity polyhedra in R3. For any m with n<m< n3, we can construct a structure that uses O(m1 +) storage and preprocessing time such that all polyhedra intersecting a query simplex can be reported in O((n/m1 /3)logn+k) time, where k is the number of answers.",
    keywords = "Fat objects, Geometric data structures, Intersection searching, Ray shooting",
    author = "Boris Aronov and {De Berg}, Mark and Chris Gray",
    year = "2008",
    month = "10",
    doi = "10.1016/j.comgeo.2007.10.006",
    language = "English (US)",
    volume = "41",
    pages = "68--76",
    journal = "Computational Geometry: Theory and Applications",
    issn = "0925-7721",
    publisher = "Elsevier",
    number = "1-2",

    }

    TY - JOUR

    T1 - Ray shooting and intersection searching amidst fat convex polyhedra in 3-space

    AU - Aronov, Boris

    AU - De Berg, Mark

    AU - Gray, Chris

    PY - 2008/10

    Y1 - 2008/10

    N2 - We present a data structure for ray-shooting queries in a set of convex fat polyhedra of total complexity n in R3. The data structure uses O(n2 +) storage and preprocessing time, and queries can be answered in O( log2n) time. A trade-off between storage and query time is also possible: for any m with n<m< n2, we can construct a structure that uses O(m1 +) storage and preprocessing time such that queries take O((n/m) log2n) time. We also describe a data structure for simplex intersection queries in a set of n convex fat constant-complexity polyhedra in R3. For any m with n<m< n3, we can construct a structure that uses O(m1 +) storage and preprocessing time such that all polyhedra intersecting a query simplex can be reported in O((n/m1 /3)logn+k) time, where k is the number of answers.

    AB - We present a data structure for ray-shooting queries in a set of convex fat polyhedra of total complexity n in R3. The data structure uses O(n2 +) storage and preprocessing time, and queries can be answered in O( log2n) time. A trade-off between storage and query time is also possible: for any m with n<m< n2, we can construct a structure that uses O(m1 +) storage and preprocessing time such that queries take O((n/m) log2n) time. We also describe a data structure for simplex intersection queries in a set of n convex fat constant-complexity polyhedra in R3. For any m with n<m< n3, we can construct a structure that uses O(m1 +) storage and preprocessing time such that all polyhedra intersecting a query simplex can be reported in O((n/m1 /3)logn+k) time, where k is the number of answers.

    KW - Fat objects

    KW - Geometric data structures

    KW - Intersection searching

    KW - Ray shooting

    UR - http://www.scopus.com/inward/record.url?scp=84867992862&partnerID=8YFLogxK

    UR - http://www.scopus.com/inward/citedby.url?scp=84867992862&partnerID=8YFLogxK

    U2 - 10.1016/j.comgeo.2007.10.006

    DO - 10.1016/j.comgeo.2007.10.006

    M3 - Article

    VL - 41

    SP - 68

    EP - 76

    JO - Computational Geometry: Theory and Applications

    JF - Computational Geometry: Theory and Applications

    SN - 0925-7721

    IS - 1-2

    ER -