An upper bound on the average size of silhouettes
Identifieur interne : 000615 ( PascalFrancis/Curation ); précédent : 000614; suivant : 000616An 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.
| pA |
|
|---|
Links toward previous steps (curation, corpus...)
- to stream PascalFrancis, to step Corpus: Pour aller vers cette notice dans l'étape Curation :000418
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="1"><inist:fA14 i1="01"><s1>LORIA</s1><s2>Nancy</s2><s3>FRA</s3><sZ>1 aut.</sZ></inist:fA14><country>France</country></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></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="1"><inist:fA14 i1="01"><s1>LORIA</s1><s2>Nancy</s2><s3>FRA</s3><sZ>1 aut.</sZ></inist:fA14><country>France</country></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><inist><standard h6="B"><pA><fA08 i1="01" i2="1" l="ENG"><s1>An upper bound on the average size of silhouettes</s1></fA08><fA09 i1="01" i2="1" l="ENG"><s1>Computational geometry (SCG'06) : June 5-7, 2006, Sedona AZ</s1></fA09><fA11 i1="01" i2="1"><s1>GLISSE (Marc)</s1></fA11><fA14 i1="01"><s1>LORIA</s1><s2>Nancy</s2><s3>FRA</s3><sZ>1 aut.</sZ></fA14><fA18 i1="01" i2="1"><s1>Association for Computing Machinery</s1><s3>USA</s3><s9>org-cong.</s9></fA18><fA20><s1>105-111</s1></fA20><fA21><s1>2006</s1></fA21><fA23 i1="01"><s0>ENG</s0></fA23><fA25 i1="01"><s1>ACM Press</s1><s2>New York NY</s2></fA25><fA26 i1="01"><s0>1-59593-340-9</s0></fA26><fA30 i1="01" i2="1" l="ENG"><s1>SCG : symposium on computational geometry</s1><s2>22</s2><s3>USA</s3><s4>2006</s4></fA30><fA43 i1="01"><s1>INIST</s1><s2>Y 38977</s2><s5>354000153509950130</s5></fA43><fA44><s0>0000</s0><s1>© 2006 INIST-CNRS. All rights reserved.</s1></fA44><fA45><s0>9 ref.</s0></fA45><fA47 i1="01" i2="1"><s0>06-0524896</s0></fA47><fA60><s1>C</s1></fA60><fA61><s0>A</s0></fA61><fA66 i1="01"><s0>USA</s0></fA66><fC01 i1="01" l="ENG"><s0>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.</s0></fC01><fC02 i1="01" i2="X"><s0>001D02C03</s0></fC02><fC02 i1="02" i2="X"><s0>001D02D05</s0></fC02><fC03 i1="01" i2="X" l="FRE"><s0>Géométrie algorithmique</s0><s5>01</s5></fC03><fC03 i1="01" i2="X" l="ENG"><s0>Computational geometry</s0><s5>01</s5></fC03><fC03 i1="01" i2="X" l="SPA"><s0>Geometría computacional</s0><s5>01</s5></fC03><fC03 i1="02" i2="X" l="FRE"><s0>Infographie</s0><s5>06</s5></fC03><fC03 i1="02" i2="X" l="ENG"><s0>Computer graphics</s0><s5>06</s5></fC03><fC03 i1="02" i2="X" l="SPA"><s0>Gráfico computadora</s0><s5>06</s5></fC03><fC03 i1="03" i2="X" l="FRE"><s0>Surface convexe</s0><s5>18</s5></fC03><fC03 i1="03" i2="X" l="ENG"><s0>Convex surface</s0><s5>18</s5></fC03><fC03 i1="03" i2="X" l="SPA"><s0>Superficie convexa</s0><s5>18</s5></fC03><fC03 i1="04" i2="X" l="FRE"><s0>Borne supérieure</s0><s5>23</s5></fC03><fC03 i1="04" i2="X" l="ENG"><s0>Upper bound</s0><s5>23</s5></fC03><fC03 i1="04" i2="X" l="SPA"><s0>Cota superior</s0><s5>23</s5></fC03><fC03 i1="05" i2="X" l="FRE"><s0>Polyèdre</s0><s5>24</s5></fC03><fC03 i1="05" i2="X" l="ENG"><s0>Polyhedron</s0><s5>24</s5></fC03><fC03 i1="05" i2="X" l="SPA"><s0>Poliedro</s0><s5>24</s5></fC03><fN21><s1>346</s1></fN21><fN44 i1="01"><s1>OTO</s1></fN44><fN82><s1>OTO</s1></fN82></pA></standard></inist></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/PascalFrancis/Curation
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000615 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/PascalFrancis/Curation/biblio.hfd -nk 000615 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Lorraine
|area= InforLorV4
|flux= PascalFrancis
|é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. |  |