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

Helmut Alt (1) , Marc Glisse (2) , Xavier Goaoc (2)

1 Institute of Computer Science [Warszawa]
2 ISA - Models, algorithms and geometry for computer graphics and vision

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.

Mots clés: geometry; silhouette; polytope; computational; géométrie; algorithmique

Domaines: Autre [cs.OH]

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⟩