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

Boris Aronov, Mark De Berg, Chris Gray

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    Abstract

    We present a data structure for ray-shooting queries in a set of convex fat polyhedra of total complexity n in ℝ3. The data structure uses O(n2+ε) storage and preprocessing time, and queries can be answered in O(log2 n) 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) log2 n) time. We also describe a data structure for simplex intersection queries in a set of n convex fat constant-complexity polyhedra in ℝ3. For any m with n< m < n2, 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) log n + k) time, where k is the number of answers.

    Original languageEnglish (US)
    Title of host publicationProceedings of the Twenty-Second Annual Symposium on Computational Geometry 2006, SCG'06
    Pages88-94
    Number of pages7
    Volume2006
    StatePublished - 2006
    Event22nd Annual Symposium on Computational Geometry 2006, SCG'06 - Sedona, AZ, United States
    Duration: Jun 5 2006Jun 7 2006

    Other

    Other22nd Annual Symposium on Computational Geometry 2006, SCG'06
    CountryUnited States
    CitySedona, AZ
    Period6/5/066/7/06

    Fingerprint

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

    Keywords

    • Computational geometry
    • Fat objects
    • Intersection searching
    • Ray shooting

    ASJC Scopus subject areas

    • Chemical Health and Safety
    • Software
    • Safety, Risk, Reliability and Quality
    • Geometry and Topology

    Cite this

    Aronov, B., De Berg, M., & Gray, C. (2006). Ray shooting and intersection searching amidst fat convex polyhedra in 3-space. In Proceedings of the Twenty-Second Annual Symposium on Computational Geometry 2006, SCG'06 (Vol. 2006, pp. 88-94)

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

    Proceedings of the Twenty-Second Annual Symposium on Computational Geometry 2006, SCG'06. Vol. 2006 2006. p. 88-94.

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    Aronov, B, De Berg, M & Gray, C 2006, Ray shooting and intersection searching amidst fat convex polyhedra in 3-space. in Proceedings of the Twenty-Second Annual Symposium on Computational Geometry 2006, SCG'06. vol. 2006, pp. 88-94, 22nd Annual Symposium on Computational Geometry 2006, SCG'06, Sedona, AZ, United States, 6/5/06.
    Aronov B, De Berg M, Gray C. Ray shooting and intersection searching amidst fat convex polyhedra in 3-space. In Proceedings of the Twenty-Second Annual Symposium on Computational Geometry 2006, SCG'06. Vol. 2006. 2006. p. 88-94
    Aronov, Boris ; De Berg, Mark ; Gray, Chris. / Ray shooting and intersection searching amidst fat convex polyhedra in 3-space. Proceedings of the Twenty-Second Annual Symposium on Computational Geometry 2006, SCG'06. Vol. 2006 2006. pp. 88-94
    @inproceedings{f83228c6601947829b3a3c3027c37a96,
    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 ℝ3. The data structure uses O(n2+ε) storage and preprocessing time, and queries can be answered in O(log2 n) 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) log2 n) time. We also describe a data structure for simplex intersection queries in a set of n convex fat constant-complexity polyhedra in ℝ3. For any m with n< m < n2, 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) log n + k) time, where k is the number of answers.",
    keywords = "Computational geometry, Fat objects, Intersection searching, Ray shooting",
    author = "Boris Aronov and {De Berg}, Mark and Chris Gray",
    year = "2006",
    language = "English (US)",
    isbn = "1595933409",
    volume = "2006",
    pages = "88--94",
    booktitle = "Proceedings of the Twenty-Second Annual Symposium on Computational Geometry 2006, SCG'06",

    }

    TY - GEN

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

    AU - Aronov, Boris

    AU - De Berg, Mark

    AU - Gray, Chris

    PY - 2006

    Y1 - 2006

    N2 - We present a data structure for ray-shooting queries in a set of convex fat polyhedra of total complexity n in ℝ3. The data structure uses O(n2+ε) storage and preprocessing time, and queries can be answered in O(log2 n) 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) log2 n) time. We also describe a data structure for simplex intersection queries in a set of n convex fat constant-complexity polyhedra in ℝ3. For any m with n< m < n2, 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) log n + 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 ℝ3. The data structure uses O(n2+ε) storage and preprocessing time, and queries can be answered in O(log2 n) 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) log2 n) time. We also describe a data structure for simplex intersection queries in a set of n convex fat constant-complexity polyhedra in ℝ3. For any m with n< m < n2, 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) log n + k) time, where k is the number of answers.

    KW - Computational geometry

    KW - Fat objects

    KW - Intersection searching

    KW - Ray shooting

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

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

    M3 - Conference contribution

    SN - 1595933409

    SN - 9781595933409

    VL - 2006

    SP - 88

    EP - 94

    BT - Proceedings of the Twenty-Second Annual Symposium on Computational Geometry 2006, SCG'06

    ER -