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
Authors: Helmut Alt, Marc Glisse, Xavier Goaoc
Institution: Institute of Computer Science
Language: English
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W96225278
