|
|||||
|
|
Fast detection of polyhedral intersection |
|
| Authors: | David P Dobkin David G Kirkpatrick |
| Affiliation: | Electrical Engineering and Computer Science Department, Princeton University, Princeton, NJ 08544, U.S.A.;Department of Computer Science, University of British Columbia, Vancouver, British Columbia, Canada |
| Abstract: | 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(log2n) are given on plane-polyhedron and polyhedron-polyhedron intersection problems. |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ | |