A dual approach to detect polyhedral intersections in arbitrary dimensions
Part of the Lecture Notes in Computer Science book series (LNCS, volume 337)
KeywordsBoundary Segment Convex Polyhedron Total Time Complexity Dual Point Dimensional Hyperplane
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Unable to display preview. Download preview PDF.
© Springer-Verlag Berlin Heidelberg 1988