Fast detection of polyhedral intersection (Q759483): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 01:09, 5 March 2024
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
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
