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

Helmut Alt; Marc Glisse; Xavier Goaoc

Conference Papers Year : 2003

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

(1) , (2) , (2)

1
2

Helmut Alt

Function : Author

Institute of Computer Science [Warszawa]

Marc Glisse

Function : Author
PersonId : 1735
IdHAL : glisse
ORCID : 0000-0001-6914-1651
IdRef : 250339196

Models, algorithms and geometry for computer graphics and vision

Xavier Goaoc

Function : Author
PersonId : 9973
IdHAL : xavier-goaoc
IdRef : 172437245

Models, algorithms and geometry for computer graphics and vision

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.

Keywords

geometry silhouette polytope computational géométrie algorithmique

Domains

Other [cs.OH]

Fichier principal

A03-R-081.pdf (232.28 Ko)

Publications Loria : Connect in order to contact the contributor

https://inria.hal.science/inria-00099478

Submitted on : Tuesday, September 26, 2006-9:24:09 AM

Last modification on : Thursday, January 4, 2024-10:12:05 PM

Long-term archiving on: Wednesday, March 29, 2017-1:13:48 PM

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⟩

Export

BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite

Collections

CNRS INRIA UNIV-LORRAINE INRIA2 LORIA

134 View

41 Download

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

Abstract

Keywords

Domains

Dates and versions

Identifiers

Cite

Export

Collections

Share