Fast detection of polyhedral intersection (Q759483)

From MaRDI portal
Revision as of 08:16, 5 July 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)





scientific article
Language Label Description Also known as
English
Fast detection of polyhedral intersection
scientific article

    Statements

    Fast detection of polyhedral intersection (English)
    0 references
    0 references
    0 references
    1983
    0 references
    Methods are given for unifying and extending previous work on detecting intersections of suitably preprocessed polyhedra. New upper bounds of O(log n) and \(O(\log^ 2 n)\) are given on plane-polyhedron and polyhedron-polyhedron intersection problems.
    0 references
    computational geometry
    0 references

    Identifiers