An upper bound on the average size of silhouettes
Identifieur interne : 005622 ( Main/Curation ); précédent : 005621; suivant : 005623An upper bound on the average size of silhouettes
Auteurs : Marc Glisse [France]Source :
Descripteurs français
- Pascal (Inist)
English descriptors
Abstract
It is a widely observed phenomenon in computer graphics that the size of the silhouette of a polyhedron is much smaller than the size of the whole polyhedron. This paper provides for the first time theoretical evidence supporting this for a large class of objects, namely for polyhedra that approximate surfaces in some reasonable way; the surfaces may not be convex or differentiable and they may have boundaries. We prove that such polyhedra have silhouettes of expected size O(√n) where the average is taken over all points of view and n is the complexity of the polyhedron.
Links toward previous steps (curation, corpus...)
- to stream PascalFrancis, to step Corpus: Pour aller vers cette notice dans l'étape Curation :000418
- to stream PascalFrancis, to step Curation: Pour aller vers cette notice dans l'étape Curation :000615
- to stream PascalFrancis, to step Checkpoint: Pour aller vers cette notice dans l'étape Curation :000409
- to stream Main, to step Merge: Pour aller vers cette notice dans l'étape Curation :005814
Links to Exploration step
Pascal:06-0524896Le document en format XML
<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" level="a">An upper bound on the average size of silhouettes</title><author><name sortKey="Glisse, Marc" sort="Glisse, Marc" uniqKey="Glisse M" first="Marc" last="Glisse">Marc Glisse</name><affiliation wicri:level="3"><inist:fA14 i1="01"><s1>LORIA</s1><s2>Nancy</s2><s3>FRA</s3><sZ>1 aut.</sZ></inist:fA14><country>France</country><placeName><region type="region">Grand Est</region><region type="old region">Lorraine (région)</region><settlement type="city">Nancy</settlement></placeName></affiliation></author></titleStmt><publicationStmt><idno type="wicri:source">INIST</idno><idno type="inist">06-0524896</idno><date when="2006">2006</date><idno type="stanalyst">PASCAL 06-0524896 INIST</idno><idno type="RBID">Pascal:06-0524896</idno><idno type="wicri:Area/PascalFrancis/Corpus">000418</idno><idno type="wicri:Area/PascalFrancis/Curation">000615</idno><idno type="wicri:Area/PascalFrancis/Checkpoint">000409</idno><idno type="wicri:explorRef" wicri:stream="PascalFrancis" wicri:step="Checkpoint">000409</idno><idno type="wicri:Area/Main/Merge">005814</idno><idno type="wicri:Area/Main/Curation">005622</idno></publicationStmt><sourceDesc><biblStruct><analytic><title xml:lang="en" level="a">An upper bound on the average size of silhouettes</title><author><name sortKey="Glisse, Marc" sort="Glisse, Marc" uniqKey="Glisse M" first="Marc" last="Glisse">Marc Glisse</name><affiliation wicri:level="3"><inist:fA14 i1="01"><s1>LORIA</s1><s2>Nancy</s2><s3>FRA</s3><sZ>1 aut.</sZ></inist:fA14><country>France</country><placeName><region type="region">Grand Est</region><region type="old region">Lorraine (région)</region><settlement type="city">Nancy</settlement></placeName></affiliation></author></analytic></biblStruct></sourceDesc></fileDesc><profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>Computational geometry</term><term>Computer graphics</term><term>Convex surface</term><term>Polyhedron</term><term>Upper bound</term></keywords><keywords scheme="Pascal" xml:lang="fr"><term>Géométrie algorithmique</term><term>Infographie</term><term>Surface convexe</term><term>Borne supérieure</term><term>Polyèdre</term></keywords></textClass></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">It is a widely observed phenomenon in computer graphics that the size of the silhouette of a polyhedron is much smaller than the size of the whole polyhedron. This paper provides for the first time theoretical evidence supporting this for a large class of objects, namely for polyhedra that approximate surfaces in some reasonable way; the surfaces may not be convex or differentiable and they may have boundaries. We prove that such polyhedra have silhouettes of expected size O(√n) where the average is taken over all points of view and n is the complexity of the polyhedron.</div></front></TEI></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Main/Curation
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 005622 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Curation/biblio.hfd -nk 005622 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Lorraine
|area= InforLorV4
|flux= Main
|étape= Curation
|type= RBID
|clé= Pascal:06-0524896
|texte= An upper bound on the average size of silhouettes
}}
| This area was generated with Dilib version V0.6.33. |  |