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

Helmut Alt 1 Marc Glisse 2 Xavier Goaoc 2
2 ISA - Models, algorithms and geometry for computer graphics and vision
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
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.
Document type :
Conference papers
15th Canadian Conference on Computational Geometry - CCCG 2003, 2003, Halifax, Canada, 4 p, 2003
Liste complète des métadonnées

https://hal.inria.fr/inria-00099478
Contributor : Publications Loria <>
Submitted on : Tuesday, September 26, 2006 - 9:24:09 AM
Last modification on : Thursday, January 11, 2018 - 6:19:48 AM
Document(s) archivé(s) le : Wednesday, March 29, 2017 - 1:13:48 PM

Identifiers

  • HAL Id : inria-00099478, version 1

Collections

Citation

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, 2003. 〈inria-00099478〉

Share

Metrics

Record views

169

Files downloads

37