Fast detection of polyhedral intersection (Q759483): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0304-3975(82)90120-7 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1996036165 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3844775 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Maintenance of configurations in the plane / rank | |||
Normal rank | |||
Latest revision as of 15:20, 14 June 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
