Work

On the Worst-Case Complexity of the Silhouette of a Polytope

Year: 2003
Type: conference-paper
Abstract: We give conditions under which the worst-case size of the silhouette of a polytope is sub-linear. We provide examples with linear size silhouette if any of these conditions is relaxed. Our bounds are the first non-trivial bounds for the worst-case complexity of silhouettes.
Source: HAL
Language: English
Open Access status: green
OpenAlex ID: W96225278
FWCI: 0.729
Cites: 4
Cited by: 8
Related to: 10