Go to main content

PDF

Description

We present an algorithm that determines, in expected O(n^2) time, whether a line exists that stabs each of a set of oriented convex polygons in R^3 with a total of n edges. If a stabbing line exists, the algorithm computes at least one such line. We show that the computation amounts to constructing a convex polytope in R^5 and inspecting its edges for intersections with a four-dimensional quadric surface, the Plucker quadric.

Details

Files

Statistics

from
to
Export
Download Full History
Formats
Format
BibTeX
MARCXML
TextMARC
MARC
DublinCore
EndNote
NLM
RefWorks
RIS