Analysis of Farthest Point Sampling for Approximating Geodesics in a Graph
Identifieur interne : 000F56 ( Main/Exploration ); précédent : 000F55; suivant : 000F57Analysis of Farthest Point Sampling for Approximating Geodesics in a Graph
Auteurs : Pegah Kamousi [Belgique] ; Sylvain Lazard [France] ; Anil Maheshwari [Canada] ; Stefanie Wuhrer [Allemagne]Source :
Abstract
A standard way to approximate the distance between any two vertices $p$ and $q$ on a mesh is to compute, in the associated graph, a shortest path from $p$ to $q$ that goes through one of $k$ sources, which are well-chosen vertices. Precomputing the distance between each of the $k$ sources to all vertices of the graph yields an efficient computation of approximate distances between any two vertices. One standard method for choosing $k$ sources, which has been used extensively and successfully for isometry-invariant surface processing, is the so-called {\it Farthest Point Sampling} (FPS), which starts with a random vertex as the first source, and iteratively selects the farthest vertex from the already selected sources. In this paper, we analyze the stretch factor $\mathcal{F}_{FPS}$ of approximate geodesics computed using FPS, which is the maximum, over all pairs of distinct vertices, of their approximated distance over their geodesic distance in the graph. We show that $\mathcal{F}_{FPS}$ can be bounded in terms of the minimal value $\mathcal{F}^*$ of the stretch factor obtained using an optimal placement of $k$ sources as $\mathcal{F}_{FPS}\leq 2 r_e^2 \mathcal{F}^*+ 2 r_e^2 + 8 r_e + 1$, where $r_e$ is the ratio of the lengths of the longest and the shortest edges of the graph. This provides some evidence explaining why farthest point sampling has been used successfully for isometry-invariant shape processing. Furthermore, we show that it is NP-complete to find $k$ sources that minimize the stretch factor.
Url:
Affiliations:
Links toward previous steps (curation, corpus...)
- to stream Hal, to step Corpus: 000E45
- to stream Hal, to step Curation: 000E45
- to stream Hal, to step Checkpoint: 000E58
- to stream Main, to step Merge: 000F67
- to stream Main, to step Curation: 000F56
Le document en format XML
<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en">Analysis of Farthest Point Sampling for Approximating Geodesics in a Graph</title>
<author><name sortKey="Kamousi, Pegah" sort="Kamousi, Pegah" uniqKey="Kamousi P" first="Pegah" last="Kamousi">Pegah Kamousi</name>
<affiliation wicri:level="1"><hal:affiliation type="laboratory" xml:id="struct-5591" status="VALID"><orgName>Département d'Informatique [Bruxelles]</orgName>
<orgName type="acronym">ULB</orgName>
<desc><address><addrLine>Campus de la Plaine ULB CP212, boulevard du Triomphe, 1050 Bruxelles</addrLine>
<country key="BE"></country>
</address>
<ref type="url">http://www.ulb.ac.be/facs/sciences/info/</ref>
</desc>
<listRelation><relation active="#struct-92969" type="direct"></relation>
</listRelation>
<tutelles><tutelle active="#struct-92969" type="direct"><org type="institution" xml:id="struct-92969" status="VALID"><orgName>Université Libre de Bruxelles [Bruxelles]</orgName>
<orgName type="acronym">ULB</orgName>
<desc><address><addrLine>Avenue Franklin Roosevelt 50 - 1050 Bruxelles</addrLine>
<country key="BE"></country>
</address>
<ref type="url">http://www.ulb.ac.be</ref>
</desc>
</org>
</tutelle>
</tutelles>
</hal:affiliation>
<country>Belgique</country>
</affiliation>
</author>
<author><name sortKey="Lazard, Sylvain" sort="Lazard, Sylvain" uniqKey="Lazard S" first="Sylvain" last="Lazard">Sylvain Lazard</name>
<affiliation wicri:level="1"><hal:affiliation type="researchteam" xml:id="struct-205129" status="VALID"><idno type="RNSR">200518305E</idno>
<orgName>Effective Geometric Algorithms for Surfaces and Visibility</orgName>
<orgName type="acronym">VEGAS</orgName>
<desc><address><country key="FR"></country>
</address>
<ref type="url">http://www.inria.fr/equipes/vegas</ref>
</desc>
<listRelation><relation active="#struct-129671" type="direct"></relation>
<relation active="#struct-300009" type="indirect"></relation>
<relation active="#struct-423083" type="direct"></relation>
<relation active="#struct-206040" type="indirect"></relation>
<relation active="#struct-413289" type="indirect"></relation>
<relation name="UMR7503" active="#struct-441569" type="indirect"></relation>
</listRelation>
<tutelles><tutelle active="#struct-129671" type="direct"><org type="laboratory" xml:id="struct-129671" status="VALID"><idno type="RNSR">198618246Y</idno>
<orgName>INRIA Nancy - Grand Est</orgName>
<desc><address><addrLine>615 rue du Jardin Botanique 54600 Villers-lès-Nancy</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.inria.fr/nancy</ref>
</desc>
<listRelation><relation active="#struct-300009" type="direct"></relation>
</listRelation>
</org>
</tutelle>
<tutelle active="#struct-300009" type="indirect"><org type="institution" xml:id="struct-300009" status="VALID"><orgName>Institut National de Recherche en Informatique et en Automatique</orgName>
<orgName type="acronym">Inria</orgName>
<desc><address><addrLine>Domaine de VoluceauRocquencourt - BP 10578153 Le Chesnay Cedex</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.inria.fr/en/</ref>
</desc>
</org>
</tutelle>
<tutelle active="#struct-423083" type="direct"><org type="department" xml:id="struct-423083" status="VALID"><orgName>Department of Algorithms, Computation, Image and Geometry</orgName>
<orgName type="acronym">LORIA - ALGO</orgName>
<desc><address><country key="FR"></country>
</address>
<ref type="url">http://www.loria.fr/la-recherche-en/departements/algorithmics</ref>
</desc>
<listRelation><relation active="#struct-206040" type="direct"></relation>
<relation active="#struct-300009" type="indirect"></relation>
<relation active="#struct-413289" type="indirect"></relation>
<relation name="UMR7503" active="#struct-441569" type="indirect"></relation>
</listRelation>
</org>
</tutelle>
<tutelle active="#struct-206040" type="indirect"><org type="laboratory" xml:id="struct-206040" status="VALID"><idno type="IdRef">067077927</idno>
<idno type="RNSR">198912571S</idno>
<idno type="IdUnivLorraine">[UL]RSI--</idno>
<orgName>Laboratoire Lorrain de Recherche en Informatique et ses Applications</orgName>
<orgName type="acronym">LORIA</orgName>
<date type="start">2012-01-01</date>
<desc><address><addrLine>Campus Scientifique BP 239 54506 Vandoeuvre-lès-Nancy Cedex</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.loria.fr</ref>
</desc>
<listRelation><relation active="#struct-300009" type="direct"></relation>
<relation active="#struct-413289" type="direct"></relation>
<relation name="UMR7503" active="#struct-441569" type="direct"></relation>
</listRelation>
</org>
</tutelle>
<tutelle active="#struct-413289" type="indirect"><org type="institution" xml:id="struct-413289" status="VALID"><idno type="IdRef">157040569</idno>
<idno type="IdUnivLorraine">[UL]100--</idno>
<orgName>Université de Lorraine</orgName>
<orgName type="acronym">UL</orgName>
<date type="start">2012-01-01</date>
<desc><address><addrLine>34 cours Léopold - CS 25233 - 54052 Nancy cedex</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.univ-lorraine.fr/</ref>
</desc>
</org>
</tutelle>
<tutelle name="UMR7503" active="#struct-441569" type="indirect"><org type="institution" xml:id="struct-441569" status="VALID"><idno type="ISNI">0000000122597504</idno>
<idno type="IdRef">02636817X</idno>
<orgName>Centre National de la Recherche Scientifique</orgName>
<orgName type="acronym">CNRS</orgName>
<date type="start">1939-10-19</date>
<desc><address><country key="FR"></country>
</address>
<ref type="url">http://www.cnrs.fr/</ref>
</desc>
</org>
</tutelle>
</tutelles>
</hal:affiliation>
<country>France</country>
<placeName><settlement type="city">Nancy</settlement>
<settlement type="city">Metz</settlement>
<region type="region" nuts="2">Grand Est</region>
<region type="old region" nuts="2">Lorraine (région)</region>
</placeName>
<orgName type="university">Université de Lorraine</orgName>
</affiliation>
</author>
<author><name sortKey="Maheshwari, Anil" sort="Maheshwari, Anil" uniqKey="Maheshwari A" first="Anil" last="Maheshwari">Anil Maheshwari</name>
<affiliation wicri:level="1"><hal:affiliation type="laboratory" xml:id="struct-7738" status="VALID"><orgName>School of Computer Science [Ottawa]</orgName>
<desc><address><addrLine>Herzberg Building 1125 Colonel By Drive, Ottawa, Ontario, K1S 5B6 Canada</addrLine>
<country key="CA"></country>
</address>
<ref type="url">http://www.scs.carleton.ca/school/</ref>
</desc>
<listRelation><relation active="#struct-208909" type="direct"></relation>
</listRelation>
<tutelles><tutelle active="#struct-208909" type="direct"><org type="institution" xml:id="struct-208909" status="VALID"><orgName>Carleton University</orgName>
<desc><address><addrLine>1125 Colonel By Drive Ottawa, ON, Canada</addrLine>
<country key="CA"></country>
</address>
<ref type="url">http://www.carleton.ca/</ref>
</desc>
</org>
</tutelle>
</tutelles>
</hal:affiliation>
<country>Canada</country>
</affiliation>
</author>
<author><name sortKey="Wuhrer, Stefanie" sort="Wuhrer, Stefanie" uniqKey="Wuhrer S" first="Stefanie" last="Wuhrer">Stefanie Wuhrer</name>
<affiliation wicri:level="1"><hal:affiliation type="laboratory" xml:id="struct-110922" status="VALID"><orgName>Saarland University [Saarbrücke]</orgName>
<desc><address><addrLine>PF 151150 66041 Saarbrücke</addrLine>
<country key="DE"></country>
</address>
<ref type="url">http://www.uni-saarland.de/en/</ref>
</desc>
<listRelation><relation active="#struct-365003" type="direct"></relation>
</listRelation>
<tutelles><tutelle active="#struct-365003" type="direct"><org type="institution" xml:id="struct-365003" status="INCOMING"><orgName>SAARLAND UNIVERSITY</orgName>
<desc><address><country key="FR"></country>
</address>
</desc>
</org>
</tutelle>
</tutelles>
</hal:affiliation>
<country>Allemagne</country>
</affiliation>
</author>
</titleStmt>
<publicationStmt><idno type="wicri:source">HAL</idno>
<idno type="RBID">Hal:hal-00927643</idno>
<idno type="halId">hal-00927643</idno>
<idno type="halUri">https://hal.inria.fr/hal-00927643</idno>
<idno type="url">https://hal.inria.fr/hal-00927643</idno>
<date when="2013-11">2013-11</date>
<idno type="wicri:Area/Hal/Corpus">000E45</idno>
<idno type="wicri:Area/Hal/Curation">000E45</idno>
<idno type="wicri:Area/Hal/Checkpoint">000E58</idno>
<idno type="wicri:explorRef" wicri:stream="Hal" wicri:step="Checkpoint">000E58</idno>
<idno type="wicri:Area/Main/Merge">000F67</idno>
<idno type="wicri:Area/Main/Curation">000F56</idno>
<idno type="wicri:Area/Main/Exploration">000F56</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title xml:lang="en">Analysis of Farthest Point Sampling for Approximating Geodesics in a Graph</title>
<author><name sortKey="Kamousi, Pegah" sort="Kamousi, Pegah" uniqKey="Kamousi P" first="Pegah" last="Kamousi">Pegah Kamousi</name>
<affiliation wicri:level="1"><hal:affiliation type="laboratory" xml:id="struct-5591" status="VALID"><orgName>Département d'Informatique [Bruxelles]</orgName>
<orgName type="acronym">ULB</orgName>
<desc><address><addrLine>Campus de la Plaine ULB CP212, boulevard du Triomphe, 1050 Bruxelles</addrLine>
<country key="BE"></country>
</address>
<ref type="url">http://www.ulb.ac.be/facs/sciences/info/</ref>
</desc>
<listRelation><relation active="#struct-92969" type="direct"></relation>
</listRelation>
<tutelles><tutelle active="#struct-92969" type="direct"><org type="institution" xml:id="struct-92969" status="VALID"><orgName>Université Libre de Bruxelles [Bruxelles]</orgName>
<orgName type="acronym">ULB</orgName>
<desc><address><addrLine>Avenue Franklin Roosevelt 50 - 1050 Bruxelles</addrLine>
<country key="BE"></country>
</address>
<ref type="url">http://www.ulb.ac.be</ref>
</desc>
</org>
</tutelle>
</tutelles>
</hal:affiliation>
<country>Belgique</country>
</affiliation>
</author>
<author><name sortKey="Lazard, Sylvain" sort="Lazard, Sylvain" uniqKey="Lazard S" first="Sylvain" last="Lazard">Sylvain Lazard</name>
<affiliation wicri:level="1"><hal:affiliation type="researchteam" xml:id="struct-205129" status="VALID"><idno type="RNSR">200518305E</idno>
<orgName>Effective Geometric Algorithms for Surfaces and Visibility</orgName>
<orgName type="acronym">VEGAS</orgName>
<desc><address><country key="FR"></country>
</address>
<ref type="url">http://www.inria.fr/equipes/vegas</ref>
</desc>
<listRelation><relation active="#struct-129671" type="direct"></relation>
<relation active="#struct-300009" type="indirect"></relation>
<relation active="#struct-423083" type="direct"></relation>
<relation active="#struct-206040" type="indirect"></relation>
<relation active="#struct-413289" type="indirect"></relation>
<relation name="UMR7503" active="#struct-441569" type="indirect"></relation>
</listRelation>
<tutelles><tutelle active="#struct-129671" type="direct"><org type="laboratory" xml:id="struct-129671" status="VALID"><idno type="RNSR">198618246Y</idno>
<orgName>INRIA Nancy - Grand Est</orgName>
<desc><address><addrLine>615 rue du Jardin Botanique 54600 Villers-lès-Nancy</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.inria.fr/nancy</ref>
</desc>
<listRelation><relation active="#struct-300009" type="direct"></relation>
</listRelation>
</org>
</tutelle>
<tutelle active="#struct-300009" type="indirect"><org type="institution" xml:id="struct-300009" status="VALID"><orgName>Institut National de Recherche en Informatique et en Automatique</orgName>
<orgName type="acronym">Inria</orgName>
<desc><address><addrLine>Domaine de VoluceauRocquencourt - BP 10578153 Le Chesnay Cedex</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.inria.fr/en/</ref>
</desc>
</org>
</tutelle>
<tutelle active="#struct-423083" type="direct"><org type="department" xml:id="struct-423083" status="VALID"><orgName>Department of Algorithms, Computation, Image and Geometry</orgName>
<orgName type="acronym">LORIA - ALGO</orgName>
<desc><address><country key="FR"></country>
</address>
<ref type="url">http://www.loria.fr/la-recherche-en/departements/algorithmics</ref>
</desc>
<listRelation><relation active="#struct-206040" type="direct"></relation>
<relation active="#struct-300009" type="indirect"></relation>
<relation active="#struct-413289" type="indirect"></relation>
<relation name="UMR7503" active="#struct-441569" type="indirect"></relation>
</listRelation>
</org>
</tutelle>
<tutelle active="#struct-206040" type="indirect"><org type="laboratory" xml:id="struct-206040" status="VALID"><idno type="IdRef">067077927</idno>
<idno type="RNSR">198912571S</idno>
<idno type="IdUnivLorraine">[UL]RSI--</idno>
<orgName>Laboratoire Lorrain de Recherche en Informatique et ses Applications</orgName>
<orgName type="acronym">LORIA</orgName>
<date type="start">2012-01-01</date>
<desc><address><addrLine>Campus Scientifique BP 239 54506 Vandoeuvre-lès-Nancy Cedex</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.loria.fr</ref>
</desc>
<listRelation><relation active="#struct-300009" type="direct"></relation>
<relation active="#struct-413289" type="direct"></relation>
<relation name="UMR7503" active="#struct-441569" type="direct"></relation>
</listRelation>
</org>
</tutelle>
<tutelle active="#struct-413289" type="indirect"><org type="institution" xml:id="struct-413289" status="VALID"><idno type="IdRef">157040569</idno>
<idno type="IdUnivLorraine">[UL]100--</idno>
<orgName>Université de Lorraine</orgName>
<orgName type="acronym">UL</orgName>
<date type="start">2012-01-01</date>
<desc><address><addrLine>34 cours Léopold - CS 25233 - 54052 Nancy cedex</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.univ-lorraine.fr/</ref>
</desc>
</org>
</tutelle>
<tutelle name="UMR7503" active="#struct-441569" type="indirect"><org type="institution" xml:id="struct-441569" status="VALID"><idno type="ISNI">0000000122597504</idno>
<idno type="IdRef">02636817X</idno>
<orgName>Centre National de la Recherche Scientifique</orgName>
<orgName type="acronym">CNRS</orgName>
<date type="start">1939-10-19</date>
<desc><address><country key="FR"></country>
</address>
<ref type="url">http://www.cnrs.fr/</ref>
</desc>
</org>
</tutelle>
</tutelles>
</hal:affiliation>
<country>France</country>
<placeName><settlement type="city">Nancy</settlement>
<settlement type="city">Metz</settlement>
<region type="region" nuts="2">Grand Est</region>
<region type="old region" nuts="2">Lorraine (région)</region>
</placeName>
<orgName type="university">Université de Lorraine</orgName>
</affiliation>
</author>
<author><name sortKey="Maheshwari, Anil" sort="Maheshwari, Anil" uniqKey="Maheshwari A" first="Anil" last="Maheshwari">Anil Maheshwari</name>
<affiliation wicri:level="1"><hal:affiliation type="laboratory" xml:id="struct-7738" status="VALID"><orgName>School of Computer Science [Ottawa]</orgName>
<desc><address><addrLine>Herzberg Building 1125 Colonel By Drive, Ottawa, Ontario, K1S 5B6 Canada</addrLine>
<country key="CA"></country>
</address>
<ref type="url">http://www.scs.carleton.ca/school/</ref>
</desc>
<listRelation><relation active="#struct-208909" type="direct"></relation>
</listRelation>
<tutelles><tutelle active="#struct-208909" type="direct"><org type="institution" xml:id="struct-208909" status="VALID"><orgName>Carleton University</orgName>
<desc><address><addrLine>1125 Colonel By Drive Ottawa, ON, Canada</addrLine>
<country key="CA"></country>
</address>
<ref type="url">http://www.carleton.ca/</ref>
</desc>
</org>
</tutelle>
</tutelles>
</hal:affiliation>
<country>Canada</country>
</affiliation>
</author>
<author><name sortKey="Wuhrer, Stefanie" sort="Wuhrer, Stefanie" uniqKey="Wuhrer S" first="Stefanie" last="Wuhrer">Stefanie Wuhrer</name>
<affiliation wicri:level="1"><hal:affiliation type="laboratory" xml:id="struct-110922" status="VALID"><orgName>Saarland University [Saarbrücke]</orgName>
<desc><address><addrLine>PF 151150 66041 Saarbrücke</addrLine>
<country key="DE"></country>
</address>
<ref type="url">http://www.uni-saarland.de/en/</ref>
</desc>
<listRelation><relation active="#struct-365003" type="direct"></relation>
</listRelation>
<tutelles><tutelle active="#struct-365003" type="direct"><org type="institution" xml:id="struct-365003" status="INCOMING"><orgName>SAARLAND UNIVERSITY</orgName>
<desc><address><country key="FR"></country>
</address>
</desc>
</org>
</tutelle>
</tutelles>
</hal:affiliation>
<country>Allemagne</country>
</affiliation>
</author>
</analytic>
</biblStruct>
</sourceDesc>
</fileDesc>
<profileDesc><textClass></textClass>
</profileDesc>
</teiHeader>
<front><div type="abstract" xml:lang="en">A standard way to approximate the distance between any two vertices $p$ and $q$ on a mesh is to compute, in the associated graph, a shortest path from $p$ to $q$ that goes through one of $k$ sources, which are well-chosen vertices. Precomputing the distance between each of the $k$ sources to all vertices of the graph yields an efficient computation of approximate distances between any two vertices. One standard method for choosing $k$ sources, which has been used extensively and successfully for isometry-invariant surface processing, is the so-called {\it Farthest Point Sampling} (FPS), which starts with a random vertex as the first source, and iteratively selects the farthest vertex from the already selected sources. In this paper, we analyze the stretch factor $\mathcal{F}_{FPS}$ of approximate geodesics computed using FPS, which is the maximum, over all pairs of distinct vertices, of their approximated distance over their geodesic distance in the graph. We show that $\mathcal{F}_{FPS}$ can be bounded in terms of the minimal value $\mathcal{F}^*$ of the stretch factor obtained using an optimal placement of $k$ sources as $\mathcal{F}_{FPS}\leq 2 r_e^2 \mathcal{F}^*+ 2 r_e^2 + 8 r_e + 1$, where $r_e$ is the ratio of the lengths of the longest and the shortest edges of the graph. This provides some evidence explaining why farthest point sampling has been used successfully for isometry-invariant shape processing. Furthermore, we show that it is NP-complete to find $k$ sources that minimize the stretch factor.</div>
</front>
</TEI>
<affiliations><list><country><li>Allemagne</li>
<li>Belgique</li>
<li>Canada</li>
<li>France</li>
</country>
<region><li>Grand Est</li>
<li>Lorraine (région)</li>
</region>
<settlement><li>Metz</li>
<li>Nancy</li>
</settlement>
<orgName><li>Université de Lorraine</li>
</orgName>
</list>
<tree><country name="Belgique"><noRegion><name sortKey="Kamousi, Pegah" sort="Kamousi, Pegah" uniqKey="Kamousi P" first="Pegah" last="Kamousi">Pegah Kamousi</name>
</noRegion>
</country>
<country name="France"><region name="Grand Est"><name sortKey="Lazard, Sylvain" sort="Lazard, Sylvain" uniqKey="Lazard S" first="Sylvain" last="Lazard">Sylvain Lazard</name>
</region>
</country>
<country name="Canada"><noRegion><name sortKey="Maheshwari, Anil" sort="Maheshwari, Anil" uniqKey="Maheshwari A" first="Anil" last="Maheshwari">Anil Maheshwari</name>
</noRegion>
</country>
<country name="Allemagne"><noRegion><name sortKey="Wuhrer, Stefanie" sort="Wuhrer, Stefanie" uniqKey="Wuhrer S" first="Stefanie" last="Wuhrer">Stefanie Wuhrer</name>
</noRegion>
</country>
</tree>
</affiliations>
</record>
Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Main/Exploration
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000F56 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 000F56 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien |wiki= Wicri/Lorraine |area= InforLorV4 |flux= Main |étape= Exploration |type= RBID |clé= Hal:hal-00927643 |texte= Analysis of Farthest Point Sampling for Approximating Geodesics in a Graph }}
![]() | This area was generated with Dilib version V0.6.33. | ![]() |