Boundary evaluation of scenes defined by quadrics
Identifieur interne : 001289 ( Hal/Corpus ); précédent : 001288; suivant : 001290Boundary evaluation of scenes defined by quadrics
Auteurs : Maria PentchevaSource :
Descripteurs français
English descriptors
Abstract
The objective of this thesis is to investigate the problem of boundary evaluation for scenes defined by quadrics. This algorithm consists of four steps : (i) the parameterization of every intersection curve between quadrics ; (ii) the calculation of the intersection points between such curves and the quadrics ; (iii) the determination, among the resulting arcs of curves of those that limit a face of the BRep model; (iv) the identification of the arcs that delimit a singe face, and their assembling into chains of arcs ; some faces might contain <>, and thus may be limited by several chains of arcs. The first two steps were solved using two algorithms from the litterature. The two remaining steps were solved by introducing new algorithms : VE (Visible Edges) and CA (Chains Assembling) respectively. Our algorithm of boundary evaluation is robust in the sense that all degenerate configurations are considered in the paradigm of exact geometric computing. Il solves entirely the problem for scenes defined by quadrics. Its time-complexity id $O(n^4)$ in the worst case, where $n$ is the number of quadrics. A partial implementation was developed and preliminary experimental results were obtained.
Url:
Links to Exploration step
Hal:tel-00540015Le document en format XML
<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en">Boundary evaluation of scenes defined by quadrics</title><title xml:lang="fr">Conversion CSG-BRep de scènes définies par des quadriques</title><author><name sortKey="Pentcheva, Maria" sort="Pentcheva, Maria" uniqKey="Pentcheva M" first="Maria" last="Pentcheva">Maria Pentcheva</name><affiliation><hal:affiliation type="researchteam" xml:id="struct-2573" status="OLD"><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-160" type="direct"></relation><relation name="UMR7503" active="#struct-441569" type="indirect"></relation><relation active="#struct-300009" type="indirect"></relation><relation active="#struct-300291" type="indirect"></relation><relation active="#struct-300292" type="indirect"></relation><relation active="#struct-300293" type="indirect"></relation><relation active="#struct-2496" type="direct"></relation></listRelation><tutelles><tutelle active="#struct-160" type="direct"><org type="laboratory" xml:id="struct-160" status="OLD"><orgName>Laboratoire Lorrain de Recherche en Informatique et ses Applications</orgName><orgName type="acronym">LORIA</orgName><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 name="UMR7503" active="#struct-441569" type="direct"></relation><relation active="#struct-300009" type="direct"></relation><relation active="#struct-300291" type="direct"></relation><relation active="#struct-300292" type="direct"></relation><relation active="#struct-300293" type="direct"></relation></listRelation></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><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-300291" type="indirect"><org type="institution" xml:id="struct-300291" status="OLD"><orgName>Université Henri Poincaré - Nancy 1</orgName><orgName type="acronym">UHP</orgName><date type="end">2011-12-31</date><desc><address><addrLine>24-30 rue Lionnois, BP 60120, 54 003 NANCY cedex, France</addrLine><country key="FR"></country></address></desc></org></tutelle><tutelle active="#struct-300292" type="indirect"><org type="institution" xml:id="struct-300292" status="OLD"><orgName>Université Nancy 2</orgName><date type="end">2011-12-31</date><desc><address><addrLine>91 avenue de la Libération, BP 454, 54001 Nancy cedex</addrLine><country key="FR"></country></address></desc></org></tutelle><tutelle active="#struct-300293" type="indirect"><org type="institution" xml:id="struct-300293" status="OLD"><orgName>Institut National Polytechnique de Lorraine</orgName><orgName type="acronym">INPL</orgName><date type="end">2011-12-31</date><desc><address><country key="FR"></country></address></desc></org></tutelle><tutelle active="#struct-2496" type="direct"><org type="laboratory" xml:id="struct-2496" status="OLD"><orgName>INRIA Lorraine</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/centre-de-recherche-inria/nancy-grand-est</ref></desc><listRelation><relation active="#struct-300009" type="direct"></relation></listRelation></org></tutelle></tutelles></hal:affiliation></affiliation></author></titleStmt><publicationStmt><idno type="wicri:source">HAL</idno><idno type="RBID">Hal:tel-00540015</idno><idno type="halId">tel-00540015</idno><idno type="halUri">https://tel.archives-ouvertes.fr/tel-00540015</idno><idno type="url">https://tel.archives-ouvertes.fr/tel-00540015</idno><date when="2010-09-30">2010-09-30</date><idno type="wicri:Area/Hal/Corpus">001289</idno></publicationStmt><sourceDesc><biblStruct><analytic><title xml:lang="en">Boundary evaluation of scenes defined by quadrics</title><title xml:lang="fr">Conversion CSG-BRep de scènes définies par des quadriques</title><author><name sortKey="Pentcheva, Maria" sort="Pentcheva, Maria" uniqKey="Pentcheva M" first="Maria" last="Pentcheva">Maria Pentcheva</name><affiliation><hal:affiliation type="researchteam" xml:id="struct-2573" status="OLD"><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-160" type="direct"></relation><relation name="UMR7503" active="#struct-441569" type="indirect"></relation><relation active="#struct-300009" type="indirect"></relation><relation active="#struct-300291" type="indirect"></relation><relation active="#struct-300292" type="indirect"></relation><relation active="#struct-300293" type="indirect"></relation><relation active="#struct-2496" type="direct"></relation></listRelation><tutelles><tutelle active="#struct-160" type="direct"><org type="laboratory" xml:id="struct-160" status="OLD"><orgName>Laboratoire Lorrain de Recherche en Informatique et ses Applications</orgName><orgName type="acronym">LORIA</orgName><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 name="UMR7503" active="#struct-441569" type="direct"></relation><relation active="#struct-300009" type="direct"></relation><relation active="#struct-300291" type="direct"></relation><relation active="#struct-300292" type="direct"></relation><relation active="#struct-300293" type="direct"></relation></listRelation></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><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-300291" type="indirect"><org type="institution" xml:id="struct-300291" status="OLD"><orgName>Université Henri Poincaré - Nancy 1</orgName><orgName type="acronym">UHP</orgName><date type="end">2011-12-31</date><desc><address><addrLine>24-30 rue Lionnois, BP 60120, 54 003 NANCY cedex, France</addrLine><country key="FR"></country></address></desc></org></tutelle><tutelle active="#struct-300292" type="indirect"><org type="institution" xml:id="struct-300292" status="OLD"><orgName>Université Nancy 2</orgName><date type="end">2011-12-31</date><desc><address><addrLine>91 avenue de la Libération, BP 454, 54001 Nancy cedex</addrLine><country key="FR"></country></address></desc></org></tutelle><tutelle active="#struct-300293" type="indirect"><org type="institution" xml:id="struct-300293" status="OLD"><orgName>Institut National Polytechnique de Lorraine</orgName><orgName type="acronym">INPL</orgName><date type="end">2011-12-31</date><desc><address><country key="FR"></country></address></desc></org></tutelle><tutelle active="#struct-2496" type="direct"><org type="laboratory" xml:id="struct-2496" status="OLD"><orgName>INRIA Lorraine</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/centre-de-recherche-inria/nancy-grand-est</ref></desc><listRelation><relation active="#struct-300009" type="direct"></relation></listRelation></org></tutelle></tutelles></hal:affiliation></affiliation></author></analytic></biblStruct></sourceDesc></fileDesc><profileDesc><textClass><keywords scheme="mix" xml:lang="en"><term>boundary evaluation</term><term>computational geometry</term><term>exact computation</term><term>quadric</term></keywords><keywords scheme="mix" xml:lang="fr"><term>calcul exact</term><term>conversion CSG-BRep</term><term>géométrie algorithmique</term><term>quadrique</term></keywords></textClass></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">The objective of this thesis is to investigate the problem of boundary evaluation for scenes defined by quadrics. This algorithm consists of four steps : (i) the parameterization of every intersection curve between quadrics ; (ii) the calculation of the intersection points between such curves and the quadrics ; (iii) the determination, among the resulting arcs of curves of those that limit a face of the BRep model; (iv) the identification of the arcs that delimit a singe face, and their assembling into chains of arcs ; some faces might contain <>, and thus may be limited by several chains of arcs. The first two steps were solved using two algorithms from the litterature. The two remaining steps were solved by introducing new algorithms : VE (Visible Edges) and CA (Chains Assembling) respectively. Our algorithm of boundary evaluation is robust in the sense that all degenerate configurations are considered in the paradigm of exact geometric computing. Il solves entirely the problem for scenes defined by quadrics. Its time-complexity id $O(n^4)$ in the worst case, where $n$ is the number of quadrics. A partial implementation was developed and preliminary experimental results were obtained.</div></front></TEI><hal api="V3"><titleStmt><title xml:lang="en">Boundary evaluation of scenes defined by quadrics</title><title xml:lang="fr">Conversion CSG-BRep de scènes définies par des quadriques</title><author role="aut"><persName><forename type="first">Maria</forename><surname>Pentcheva</surname></persName><email>maria.pentcheva@loria.fr</email><idno type="halauthor">59785</idno><affiliation ref="#struct-2573"></affiliation></author><editor role="depositor"><persName><forename>Maria</forename><surname>Pentcheva</surname></persName><email>mariapentcheva@yahoo.fr</email></editor></titleStmt><editionStmt><edition n="v1"><date type="whenSubmitted">2010-11-25 23:24:10</date></edition><edition n="v2" type="current"><date type="whenSubmitted">2011-07-12 11:12:15</date><date type="whenModified">2016-05-19 01:14:10</date><date type="whenReleased">2011-07-12 15:08:21</date><date type="whenProduced">2010-09-30</date><date type="whenEndEmbargoed">2011-07-12</date><ref type="file" target="https://tel.archives-ouvertes.fr/tel-00540015v2/document"><date notBefore="2011-07-12"></date></ref><ref type="file" n="1" target="https://tel.archives-ouvertes.fr/tel-00540015/file/PhD_Maria.pdf"><date notBefore="2011-07-12"></date></ref></edition><respStmt><resp>contributor</resp><name key="103284"><persName><forename>Maria</forename><surname>Pentcheva</surname></persName><email>mariapentcheva@yahoo.fr</email></name></respStmt></editionStmt><publicationStmt><distributor>CCSD</distributor><idno type="halId">tel-00540015</idno><idno type="halUri">https://tel.archives-ouvertes.fr/tel-00540015</idno><idno type="halBibtex">pentcheva:tel-00540015</idno><idno type="halRefHtml">Informatique [cs]. Université Nancy II, 2010. Français</idno><idno type="halRef">Informatique [cs]. Université Nancy II, 2010. Français</idno></publicationStmt><seriesStmt><idno type="stamp" n="CNRS">CNRS - Centre national de la recherche scientifique</idno><idno type="stamp" n="INRIA">INRIA - Institut National de Recherche en Informatique et en Automatique</idno><idno type="stamp" n="INPL">Institut National Polytechnique de Lorraine</idno><idno type="stamp" n="LORIA2">Publications du LORIA</idno><idno type="stamp" n="INRIA-NANCY-GRAND-EST">INRIA Nancy - Grand Est</idno><idno type="stamp" n="LORIA-ACGI" p="LORIA">Algorithmique, calcul, image et géométrie</idno><idno type="stamp" n="LORIA">LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications</idno><idno type="stamp" n="INRIA2">INRIA 2</idno><idno type="stamp" n="INRIA-LORRAINE">INRIA Nancy - Grand Est</idno><idno type="stamp" n="LABO-LORIA-SET" p="LORIA">LABO-LORIA-SET</idno><idno type="stamp" n="UNIV-LORRAINE">Université de Lorraine</idno></seriesStmt><notesStmt></notesStmt><sourceDesc><biblStruct><analytic><title xml:lang="en">Boundary evaluation of scenes defined by quadrics</title><title xml:lang="fr">Conversion CSG-BRep de scènes définies par des quadriques</title><author role="aut"><persName><forename type="first">Maria</forename><surname>Pentcheva</surname></persName><email>maria.pentcheva@loria.fr</email><idno type="halAuthorId">59785</idno><affiliation ref="#struct-2573"></affiliation></author></analytic><monogr><imprint><date type="dateDefended">2010-09-30</date></imprint><authority type="institution">Université Nancy II</authority><authority type="school">Ecole Doctorale IAEM Lorraine</authority><authority type="supervisor">Sylvain Lazard(sylvain.lazard@loria.fr)</authority><authority type="jury">Bernard Lacolle (rapporteur)</authority><authority type="jury">Monique Teillaud (rapporteur)</authority><authority type="jury">Raphaëlle Chaine (examinateur)</authority><authority type="jury">Sebti Foufou (examinateur)</authority><authority type="jury">Jens Gustedt (examinateur)</authority><authority type="jury">Sylvain Lazard (examinateur)</authority><authority type="jury">Sylvain Petitjean (examinateur)</authority><authority type="jury">Salvatore-Antoine Tabbone (examinateur)</authority></monogr></biblStruct></sourceDesc><profileDesc><langUsage><language ident="fr">French</language></langUsage><textClass><keywords scheme="author"><term xml:lang="en">computational geometry</term><term xml:lang="en">boundary evaluation</term><term xml:lang="en">quadric</term><term xml:lang="en">exact computation</term><term xml:lang="fr">géométrie algorithmique</term><term xml:lang="fr">conversion CSG-BRep</term><term xml:lang="fr">quadrique</term><term xml:lang="fr">calcul exact</term></keywords><classCode scheme="halDomain" n="info">Computer Science [cs]</classCode><classCode scheme="halTypology" n="THESE">Theses</classCode></textClass><abstract xml:lang="en">The objective of this thesis is to investigate the problem of boundary evaluation for scenes defined by quadrics. This algorithm consists of four steps : (i) the parameterization of every intersection curve between quadrics ; (ii) the calculation of the intersection points between such curves and the quadrics ; (iii) the determination, among the resulting arcs of curves of those that limit a face of the BRep model; (iv) the identification of the arcs that delimit a singe face, and their assembling into chains of arcs ; some faces might contain <>, and thus may be limited by several chains of arcs. The first two steps were solved using two algorithms from the litterature. The two remaining steps were solved by introducing new algorithms : VE (Visible Edges) and CA (Chains Assembling) respectively. Our algorithm of boundary evaluation is robust in the sense that all degenerate configurations are considered in the paradigm of exact geometric computing. Il solves entirely the problem for scenes defined by quadrics. Its time-complexity id $O(n^4)$ in the worst case, where $n$ is the number of quadrics. A partial implementation was developed and preliminary experimental results were obtained.</abstract><abstract xml:lang="fr">L'objet de cette thèse porte sur la conversion d'un modèle CSG vers un modèle BRep d'une scène définie par des quadriques. Cet algorithme est composé de quatre étapes : (i) le paramétrage de chaque courbe d'intersection entre quadriques ; (ii) la détermination des points d'intersection entre au moins trois quadriques ; (iii) la détection des segments ainsi obtenus qui bornent une face du modèle BRep sur chacune des quadriques séparément ; (iv) l'identification et le regroupement des chaînes de segments qui délimitent une même face sur chaque quadrique séparément (certaines faces peuvent avoir des <>, et par conséquent être constituées par au moins deux chaînes de segments). Les deux premières étapes ont été résolues grâce à deux algorithmes de la littérature. Les deux étapes restantes sont traitées par des algorithmes que nous avons conçus : respectivement VE (Visible Edges) et CA (Chains Assembling). Notre algorithme est robuste au sens où tous les cas dégénérés sont traités dans le paradigme du calcul géométrique exact. Il résout intégralement le problème de conversion CSG-BRep de scènes définies par des quadriques. Sa complexité dans le pire des cas s'élève à $O(n^4)$ où $n$ est le nombre de quadriques. Une implantation partielle a été effectuée et des tests préliminaires réalisés.</abstract></profileDesc></hal></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Hal/Corpus
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 001289 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Hal/Corpus/biblio.hfd -nk 001289 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Lorraine
|area= InforLorV4
|flux= Hal
|étape= Corpus
|type= RBID
|clé= Hal:tel-00540015
|texte= Boundary evaluation of scenes defined by quadrics
}}
| This area was generated with Dilib version V0.6.33. |  |