Space sweep solves intersection of convex polyhedra (Q759486): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1007/bf00271644 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2094793205 / rank | |||
Normal rank |
Latest revision as of 10:22, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Space sweep solves intersection of convex polyhedra |
scientific article |
Statements
Space sweep solves intersection of convex polyhedra (English)
0 references
1984
0 references
Plane-sweep algorithms form a fairly general approach to two-dimensional problems of computational geometry. No corresponding general space-sweep algorithms for geometric problems in 3-space are known. We derive concepts for such space-sweep algorithms that yield an efficient solution to the problem of solving any set operation (union, intersection,...) of two convex polyhedra. Our solution matches the best known time bound of O(n log n), where n is the combined number of vertices of the two polyhedra.
0 references
computational geometry
0 references
space-sweep algorithms
0 references
convex polyhedra
0 references
0 references