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(log2 n) are given on plane-polyhedron and polyhedron-polyhedron intersection problems.
|Original language||English (US)|
|Number of pages||13|
|Journal||Theoretical Computer Science|
|State||Published - 1983|
All Science Journal Classification (ASJC) codes
- Theoretical Computer Science
- Computer Science(all)