On the worst-case complexity of the silhouette of a polytope - Archive ouverte HAL Access content directly
Conference Papers Year : 2003

On the worst-case complexity of the silhouette of a polytope

(1) , (2) , (2)
1
2

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.
Fichier principal
Vignette du fichier
A03-R-081.pdf (232.28 Ko) Télécharger le fichier

Dates and versions

inria-00099478 , version 1 (26-09-2006)

Identifiers

  • HAL Id : inria-00099478 , version 1

Cite

Helmut Alt, Marc Glisse, Xavier Goaoc. On the worst-case complexity of the silhouette of a polytope. 15th Canadian Conference on Computational Geometry - CCCG 2003, 2003, Halifax, Canada, 4 p. ⟨inria-00099478⟩
137 View
46 Download

Share

Gmail Facebook Twitter LinkedIn More