Advertisement

A dual approach to detect polyhedral intersections in arbitrary dimensions

Chapter
Part of the Lecture Notes in Computer Science book series (LNCS, volume 337)

Keywords

Boundary 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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 1988

Personalised recommendations