Hierarchical Vertical Decompositions, Ray Shooting, and Circular Arc Queries in Simple Polygons
Identifieur interne : 002778 ( Hal/Corpus ); précédent : 002777; suivant : 002779Hierarchical Vertical Decompositions, Ray Shooting, and Circular Arc Queries in Simple Polygons
Auteurs : Siu-Wing Cheng ; Otfried Cheong ; Hazel Everett ; Rene Van OostrumSource :
Descripteurs français
- mix :
Abstract
A new hierarchical decomposition of a simple polygon in introduced. The hierarchy has depth O(log n), linear size, and its regions have maximum degree three. Using this hierarchy, circular ray shooting queries in a simple polygon can be answered in O(log^2n) query time and O(nlogn) space. If the radius of the circle is fixed, the query time can be improved to O(logn) and the space to O(n). The decomposition is also applied to three other circular arc query problems: shortest directed arc, arc bending, and arc pushing. Using these queries, the largest empty lune determined by two query points in a simple polygon can be computed in O(log^3n) time, while the circular visibility region of a query point in a simple polygon can be reported in time O(mlog^3n), where m is the output size.
Url:
Links to Exploration step
Hal:inria-00108058Le document en format XML
<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en">Hierarchical Vertical Decompositions, Ray Shooting, and Circular Arc Queries in Simple Polygons</title><author><name sortKey="Cheng, Siu Wing" sort="Cheng, Siu Wing" uniqKey="Cheng S" first="Siu-Wing" last="Cheng">Siu-Wing Cheng</name></author><author><name sortKey="Cheong, Otfried" sort="Cheong, Otfried" uniqKey="Cheong O" first="Otfried" last="Cheong">Otfried Cheong</name></author><author><name sortKey="Everett, Hazel" sort="Everett, Hazel" uniqKey="Everett H" first="Hazel" last="Everett">Hazel Everett</name><affiliation><hal:affiliation type="researchteam" xml:id="struct-2350" status="OLD"><idno type="RNSR">199521440F</idno><orgName>Models, algorithms and geometry for computer graphics and vision</orgName><orgName type="acronym">ISA</orgName><desc><address><country key="FR"></country></address><ref type="url">http://www.inria.fr/equipes/isa</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><author><name sortKey="Van Oostrum, Rene" sort="Van Oostrum, Rene" uniqKey="Van Oostrum R" first="Rene" last="Van Oostrum">Rene Van Oostrum</name></author></titleStmt><publicationStmt><idno type="wicri:source">HAL</idno><idno type="RBID">Hal:inria-00108058</idno><idno type="halId">inria-00108058</idno><idno type="halUri">https://hal.inria.fr/inria-00108058</idno><idno type="url">https://hal.inria.fr/inria-00108058</idno><date when="1999">1999</date><idno type="wicri:Area/Hal/Corpus">002778</idno></publicationStmt><sourceDesc><biblStruct><analytic><title xml:lang="en">Hierarchical Vertical Decompositions, Ray Shooting, and Circular Arc Queries in Simple Polygons</title><author><name sortKey="Cheng, Siu Wing" sort="Cheng, Siu Wing" uniqKey="Cheng S" first="Siu-Wing" last="Cheng">Siu-Wing Cheng</name></author><author><name sortKey="Cheong, Otfried" sort="Cheong, Otfried" uniqKey="Cheong O" first="Otfried" last="Cheong">Otfried Cheong</name></author><author><name sortKey="Everett, Hazel" sort="Everett, Hazel" uniqKey="Everett H" first="Hazel" last="Everett">Hazel Everett</name><affiliation><hal:affiliation type="researchteam" xml:id="struct-2350" status="OLD"><idno type="RNSR">199521440F</idno><orgName>Models, algorithms and geometry for computer graphics and vision</orgName><orgName type="acronym">ISA</orgName><desc><address><country key="FR"></country></address><ref type="url">http://www.inria.fr/equipes/isa</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><author><name sortKey="Van Oostrum, Rene" sort="Van Oostrum, Rene" uniqKey="Van Oostrum R" first="Rene" last="Van Oostrum">Rene Van Oostrum</name></author></analytic></biblStruct></sourceDesc></fileDesc><profileDesc><textClass><keywords scheme="mix" xml:lang="fr"><term>décomposition hièrarchique</term><term>hierarchical decomposition</term><term>lancer de rayons</term><term>ray shooting</term><term>visibility</term><term>visibilité</term></keywords></textClass></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">A new hierarchical decomposition of a simple polygon in introduced. The hierarchy has depth O(log n), linear size, and its regions have maximum degree three. Using this hierarchy, circular ray shooting queries in a simple polygon can be answered in O(log^2n) query time and O(nlogn) space. If the radius of the circle is fixed, the query time can be improved to O(logn) and the space to O(n). The decomposition is also applied to three other circular arc query problems: shortest directed arc, arc bending, and arc pushing. Using these queries, the largest empty lune determined by two query points in a simple polygon can be computed in O(log^3n) time, while the circular visibility region of a query point in a simple polygon can be reported in time O(mlog^3n), where m is the output size.</div></front></TEI><hal api="V3"><titleStmt><title xml:lang="en">Hierarchical Vertical Decompositions, Ray Shooting, and Circular Arc Queries in Simple Polygons</title><author role="aut"><persName><forename type="first">Siu-Wing</forename><surname>Cheng</surname></persName><email></email><idno type="halauthor">139114</idno><orgName ref="#struct-365389"></orgName></author><author role="aut"><persName><forename type="first">Otfried</forename><surname>Cheong</surname></persName><email></email><idno type="halauthor">139115</idno><orgName ref="#struct-365389"></orgName></author><author role="aut"><persName><forename type="first">Hazel</forename><surname>Everett</surname></persName><email>Hazel.Everett@loria.fr</email><idno type="halauthor">139116</idno><orgName ref="#struct-206040"></orgName><affiliation ref="#struct-2350"></affiliation></author><author role="aut"><persName><forename type="first">Rene</forename><surname>Van Oostrum</surname></persName><email></email><idno type="halauthor">139117</idno><orgName ref="#struct-365390"></orgName></author><editor role="depositor"><persName><forename>Publications</forename><surname>Loria</surname></persName><email>publications@loria.fr</email></editor></titleStmt><editionStmt><edition n="v1" type="current"><date type="whenSubmitted">2006-10-19 15:40:33</date><date type="whenModified">2016-05-19 01:09:12</date><date type="whenReleased">2006-10-24 12:08:59</date><date type="whenProduced">1999</date></edition><respStmt><resp>contributor</resp><name key="108626"><persName><forename>Publications</forename><surname>Loria</surname></persName><email>publications@loria.fr</email></name></respStmt></editionStmt><publicationStmt><distributor>CCSD</distributor><idno type="halId">inria-00108058</idno><idno type="halUri">https://hal.inria.fr/inria-00108058</idno><idno type="halBibtex">cheng:inria-00108058</idno><idno type="halRefHtml">ACM Symposium on Computational Geometry, 1999, Miami Beach, Florida, USA, pp.227-236, 1999</idno><idno type="halRef">ACM Symposium on Computational Geometry, 1999, Miami Beach, Florida, USA, pp.227-236, 1999</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="LORIA">LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications</idno><idno type="stamp" n="INRIA-NANCY-GRAND-EST">INRIA Nancy - Grand Est</idno><idno type="stamp" n="UNIV-LORRAINE">Université de Lorraine</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></seriesStmt><notesStmt><note type="commentary">Colloque avec actes et comité de lecture.</note><note type="audience" n="1">Not set</note><note type="invited" n="0">No</note><note type="popular" n="0">No</note><note type="peer" n="1">Yes</note><note type="proceedings" n="1">Yes</note></notesStmt><sourceDesc><biblStruct><analytic><title xml:lang="en">Hierarchical Vertical Decompositions, Ray Shooting, and Circular Arc Queries in Simple Polygons</title><author role="aut"><persName><forename type="first">Siu-Wing</forename><surname>Cheng</surname></persName><idno type="halAuthorId">139114</idno><orgName ref="#struct-365389"></orgName></author><author role="aut"><persName><forename type="first">Otfried</forename><surname>Cheong</surname></persName><idno type="halAuthorId">139115</idno><orgName ref="#struct-365389"></orgName></author><author role="aut"><persName><forename type="first">Hazel</forename><surname>Everett</surname></persName><email>Hazel.Everett@loria.fr</email><idno type="halAuthorId">139116</idno><orgName ref="#struct-206040"></orgName><affiliation ref="#struct-2350"></affiliation></author><author role="aut"><persName><forename type="first">Rene</forename><surname>Van Oostrum</surname></persName><idno type="halAuthorId">139117</idno><orgName ref="#struct-365390"></orgName></author></analytic><monogr><idno type="localRef">99-R-287 || cheng99a</idno><meeting><title>ACM Symposium on Computational Geometry</title><date type="start">1999</date><settlement>Miami Beach, Florida, USA</settlement></meeting><respStmt><resp>conferenceOrganizer</resp><name>Association for Computing Machinery</name></respStmt><imprint><biblScope unit="pp">227-236</biblScope><date type="datePub">1999</date></imprint></monogr></biblStruct></sourceDesc><profileDesc><langUsage><language ident="en">English</language></langUsage><textClass><keywords scheme="author"><term xml:lang="fr">lancer de rayons</term><term xml:lang="fr">hierarchical decomposition</term><term xml:lang="fr">ray shooting</term><term xml:lang="fr">visibility</term><term xml:lang="fr">visibilité</term><term xml:lang="fr">décomposition hièrarchique</term></keywords><classCode scheme="halDomain" n="info.info-oh">Computer Science [cs]/Other [cs.OH]</classCode><classCode scheme="halTypology" n="COMM">Conference papers</classCode></textClass><abstract xml:lang="en">A new hierarchical decomposition of a simple polygon in introduced. The hierarchy has depth O(log n), linear size, and its regions have maximum degree three. Using this hierarchy, circular ray shooting queries in a simple polygon can be answered in O(log^2n) query time and O(nlogn) space. If the radius of the circle is fixed, the query time can be improved to O(logn) and the space to O(n). The decomposition is also applied to three other circular arc query problems: shortest directed arc, arc bending, and arc pushing. Using these queries, the largest empty lune determined by two query points in a simple polygon can be computed in O(log^3n) time, while the circular visibility region of a query point in a simple polygon can be reported in time O(mlog^3n), where m is the output size.</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 002778 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Hal/Corpus/biblio.hfd -nk 002778 | 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:inria-00108058
|texte= Hierarchical Vertical Decompositions, Ray Shooting, and Circular Arc Queries in Simple Polygons
}}
| This area was generated with Dilib version V0.6.33. |  |