Farthest-Polygon Voronoi Diagrams

Otfried Cheong; Hazel Everett; Marc Glisse; Joachim Gudmundsson; Samuel Hornus; Sylvain Lazard; Mira Lee; Hyeon-Suk Na

inria-00189038, version 1

Farthest-Polygon Voronoi Diagrams

Otfried Cheong ¹, Hazel Everett ()^a^, 2, Marc Glisse ()^a^, 2, Joachim Gudmundsson^b^, 3, Samuel Hornus^c^, 1, Sylvain Lazard ()^d^, 2, Mira Lee^c^, 1, Hyeon-Suk Na^e^, 3

15th Annual European Symposium on Algorithms - ALGO 2007 LNCS 4698/2007 (2007) 407-418

Résumé : Given a family of k disjoint connected polygonal sites of total complexity n, we consider the farthest-site Voronoi diagram of these sites, where the distance to a site is the distance to a closest point on it. We show that the complexity of this diagram is O(n), and give an O(n log^3 n) time algorithm to compute it.

a – Université Nancy II
b – Soongsil University
c – KAIST
d – INRIA
e – Soongsil University, Seoul
1 : Department of Electrical Engineering [Korea Advanced Institute of Science and Technology] (KAIST)
Korea Advanced Institute of Science and Technology
2 : VEGAS (INRIA Lorraine - LORIA)
INRIA – CNRS : UMR7503 – Université Henri Poincaré - Nancy I – Université Nancy II – Institut National Polytechnique de Lorraine (INPL)
3 : School of Computing - Soongsil University, Séoul
Soongsil University, Seoul

inria-00189038, version 1
http://hal.inria.fr/inria-00189038
oai:hal.inria.fr:inria-00189038
Contributeur : Sylvain Lazard <>
Soumis le : Lundi 19 Novembre 2007, 18:56:33
Dernière modification le : Dimanche 20 Décembre 2009, 15:08:55

Voir la fiche détaillée

Documents associés

PDF :

DOI : 10.1007/978-3-540-75520-3_37

Exporter

Bibtex EndNote TEI RefWorks

<?xml version="1.0" encoding="UTF-8"?>
<listBibl xmlns="http://www.tei-c.org/ns/1.0" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:mml="http://www.w3.org/1998/Math/MathML">
<listBibl type="inproceedings"><head>Communications avec actes</head>
<biblStruct type="inproceedings" xml:id="inria-00189038"><analytic>
<author><persName><forename>Otfried</forename><surname>Cheong</surname></persName>
<affiliation>
<orgName type="laboratory">KAIST</orgName>
<orgName type="team">Department of Electrical Engineering [Korea Advanced Institute of Science and Technology]</orgName>
<country>KR</country>
<orgName type="institution">Korea Advanced Institute of Science and Technology</orgName>
</affiliation>
</author>
<author><persName><forename>Hazel</forename><surname>Everett</surname></persName>
<affiliation>
<orgName type="laboratory">INRIA Lorraine - LORIA</orgName>
<orgName type="team">VEGAS</orgName>
<country>FR</country>
<orgName type="institution">INRIA</orgName>
<orgName type="institution">CNRS : UMR7503</orgName>
<orgName type="institution">Université Henri Poincaré - Nancy I</orgName>
<orgName type="institution">Université Nancy II</orgName>
<orgName type="institution">Institut National Polytechnique de Lorraine (INPL)</orgName>
</affiliation>
</author>
<author><persName><forename>Marc</forename><surname>Glisse</surname></persName>
<affiliation>
<orgName type="laboratory">INRIA Lorraine - LORIA</orgName>
<orgName type="team">VEGAS</orgName>
<country>FR</country>
<orgName type="institution">INRIA</orgName>
<orgName type="institution">CNRS : UMR7503</orgName>
<orgName type="institution">Université Henri Poincaré - Nancy I</orgName>
<orgName type="institution">Université Nancy II</orgName>
<orgName type="institution">Institut National Polytechnique de Lorraine (INPL)</orgName>
</affiliation>
</author>
<author><persName><forename>Joachim</forename><surname>Gudmundsson</surname></persName>
<affiliation>
<orgName type="team">School of Computing - Soongsil University, Séoul</orgName>
<country>KR</country>
<orgName type="institution">Soongsil University, Seoul</orgName>
</affiliation>
</author>
<author><persName><forename>Samuel</forename><surname>Hornus</surname></persName>
<affiliation>
<orgName type="laboratory">KAIST</orgName>
<orgName type="team">Department of Electrical Engineering [Korea Advanced Institute of Science and Technology]</orgName>
<country>KR</country>
<orgName type="institution">Korea Advanced Institute of Science and Technology</orgName>
</affiliation>
</author>
<author><persName><forename>Sylvain</forename><surname>Lazard</surname></persName>
<affiliation>
<orgName type="laboratory">INRIA Lorraine - LORIA</orgName>
<orgName type="team">VEGAS</orgName>
<country>FR</country>
<orgName type="institution">INRIA</orgName>
<orgName type="institution">CNRS : UMR7503</orgName>
<orgName type="institution">Université Henri Poincaré - Nancy I</orgName>
<orgName type="institution">Université Nancy II</orgName>
<orgName type="institution">Institut National Polytechnique de Lorraine (INPL)</orgName>
</affiliation>
</author>
<author><persName><forename>Mira</forename><surname>Lee</surname></persName>
<affiliation>
<orgName type="laboratory">KAIST</orgName>
<orgName type="team">Department of Electrical Engineering [Korea Advanced Institute of Science and Technology]</orgName>
<country>KR</country>
<orgName type="institution">Korea Advanced Institute of Science and Technology</orgName>
</affiliation>
</author>
<author><persName><forename>Hyeon-Suk</forename><surname>Na</surname></persName>
<affiliation>
<orgName type="team">School of Computing - Soongsil University, Séoul</orgName>
<country>KR</country>
<orgName type="institution">Soongsil University, Seoul</orgName>
</affiliation>
</author>
<title type="main" level="a">Farthest-Polygon Voronoi Diagrams</title></analytic><monogr><meeting>15th Annual European Symposium on Algorithms - ALGO 2007</meeting><imprint><publisher>Springer Berlin / Heidelberg</publisher><pubPlace><settlement>Eilat</settlement><country>Israël</country></pubPlace><biblScope type="publicationDate">2007-00-00</biblScope><biblScope type="vol">LNCS 4698/2007</biblScope><biblScope type="pp">407-418</biblScope></imprint></monogr><idno type="doi">10.1007/978-3-540-75520-3_37</idno><idno type="HALid">http://hal.inria.fr/inria-00189038</idno><idno type="HALFile">http://hal.inria.fr/inria-00189038/PDF/ESA.pdf</idno></biblStruct>
</listBibl>
</listBibl>