InforLorV4, Istex, Corpus, bibRecord, 001724

Farthest-Polygon Voronoi Diagrams

Identifieur interne : 001724 ( Istex/Corpus ); précédent : 001723; suivant : 001725

Farthest-Polygon Voronoi Diagrams

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

Source :

Lecture Notes in Computer Science [ 0302-9743 ]

RBID : ISTEX:63B6B696DA9C87DCC8A49D4DF4E297EB0AEB9E05

Abstract

Abstract: 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 log3 n) time algorithm to compute it.

Url:

https://api.istex.fr/ark:/67375/HCB-0CL3CNSL-4/fulltext.pdf

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

Links to Exploration step

ISTEX:63B6B696DA9C87DCC8A49D4DF4E297EB0AEB9E05

Le document en format XML

<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Farthest-Polygon Voronoi Diagrams</title>
<author><name sortKey="Cheong, Otfried" sort="Cheong, Otfried" uniqKey="Cheong O" first="Otfried" last="Cheong">Otfried Cheong</name>
<affiliation><mods:affiliation>Dept. of Computer Science, KAIST, Daejeon, Korea</mods:affiliation>
</affiliation>
<affiliation><mods:affiliation>E-mail: otfried@tclab.kaist.ac.kr</mods:affiliation>
</affiliation>
</author>
<author><name sortKey="Everett, Hazel" sort="Everett, Hazel" uniqKey="Everett H" first="Hazel" last="Everett">Hazel Everett</name>
<affiliation><mods:affiliation>LORIA – INRIA Lorraine, Université Nancy 2, Nancy, France</mods:affiliation>
</affiliation>
<affiliation><mods:affiliation>E-mail: Hazel.Name@loria.fr</mods:affiliation>
</affiliation>
</author>
<author><name sortKey="Glisse, Marc" sort="Glisse, Marc" uniqKey="Glisse M" first="Marc" last="Glisse">Marc Glisse</name>
<affiliation><mods:affiliation>LORIA – INRIA Lorraine, Université Nancy 2, Nancy, France</mods:affiliation>
</affiliation>
<affiliation><mods:affiliation>E-mail: Marc.Name@loria.fr</mods:affiliation>
</affiliation>
</author>
<author><name sortKey="Gudmundsson, Joachim" sort="Gudmundsson, Joachim" uniqKey="Gudmundsson J" first="Joachim" last="Gudmundsson">Joachim Gudmundsson</name>
<affiliation><mods:affiliation>National ICT Australia Ltd., Sydney, Australia</mods:affiliation>
</affiliation>
<affiliation><mods:affiliation>E-mail: joachim.gudmundsson@nicta.com.au</mods:affiliation>
</affiliation>
</author>
<author><name sortKey="Hornus, Samuel" sort="Hornus, Samuel" uniqKey="Hornus S" first="Samuel" last="Hornus">Samuel Hornus</name>
<affiliation><mods:affiliation>Dept. of Computer Science, KAIST, Daejeon, Korea</mods:affiliation>
</affiliation>
<affiliation><mods:affiliation>E-mail: hornus@tclab.kaist.ac.kr</mods:affiliation>
</affiliation>
</author>
<author><name sortKey="Lazard, Sylvain" sort="Lazard, Sylvain" uniqKey="Lazard S" first="Sylvain" last="Lazard">Sylvain Lazard</name>
<affiliation><mods:affiliation>LORIA – INRIA Lorraine, Université Nancy 2, Nancy, France</mods:affiliation>
</affiliation>
<affiliation><mods:affiliation>E-mail: Sylvain.Name@loria.fr</mods:affiliation>
</affiliation>
</author>
<author><name sortKey="Lee, Mira" sort="Lee, Mira" uniqKey="Lee M" first="Mira" last="Lee">Mira Lee</name>
<affiliation><mods:affiliation>Dept. of Computer Science, KAIST, Daejeon, Korea</mods:affiliation>
</affiliation>
<affiliation><mods:affiliation>E-mail: mira@tclab.kaist.ac.kr</mods:affiliation>
</affiliation>
</author>
<author><name sortKey="Na, Hyeon Suk" sort="Na, Hyeon Suk" uniqKey="Na H" first="Hyeon-Suk" last="Na">Hyeon-Suk Na</name>
<affiliation><mods:affiliation>School of Computing, Soongsil University, Seoul, Korea</mods:affiliation>
</affiliation>
<affiliation><mods:affiliation>E-mail: hsnaa@ssu.ac.kr</mods:affiliation>
</affiliation>
</author>
</titleStmt>
<publicationStmt><idno type="wicri:source">ISTEX</idno>
<idno type="RBID">ISTEX:63B6B696DA9C87DCC8A49D4DF4E297EB0AEB9E05</idno>
<date when="2007" year="2007">2007</date>
<idno type="doi">10.1007/978-3-540-75520-3_37</idno>
<idno type="url">https://api.istex.fr/ark:/67375/HCB-0CL3CNSL-4/fulltext.pdf</idno>
<idno type="wicri:Area/Istex/Corpus">001724</idno>
<idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">001724</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Farthest-Polygon Voronoi Diagrams </title>
<author><name sortKey="Cheong, Otfried" sort="Cheong, Otfried" uniqKey="Cheong O" first="Otfried" last="Cheong">Otfried Cheong</name>
<affiliation><mods:affiliation>Dept. of Computer Science, KAIST, Daejeon, Korea</mods:affiliation>
</affiliation>
<affiliation><mods:affiliation>E-mail: otfried@tclab.kaist.ac.kr</mods:affiliation>
</affiliation>
</author>
<author><name sortKey="Everett, Hazel" sort="Everett, Hazel" uniqKey="Everett H" first="Hazel" last="Everett">Hazel Everett</name>
<affiliation><mods:affiliation>LORIA – INRIA Lorraine, Université Nancy 2, Nancy, France</mods:affiliation>
</affiliation>
<affiliation><mods:affiliation>E-mail: Hazel.Name@loria.fr</mods:affiliation>
</affiliation>
</author>
<author><name sortKey="Glisse, Marc" sort="Glisse, Marc" uniqKey="Glisse M" first="Marc" last="Glisse">Marc Glisse</name>
<affiliation><mods:affiliation>LORIA – INRIA Lorraine, Université Nancy 2, Nancy, France</mods:affiliation>
</affiliation>
<affiliation><mods:affiliation>E-mail: Marc.Name@loria.fr</mods:affiliation>
</affiliation>
</author>
<author><name sortKey="Gudmundsson, Joachim" sort="Gudmundsson, Joachim" uniqKey="Gudmundsson J" first="Joachim" last="Gudmundsson">Joachim Gudmundsson</name>
<affiliation><mods:affiliation>National ICT Australia Ltd., Sydney, Australia</mods:affiliation>
</affiliation>
<affiliation><mods:affiliation>E-mail: joachim.gudmundsson@nicta.com.au</mods:affiliation>
</affiliation>
</author>
<author><name sortKey="Hornus, Samuel" sort="Hornus, Samuel" uniqKey="Hornus S" first="Samuel" last="Hornus">Samuel Hornus</name>
<affiliation><mods:affiliation>Dept. of Computer Science, KAIST, Daejeon, Korea</mods:affiliation>
</affiliation>
<affiliation><mods:affiliation>E-mail: hornus@tclab.kaist.ac.kr</mods:affiliation>
</affiliation>
</author>
<author><name sortKey="Lazard, Sylvain" sort="Lazard, Sylvain" uniqKey="Lazard S" first="Sylvain" last="Lazard">Sylvain Lazard</name>
<affiliation><mods:affiliation>LORIA – INRIA Lorraine, Université Nancy 2, Nancy, France</mods:affiliation>
</affiliation>
<affiliation><mods:affiliation>E-mail: Sylvain.Name@loria.fr</mods:affiliation>
</affiliation>
</author>
<author><name sortKey="Lee, Mira" sort="Lee, Mira" uniqKey="Lee M" first="Mira" last="Lee">Mira Lee</name>
<affiliation><mods:affiliation>Dept. of Computer Science, KAIST, Daejeon, Korea</mods:affiliation>
</affiliation>
<affiliation><mods:affiliation>E-mail: mira@tclab.kaist.ac.kr</mods:affiliation>
</affiliation>
</author>
<author><name sortKey="Na, Hyeon Suk" sort="Na, Hyeon Suk" uniqKey="Na H" first="Hyeon-Suk" last="Na">Hyeon-Suk Na</name>
<affiliation><mods:affiliation>School of Computing, Soongsil University, Seoul, Korea</mods:affiliation>
</affiliation>
<affiliation><mods:affiliation>E-mail: hsnaa@ssu.ac.kr</mods:affiliation>
</affiliation>
</author>
</analytic>
<monogr></monogr>
<series><title level="s" type="main" xml:lang="en">Lecture Notes in Computer Science</title>
<idno type="ISSN">0302-9743</idno>
<idno type="eISSN">1611-3349</idno>
<idno type="ISSN">0302-9743</idno>
</series>
</biblStruct>
</sourceDesc>
<seriesStmt><idno type="ISSN">0302-9743</idno>
</seriesStmt>
</fileDesc>
<profileDesc><textClass></textClass>
</profileDesc>
</teiHeader>
<front><div type="abstract" xml:lang="en">Abstract: 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 log3 n) time algorithm to compute it.</div>
</front>
</TEI>
<istex><corpusName>springer-ebooks</corpusName>
<author><json:item><name>Otfried Cheong</name>
<affiliations><json:string>Dept. of Computer Science, KAIST, Daejeon, Korea</json:string>
<json:string>E-mail: otfried@tclab.kaist.ac.kr</json:string>
</affiliations>
</json:item>
<json:item><name>Hazel Everett</name>
<affiliations><json:string>LORIA – INRIA Lorraine, Université Nancy 2, Nancy, France</json:string>
<json:string>E-mail: Hazel.Name@loria.fr</json:string>
</affiliations>
</json:item>
<json:item><name>Marc Glisse</name>
<affiliations><json:string>LORIA – INRIA Lorraine, Université Nancy 2, Nancy, France</json:string>
<json:string>E-mail: Marc.Name@loria.fr</json:string>
</affiliations>
</json:item>
<json:item><name>Joachim Gudmundsson</name>
<affiliations><json:string>National ICT Australia Ltd., Sydney, Australia</json:string>
<json:string>E-mail: joachim.gudmundsson@nicta.com.au</json:string>
</affiliations>
</json:item>
<json:item><name>Samuel Hornus</name>
<affiliations><json:string>Dept. of Computer Science, KAIST, Daejeon, Korea</json:string>
<json:string>E-mail: hornus@tclab.kaist.ac.kr</json:string>
</affiliations>
</json:item>
<json:item><name>Sylvain Lazard</name>
<affiliations><json:string>LORIA – INRIA Lorraine, Université Nancy 2, Nancy, France</json:string>
<json:string>E-mail: Sylvain.Name@loria.fr</json:string>
</affiliations>
</json:item>
<json:item><name>Mira Lee</name>
<affiliations><json:string>Dept. of Computer Science, KAIST, Daejeon, Korea</json:string>
<json:string>E-mail: mira@tclab.kaist.ac.kr</json:string>
</affiliations>
</json:item>
<json:item><name>Hyeon-Suk Na</name>
<affiliations><json:string>School of Computing, Soongsil University, Seoul, Korea</json:string>
<json:string>E-mail: hsnaa@ssu.ac.kr</json:string>
</affiliations>
</json:item>
</author>
<arkIstex>ark:/67375/HCB-0CL3CNSL-4</arkIstex>
<language><json:string>eng</json:string>
</language>
<originalGenre><json:string>OriginalPaper</json:string>
</originalGenre>
<abstract>Abstract: 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 log3 n) time algorithm to compute it.</abstract>
<qualityIndicators><score>7.696</score>
<pdfWordCount>5533</pdfWordCount>
<pdfCharCount>25681</pdfCharCount>
<pdfVersion>1.6</pdfVersion>
<pdfPageCount>12</pdfPageCount>
<pdfPageSize>430 x 660 pts</pdfPageSize>
<refBibsNative>false</refBibsNative>
<abstractWordCount>58</abstractWordCount>
<abstractCharCount>327</abstractCharCount>
<keywordCount>0</keywordCount>
</qualityIndicators>
<title>Farthest-Polygon Voronoi Diagrams</title>
<chapterId><json:string>37</json:string>
<json:string>Chap37</json:string>
</chapterId>
<genre><json:string>conference</json:string>
</genre>
<serie><title>Lecture Notes in Computer Science</title>
<language><json:string>unknown</json:string>
</language>
<copyrightDate>2007</copyrightDate>
<issn><json:string>0302-9743</json:string>
</issn>
<eissn><json:string>1611-3349</json:string>
</eissn>
<editor><json:item><name>David Hutchison</name>
</json:item>
<json:item><name>Takeo Kanade</name>
</json:item>
<json:item><name>Josef Kittler</name>
</json:item>
<json:item><name>Jon M. Kleinberg</name>
</json:item>
<json:item><name>Friedemann Mattern</name>
</json:item>
<json:item><name>John C. Mitchell</name>
</json:item>
<json:item><name>Moni Naor</name>
</json:item>
<json:item><name>Oscar Nierstrasz</name>
</json:item>
<json:item><name>C. Pandu Rangan</name>
</json:item>
<json:item><name>Bernhard Steffen</name>
</json:item>
<json:item><name>Madhu Sudan</name>
</json:item>
<json:item><name>Demetri Terzopoulos</name>
</json:item>
<json:item><name>Doug Tygar</name>
</json:item>
<json:item><name>Moshe Y. Vardi</name>
</json:item>
<json:item><name>Gerhard Weikum</name>
</json:item>
</editor>
</serie>
<host><title>Algorithms – ESA 2007</title>
<language><json:string>unknown</json:string>
</language>
<copyrightDate>2007</copyrightDate>
<doi><json:string>10.1007/978-3-540-75520-3</json:string>
</doi>
<issn><json:string>0302-9743</json:string>
</issn>
<eissn><json:string>1611-3349</json:string>
</eissn>
<eisbn><json:string>978-3-540-75520-3</json:string>
</eisbn>
<bookId><json:string>978-3-540-75520-3</json:string>
</bookId>
<isbn><json:string>978-3-540-75519-7</json:string>
</isbn>
<volume>4698</volume>
<pages><first>407</first>
<last>418</last>
</pages>
<genre><json:string>book-series</json:string>
</genre>
<editor><json:item><name>Lars Arge</name>
</json:item>
<json:item><name>Michael Hoffmann</name>
</json:item>
<json:item><name>Emo Welzl</name>
</json:item>
</editor>
<subject><json:item><value>Computer Science</value>
</json:item>
<json:item><value>Computer Science</value>
</json:item>
<json:item><value>Algorithm Analysis and Problem Complexity</value>
</json:item>
<json:item><value>Numeric Computing</value>
</json:item>
<json:item><value>Discrete Mathematics in Computer Science</value>
</json:item>
<json:item><value>Data Structures</value>
</json:item>
<json:item><value>Computer Communication Networks</value>
</json:item>
<json:item><value>Computer Graphics</value>
</json:item>
</subject>
</host>
<ark><json:string>ark:/67375/HCB-0CL3CNSL-4</json:string>
</ark>
<publicationDate>2007</publicationDate>
<copyrightDate>2007</copyrightDate>
<doi><json:string>10.1007/978-3-540-75520-3_37</json:string>
</doi>
<id>63B6B696DA9C87DCC8A49D4DF4E297EB0AEB9E05</id>
<score>1</score>
<fulltext><json:item><extension>pdf</extension>
<original>true</original>
<mimetype>application/pdf</mimetype>
<uri>https://api.istex.fr/ark:/67375/HCB-0CL3CNSL-4/fulltext.pdf</uri>
</json:item>
<json:item><extension>zip</extension>
<original>false</original>
<mimetype>application/zip</mimetype>
<uri>https://api.istex.fr/ark:/67375/HCB-0CL3CNSL-4/bundle.zip</uri>
</json:item>
<istex:fulltextTEI uri="https://api.istex.fr/ark:/67375/HCB-0CL3CNSL-4/fulltext.tei"><teiHeader><fileDesc><titleStmt><title level="a" type="main" xml:lang="en">Farthest-Polygon Voronoi Diagrams </title>
</titleStmt>
<publicationStmt><authority>ISTEX</authority>
<availability><licence>Springer-Verlag Berlin Heidelberg</licence>
</availability>
<date when="2007">2007</date>
</publicationStmt>
<notesStmt><note type="conference" source="proceedings" scheme="https://content-type.data.istex.fr/ark:/67375/XTP-BFHXPBJJ-3">conference</note>
<note type="publication-type" subtype="book-series" scheme="https://publication-type.data.istex.fr/ark:/67375/JMC-0G6R5W5T-Z">book-series</note>
</notesStmt>
<sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Farthest-Polygon Voronoi Diagrams </title>
<author><persName><forename type="first">Otfried</forename>
<surname>Cheong</surname>
</persName>
<email>otfried@tclab.kaist.ac.kr</email>
<affiliation><orgName type="institution">Dept. of Computer Science, KAIST, Daejeon</orgName>
<address><country key=""></country>
</address>
</affiliation>
</author>
<author><persName><forename type="first">Hazel</forename>
<surname>Everett</surname>
</persName>
<email>Hazel.Name@loria.fr</email>
<affiliation><orgName type="institution">LORIA – INRIA Lorraine, Université Nancy 2, Nancy</orgName>
<address><country key="FR">FRANCE</country>
</address>
</affiliation>
</author>
<author><persName><forename type="first">Marc</forename>
<surname>Glisse</surname>
</persName>
<email>Marc.Name@loria.fr</email>
<affiliation><orgName type="institution">LORIA – INRIA Lorraine, Université Nancy 2, Nancy</orgName>
<address><country key="FR">FRANCE</country>
</address>
</affiliation>
</author>
<author><persName><forename type="first">Joachim</forename>
<surname>Gudmundsson</surname>
</persName>
<email>joachim.gudmundsson@nicta.com.au</email>
<affiliation><orgName type="institution">National ICT Australia Ltd., Sydney</orgName>
<address><country key="AU">AUSTRALIA</country>
</address>
</affiliation>
</author>
<author><persName><forename type="first">Samuel</forename>
<surname>Hornus</surname>
</persName>
<email>hornus@tclab.kaist.ac.kr</email>
<affiliation><orgName type="institution">Dept. of Computer Science, KAIST, Daejeon</orgName>
<address><country key=""></country>
</address>
</affiliation>
</author>
<author><persName><forename type="first">Sylvain</forename>
<surname>Lazard</surname>
</persName>
<email>Sylvain.Name@loria.fr</email>
<affiliation><orgName type="institution">LORIA – INRIA Lorraine, Université Nancy 2, Nancy</orgName>
<address><country key="FR">FRANCE</country>
</address>
</affiliation>
</author>
<author><persName><forename type="first">Mira</forename>
<surname>Lee</surname>
</persName>
<email>mira@tclab.kaist.ac.kr</email>
<affiliation><orgName type="institution">Dept. of Computer Science, KAIST, Daejeon</orgName>
<address><country key=""></country>
</address>
</affiliation>
</author>
<author><persName><forename type="first">Hyeon-Suk</forename>
<surname>Na</surname>
</persName>
<email>hsnaa@ssu.ac.kr</email>
<affiliation><orgName type="institution">School of Computing, Soongsil University, Seoul</orgName>
<address><country key=""></country>
</address>
</affiliation>
</author>
<idno type="istex">63B6B696DA9C87DCC8A49D4DF4E297EB0AEB9E05</idno>
<idno type="ark">ark:/67375/HCB-0CL3CNSL-4</idno>
<idno type="DOI">10.1007/978-3-540-75520-3_37</idno>
</analytic>
<monogr><title level="m" type="main">Algorithms – ESA 2007</title>
<title level="m" type="sub">15th Annual European Symposium, Eilat, Israel, October 8-10, 2007. Proceedings</title>
<title level="m" type="part">Contributed Papers: Design and Analysis Track</title>
<idno type="DOI">10.1007/978-3-540-75520-3</idno>
<idno type="book-id">978-3-540-75520-3</idno>
<idno type="ISBN">978-3-540-75519-7</idno>
<idno type="eISBN">978-3-540-75520-3</idno>
<idno type="chapter-id">Chap37</idno>
<idno type="part-id">Part2</idno>
<editor><persName><forename type="first">Lars</forename>
<surname>Arge</surname>
</persName>
<email>large@daimi.au.dk</email>
</editor>
<editor><persName><forename type="first">Michael</forename>
<surname>Hoffmann</surname>
</persName>
<email>mh55@mcs.le.ac.uk</email>
</editor>
<editor><persName><forename type="first">Emo</forename>
<surname>Welzl</surname>
</persName>
<email>welzl@inf.ethz.ch</email>
</editor>
<imprint><biblScope unit="vol">4698</biblScope>
<biblScope unit="page" from="407">407</biblScope>
<biblScope unit="page" to="418">418</biblScope>
<biblScope unit="chapter-count">66</biblScope>
<biblScope unit="part-chapter-count">50</biblScope>
</imprint>
</monogr>
<series><title level="s" type="main" xml:lang="en">Lecture Notes in Computer Science</title>
<editor><persName><forename type="first">David</forename>
<surname>Hutchison</surname>
</persName>
</editor>
<editor><persName><forename type="first">Takeo</forename>
<surname>Kanade</surname>
</persName>
</editor>
<editor><persName><forename type="first">Josef</forename>
<surname>Kittler</surname>
</persName>
</editor>
<editor><persName><forename type="first">Jon</forename>
<forename type="first">M.</forename>
<surname>Kleinberg</surname>
</persName>
</editor>
<editor><persName><forename type="first">Friedemann</forename>
<surname>Mattern</surname>
</persName>
</editor>
<editor><persName><forename type="first">John</forename>
<forename type="first">C.</forename>
<surname>Mitchell</surname>
</persName>
</editor>
<editor><persName><forename type="first">Moni</forename>
<surname>Naor</surname>
</persName>
</editor>
<editor><persName><forename type="first">Oscar</forename>
<surname>Nierstrasz</surname>
</persName>
</editor>
<editor><persName><forename type="first">C.</forename>
<surname>Pandu Rangan</surname>
</persName>
</editor>
<editor><persName><forename type="first">Bernhard</forename>
<surname>Steffen</surname>
</persName>
</editor>
<editor><persName><forename type="first">Madhu</forename>
<surname>Sudan</surname>
</persName>
</editor>
<editor><persName><forename type="first">Demetri</forename>
<surname>Terzopoulos</surname>
</persName>
</editor>
<editor><persName><forename type="first">Doug</forename>
<surname>Tygar</surname>
</persName>
</editor>
<editor><persName><forename type="first">Moshe</forename>
<forename type="first">Y.</forename>
<surname>Vardi</surname>
</persName>
</editor>
<editor><persName><forename type="first">Gerhard</forename>
<surname>Weikum</surname>
</persName>
</editor>
<idno type="pISSN">0302-9743</idno>
<idno type="eISSN">1611-3349</idno>
<idno type="seriesID">558</idno>
</series>
</biblStruct>
</sourceDesc>
</fileDesc>
<profileDesc><abstract xml:lang="en"><head>Abstract</head>
<p>Given a family of <hi rend="italic">k</hi>
 disjoint connected polygonal sites of total complexity <hi rend="italic">n</hi>
, 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 <hi rend="italic">O</hi>
(<hi rend="italic">n</hi>
), and give an <hi rend="italic">O</hi>
(<hi rend="italic">n</hi>
 log<hi rend="superscript">3</hi>
<hi rend="italic">n</hi>
) time algorithm to compute it.</p>
</abstract>
<textClass ana="subject"><keywords scheme="book-subject-collection"><list><label>SUCO11645</label>
<item><term>Computer Science</term>
</item>
</list>
</keywords>
</textClass>
<textClass ana="subject"><keywords scheme="book-subject"><list><label>I</label>
<item><term type="Primary">Computer Science</term>
</item>
<label>I16021</label>
<item><term type="Secondary" subtype="priority-1">Algorithm Analysis and Problem Complexity</term>
</item>
<label>I1701X</label>
<item><term type="Secondary" subtype="priority-2">Numeric Computing</term>
</item>
<label>I17028</label>
<item><term type="Secondary" subtype="priority-3">Discrete Mathematics in Computer Science</term>
</item>
<label>I15017</label>
<item><term type="Secondary" subtype="priority-4">Data Structures</term>
</item>
<label>I13022</label>
<item><term type="Secondary" subtype="priority-5">Computer Communication Networks</term>
</item>
<label>I22013</label>
<item><term type="Secondary" subtype="priority-6">Computer Graphics</term>
</item>
</list>
</keywords>
</textClass>
<langUsage><language ident="EN"></language>
</langUsage>
</profileDesc>
</teiHeader>
</istex:fulltextTEI>
<json:item><extension>txt</extension>
<original>false</original>
<mimetype>text/plain</mimetype>
<uri>https://api.istex.fr/ark:/67375/HCB-0CL3CNSL-4/fulltext.txt</uri>
</json:item>
</fulltext>
<metadata><istex:metadataXml wicri:clean="corpus springer-ebooks not found" wicri:toSee="no header"><istex:xmlDeclaration>version="1.0" encoding="UTF-8"</istex:xmlDeclaration>
<istex:docType PUBLIC="-//Springer-Verlag//DTD A++ V2.4//EN" URI="http://devel.springer.de/A++/V2.4/DTD/A++V2.4.dtd" name="istex:docType"></istex:docType>
<istex:document><Publisher><PublisherInfo><PublisherName>Springer Berlin Heidelberg</PublisherName>
<PublisherLocation>Berlin, Heidelberg</PublisherLocation>
</PublisherInfo>
<Series><SeriesInfo SeriesType="Series" TocLevels="0"><SeriesID>558</SeriesID>
<SeriesPrintISSN>0302-9743</SeriesPrintISSN>
<SeriesElectronicISSN>1611-3349</SeriesElectronicISSN>
<SeriesTitle Language="En">Lecture Notes in Computer Science</SeriesTitle>
</SeriesInfo>
<SeriesHeader><EditorGroup><Editor><EditorName DisplayOrder="Western"><GivenName>David</GivenName>
<FamilyName>Hutchison</FamilyName>
</EditorName>
</Editor>
<Editor><EditorName DisplayOrder="Western"><GivenName>Takeo</GivenName>
<FamilyName>Kanade</FamilyName>
</EditorName>
</Editor>
<Editor><EditorName DisplayOrder="Western"><GivenName>Josef</GivenName>
<FamilyName>Kittler</FamilyName>
</EditorName>
</Editor>
<Editor><EditorName DisplayOrder="Western"><GivenName>Jon</GivenName>
<GivenName>M.</GivenName>
<FamilyName>Kleinberg</FamilyName>
</EditorName>
</Editor>
<Editor><EditorName DisplayOrder="Western"><GivenName>Friedemann</GivenName>
<FamilyName>Mattern</FamilyName>
</EditorName>
</Editor>
<Editor><EditorName DisplayOrder="Western"><GivenName>John</GivenName>
<GivenName>C.</GivenName>
<FamilyName>Mitchell</FamilyName>
</EditorName>
</Editor>
<Editor><EditorName DisplayOrder="Western"><GivenName>Moni</GivenName>
<FamilyName>Naor</FamilyName>
</EditorName>
</Editor>
<Editor><EditorName DisplayOrder="Western"><GivenName>Oscar</GivenName>
<FamilyName>Nierstrasz</FamilyName>
</EditorName>
</Editor>
<Editor><EditorName DisplayOrder="Western"><GivenName>C.</GivenName>
<FamilyName>Pandu Rangan</FamilyName>
</EditorName>
</Editor>
<Editor><EditorName DisplayOrder="Western"><GivenName>Bernhard</GivenName>
<FamilyName>Steffen</FamilyName>
</EditorName>
</Editor>
<Editor><EditorName DisplayOrder="Western"><GivenName>Madhu</GivenName>
<FamilyName>Sudan</FamilyName>
</EditorName>
</Editor>
<Editor><EditorName DisplayOrder="Western"><GivenName>Demetri</GivenName>
<FamilyName>Terzopoulos</FamilyName>
</EditorName>
</Editor>
<Editor><EditorName DisplayOrder="Western"><GivenName>Doug</GivenName>
<FamilyName>Tygar</FamilyName>
</EditorName>
</Editor>
<Editor><EditorName DisplayOrder="Western"><GivenName>Moshe</GivenName>
<GivenName>Y.</GivenName>
<FamilyName>Vardi</FamilyName>
</EditorName>
</Editor>
<Editor><EditorName DisplayOrder="Western"><GivenName>Gerhard</GivenName>
<FamilyName>Weikum</FamilyName>
</EditorName>
</Editor>
</EditorGroup>
</SeriesHeader>
<Book Language="En"><BookInfo BookProductType="Proceedings" ContainsESM="No" Language="En" MediaType="eBook" NumberingStyle="Unnumbered" OutputMedium="All" TocLevels="0"><BookID>978-3-540-75520-3</BookID>
<BookTitle>Algorithms – ESA 2007</BookTitle>
<BookSubTitle>15th Annual European Symposium, Eilat, Israel, October 8-10, 2007. Proceedings</BookSubTitle>
<BookVolumeNumber>4698</BookVolumeNumber>
<BookSequenceNumber>4698</BookSequenceNumber>
<BookDOI>10.1007/978-3-540-75520-3</BookDOI>
<BookTitleID>157051</BookTitleID>
<BookPrintISBN>978-3-540-75519-7</BookPrintISBN>
<BookElectronicISBN>978-3-540-75520-3</BookElectronicISBN>
<BookChapterCount>66</BookChapterCount>
<BookCopyright><CopyrightHolderName>Springer-Verlag Berlin Heidelberg</CopyrightHolderName>
<CopyrightYear>2007</CopyrightYear>
</BookCopyright>
<BookSubjectGroup><BookSubject Code="I" Type="Primary">Computer Science</BookSubject>
<BookSubject Code="I16021" Priority="1" Type="Secondary">Algorithm Analysis and Problem Complexity</BookSubject>
<BookSubject Code="I1701X" Priority="2" Type="Secondary">Numeric Computing</BookSubject>
<BookSubject Code="I17028" Priority="3" Type="Secondary">Discrete Mathematics in Computer Science</BookSubject>
<BookSubject Code="I15017" Priority="4" Type="Secondary">Data Structures</BookSubject>
<BookSubject Code="I13022" Priority="5" Type="Secondary">Computer Communication Networks</BookSubject>
<BookSubject Code="I22013" Priority="6" Type="Secondary">Computer Graphics</BookSubject>
<SubjectCollection Code="SUCO11645">Computer Science</SubjectCollection>
</BookSubjectGroup>
</BookInfo>
<BookHeader><EditorGroup><Editor><EditorName DisplayOrder="Western"><GivenName>Lars</GivenName>
<FamilyName>Arge</FamilyName>
</EditorName>
<Contact><Email>large@daimi.au.dk</Email>
</Contact>
</Editor>
<Editor><EditorName DisplayOrder="Western"><GivenName>Michael</GivenName>
<FamilyName>Hoffmann</FamilyName>
</EditorName>
<Contact><Email>mh55@mcs.le.ac.uk</Email>
</Contact>
</Editor>
<Editor><EditorName DisplayOrder="Western"><GivenName>Emo</GivenName>
<FamilyName>Welzl</FamilyName>
</EditorName>
<Contact><Email>welzl@inf.ethz.ch</Email>
</Contact>
</Editor>
</EditorGroup>
</BookHeader>
<Part ID="Part2"><PartInfo TocLevels="0"><PartID>2</PartID>
<PartSequenceNumber>2</PartSequenceNumber>
<PartTitle>Contributed Papers: Design and Analysis Track</PartTitle>
<PartChapterCount>50</PartChapterCount>
<PartContext><SeriesID>558</SeriesID>
<BookTitle>Algorithms – ESA 2007</BookTitle>
</PartContext>
</PartInfo>
<Chapter ID="Chap37" Language="En"><ChapterInfo ChapterType="OriginalPaper" ContainsESM="No" NumberingStyle="Unnumbered" TocLevels="0"><ChapterID>37</ChapterID>
<ChapterDOI>10.1007/978-3-540-75520-3_37</ChapterDOI>
<ChapterSequenceNumber>37</ChapterSequenceNumber>
<ChapterTitle Language="En">Farthest-Polygon Voronoi Diagrams </ChapterTitle>
<ChapterFirstPage>407</ChapterFirstPage>
<ChapterLastPage>418</ChapterLastPage>
<ChapterCopyright><CopyrightHolderName>Springer-Verlag Berlin Heidelberg</CopyrightHolderName>
<CopyrightYear>2007</CopyrightYear>
</ChapterCopyright>
<ChapterGrants Type="Regular"><MetadataGrant Grant="OpenAccess"></MetadataGrant>
<AbstractGrant Grant="OpenAccess"></AbstractGrant>
<BodyPDFGrant Grant="Restricted"></BodyPDFGrant>
<BodyHTMLGrant Grant="Restricted"></BodyHTMLGrant>
<BibliographyGrant Grant="Restricted"></BibliographyGrant>
<ESMGrant Grant="Restricted"></ESMGrant>
</ChapterGrants>
<ChapterContext><SeriesID>558</SeriesID>
<PartID>2</PartID>
<BookID>978-3-540-75520-3</BookID>
<BookTitle>Algorithms – ESA 2007</BookTitle>
</ChapterContext>
</ChapterInfo>
<ChapterHeader><AuthorGroup><Author AffiliationIDS="Aff1"><AuthorName DisplayOrder="Western"><GivenName>Otfried</GivenName>
<FamilyName>Cheong</FamilyName>
</AuthorName>
<Contact><Email>otfried@tclab.kaist.ac.kr</Email>
</Contact>
</Author>
<Author AffiliationIDS="Aff2"><AuthorName DisplayOrder="Western"><GivenName>Hazel</GivenName>
<FamilyName>Everett</FamilyName>
</AuthorName>
<Contact><Email>Hazel.Name@loria.fr</Email>
</Contact>
</Author>
<Author AffiliationIDS="Aff2"><AuthorName DisplayOrder="Western"><GivenName>Marc</GivenName>
<FamilyName>Glisse</FamilyName>
</AuthorName>
<Contact><Email>Marc.Name@loria.fr</Email>
</Contact>
</Author>
<Author AffiliationIDS="Aff3"><AuthorName DisplayOrder="Western"><GivenName>Joachim</GivenName>
<FamilyName>Gudmundsson</FamilyName>
</AuthorName>
<Contact><Email>joachim.gudmundsson@nicta.com.au</Email>
</Contact>
</Author>
<Author AffiliationIDS="Aff1"><AuthorName DisplayOrder="Western"><GivenName>Samuel</GivenName>
<FamilyName>Hornus</FamilyName>
</AuthorName>
<Contact><Email>hornus@tclab.kaist.ac.kr</Email>
</Contact>
</Author>
<Author AffiliationIDS="Aff2"><AuthorName DisplayOrder="Western"><GivenName>Sylvain</GivenName>
<FamilyName>Lazard</FamilyName>
</AuthorName>
<Contact><Email>Sylvain.Name@loria.fr</Email>
</Contact>
</Author>
<Author AffiliationIDS="Aff1"><AuthorName DisplayOrder="Western"><GivenName>Mira</GivenName>
<FamilyName>Lee</FamilyName>
</AuthorName>
<Contact><Email>mira@tclab.kaist.ac.kr</Email>
</Contact>
</Author>
<Author AffiliationIDS="Aff4"><AuthorName DisplayOrder="Western"><GivenName>Hyeon-Suk</GivenName>
<FamilyName>Na</FamilyName>
</AuthorName>
<Contact><Email>hsnaa@ssu.ac.kr</Email>
</Contact>
</Author>
<Affiliation ID="Aff1"><OrgName>Dept. of Computer Science, KAIST, Daejeon</OrgName>
<OrgAddress><Country>Korea</Country>
</OrgAddress>
</Affiliation>
<Affiliation ID="Aff2"><OrgName>LORIA – INRIA Lorraine, Université Nancy 2, Nancy</OrgName>
<OrgAddress><Country>France</Country>
</OrgAddress>
</Affiliation>
<Affiliation ID="Aff3"><OrgName>National ICT Australia Ltd., Sydney</OrgName>
<OrgAddress><Country>Australia</Country>
</OrgAddress>
</Affiliation>
<Affiliation ID="Aff4"><OrgName>School of Computing, Soongsil University, Seoul</OrgName>
<OrgAddress><Country>Korea</Country>
</OrgAddress>
</Affiliation>
</AuthorGroup>
<Abstract ID="Abs1" Language="En"><Heading>Abstract</Heading>
<Para>Given a family of <Emphasis Type="Italic">k</Emphasis>
 disjoint connected polygonal sites of total complexity <Emphasis Type="Italic">n</Emphasis>
, 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 <Emphasis Type="Italic">O</Emphasis>
(<Emphasis Type="Italic">n</Emphasis>
), and give an <Emphasis Type="Italic">O</Emphasis>
(<Emphasis Type="Italic">n</Emphasis>
 log<Superscript>3</Superscript>
<Emphasis Type="Italic">n</Emphasis>
) time algorithm to compute it.</Para>
</Abstract>
<ArticleNote Type="Misc"><SimplePara>This research was supported by the French-Korean Science and Technology Amicable Relationships program (STAR), and the Brain Korea 21 Project, the School of Information Technology, KAIST, 2007.</SimplePara>
</ArticleNote>
</ChapterHeader>
<NoBody></NoBody>
</Chapter>
</Part>
</Book>
</Series>
</Publisher>
</istex:document>
</istex:metadataXml>
<mods version="3.6"><titleInfo lang="en"><title>Farthest-Polygon Voronoi Diagrams</title>
</titleInfo>
<titleInfo type="alternative" contentType="CDATA"><title>Farthest-Polygon Voronoi Diagrams </title>
</titleInfo>
<name type="personal"><namePart type="given">Otfried</namePart>
<namePart type="family">Cheong</namePart>
<affiliation>Dept. of Computer Science, KAIST, Daejeon, Korea</affiliation>
<affiliation>E-mail: otfried@tclab.kaist.ac.kr</affiliation>
<role><roleTerm type="text">author</roleTerm>
</role>
</name>
<name type="personal"><namePart type="given">Hazel</namePart>
<namePart type="family">Everett</namePart>
<affiliation>LORIA – INRIA Lorraine, Université Nancy 2, Nancy, France</affiliation>
<affiliation>E-mail: Hazel.Name@loria.fr</affiliation>
<role><roleTerm type="text">author</roleTerm>
</role>
</name>
<name type="personal"><namePart type="given">Marc</namePart>
<namePart type="family">Glisse</namePart>
<affiliation>LORIA – INRIA Lorraine, Université Nancy 2, Nancy, France</affiliation>
<affiliation>E-mail: Marc.Name@loria.fr</affiliation>
<role><roleTerm type="text">author</roleTerm>
</role>
</name>
<name type="personal"><namePart type="given">Joachim</namePart>
<namePart type="family">Gudmundsson</namePart>
<affiliation>National ICT Australia Ltd., Sydney, Australia</affiliation>
<affiliation>E-mail: joachim.gudmundsson@nicta.com.au</affiliation>
<role><roleTerm type="text">author</roleTerm>
</role>
</name>
<name type="personal"><namePart type="given">Samuel</namePart>
<namePart type="family">Hornus</namePart>
<affiliation>Dept. of Computer Science, KAIST, Daejeon, Korea</affiliation>
<affiliation>E-mail: hornus@tclab.kaist.ac.kr</affiliation>
<role><roleTerm type="text">author</roleTerm>
</role>
</name>
<name type="personal"><namePart type="given">Sylvain</namePart>
<namePart type="family">Lazard</namePart>
<affiliation>LORIA – INRIA Lorraine, Université Nancy 2, Nancy, France</affiliation>
<affiliation>E-mail: Sylvain.Name@loria.fr</affiliation>
<role><roleTerm type="text">author</roleTerm>
</role>
</name>
<name type="personal"><namePart type="given">Mira</namePart>
<namePart type="family">Lee</namePart>
<affiliation>Dept. of Computer Science, KAIST, Daejeon, Korea</affiliation>
<affiliation>E-mail: mira@tclab.kaist.ac.kr</affiliation>
<role><roleTerm type="text">author</roleTerm>
</role>
</name>
<name type="personal"><namePart type="given">Hyeon-Suk</namePart>
<namePart type="family">Na</namePart>
<affiliation>School of Computing, Soongsil University, Seoul, Korea</affiliation>
<affiliation>E-mail: hsnaa@ssu.ac.kr</affiliation>
<role><roleTerm type="text">author</roleTerm>
</role>
</name>
<typeOfResource>text</typeOfResource>
<genre displayLabel="OriginalPaper" authority="ISTEX" authorityURI="https://content-type.data.istex.fr" type="conference" valueURI="https://content-type.data.istex.fr/ark:/67375/XTP-BFHXPBJJ-3">conference</genre>
<originInfo><publisher>Springer Berlin Heidelberg</publisher>
<place><placeTerm type="text">Berlin, Heidelberg</placeTerm>
</place>
<dateIssued encoding="w3cdtf">2007</dateIssued>
<copyrightDate encoding="w3cdtf">2007</copyrightDate>
</originInfo>
<language><languageTerm type="code" authority="rfc3066">en</languageTerm>
<languageTerm type="code" authority="iso639-2b">eng</languageTerm>
</language>
<abstract lang="en">Abstract: 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 log3 n) time algorithm to compute it.</abstract>
<relatedItem type="host"><titleInfo><title>Algorithms – ESA 2007</title>
<subTitle>15th Annual European Symposium, Eilat, Israel, October 8-10, 2007. Proceedings</subTitle>
</titleInfo>
<name type="personal"><namePart type="given">Lars</namePart>
<namePart type="family">Arge</namePart>
<role><roleTerm type="text">editor</roleTerm>
</role>
</name>
<name type="personal"><namePart type="given">Michael</namePart>
<namePart type="family">Hoffmann</namePart>
<role><roleTerm type="text">editor</roleTerm>
</role>
</name>
<name type="personal"><namePart type="given">Emo</namePart>
<namePart type="family">Welzl</namePart>
<role><roleTerm type="text">editor</roleTerm>
</role>
</name>
<genre type="book-series" authority="ISTEX" authorityURI="https://publication-type.data.istex.fr" valueURI="https://publication-type.data.istex.fr/ark:/67375/JMC-0G6R5W5T-Z">book-series</genre>
<originInfo><publisher>Springer</publisher>
<copyrightDate encoding="w3cdtf">2007</copyrightDate>
<issuance>monographic</issuance>
</originInfo>
<subject><genre>Book-Subject-Collection</genre>
<topic authority="SpringerSubjectCodes" authorityURI="SUCO11645">Computer Science</topic>
</subject>
<subject><genre>Book-Subject-Group</genre>
<topic authority="SpringerSubjectCodes" authorityURI="I">Computer Science</topic>
<topic authority="SpringerSubjectCodes" authorityURI="I16021">Algorithm Analysis and Problem Complexity</topic>
<topic authority="SpringerSubjectCodes" authorityURI="I1701X">Numeric Computing</topic>
<topic authority="SpringerSubjectCodes" authorityURI="I17028">Discrete Mathematics in Computer Science</topic>
<topic authority="SpringerSubjectCodes" authorityURI="I15017">Data Structures</topic>
<topic authority="SpringerSubjectCodes" authorityURI="I13022">Computer Communication Networks</topic>
<topic authority="SpringerSubjectCodes" authorityURI="I22013">Computer Graphics</topic>
</subject>
<identifier type="DOI">10.1007/978-3-540-75520-3</identifier>
<identifier type="ISBN">978-3-540-75519-7</identifier>
<identifier type="eISBN">978-3-540-75520-3</identifier>
<identifier type="ISSN">0302-9743</identifier>
<identifier type="eISSN">1611-3349</identifier>
<identifier type="BookTitleID">157051</identifier>
<identifier type="BookID">978-3-540-75520-3</identifier>
<identifier type="BookChapterCount">66</identifier>
<identifier type="BookVolumeNumber">4698</identifier>
<identifier type="BookSequenceNumber">4698</identifier>
<identifier type="PartChapterCount">50</identifier>
<part><date>2007</date>
<detail type="part"><title>Contributed Papers: Design and Analysis Track</title>
</detail>
<detail type="volume"><number>4698</number>
<caption>vol.</caption>
</detail>
<extent unit="pages"><start>407</start>
<end>418</end>
</extent>
</part>
<recordInfo><recordOrigin>Springer-Verlag Berlin Heidelberg, 2007</recordOrigin>
</recordInfo>
</relatedItem>
<relatedItem type="series"><titleInfo><title>Lecture Notes in Computer Science</title>
</titleInfo>
<name type="personal"><namePart type="given">David</namePart>
<namePart type="family">Hutchison</namePart>
<role><roleTerm type="text">editor</roleTerm>
</role>
</name>
<name type="personal"><namePart type="given">Takeo</namePart>
<namePart type="family">Kanade</namePart>
<role><roleTerm type="text">editor</roleTerm>
</role>
</name>
<name type="personal"><namePart type="given">Josef</namePart>
<namePart type="family">Kittler</namePart>
<role><roleTerm type="text">editor</roleTerm>
</role>
</name>
<name type="personal"><namePart type="given">Jon</namePart>
<namePart type="given">M.</namePart>
<namePart type="family">Kleinberg</namePart>
<role><roleTerm type="text">editor</roleTerm>
</role>
</name>
<name type="personal"><namePart type="given">Friedemann</namePart>
<namePart type="family">Mattern</namePart>
<role><roleTerm type="text">editor</roleTerm>
</role>
</name>
<name type="personal"><namePart type="given">John</namePart>
<namePart type="given">C.</namePart>
<namePart type="family">Mitchell</namePart>
<role><roleTerm type="text">editor</roleTerm>
</role>
</name>
<name type="personal"><namePart type="given">Moni</namePart>
<namePart type="family">Naor</namePart>
<role><roleTerm type="text">editor</roleTerm>
</role>
</name>
<name type="personal"><namePart type="given">Oscar</namePart>
<namePart type="family">Nierstrasz</namePart>
<role><roleTerm type="text">editor</roleTerm>
</role>
</name>
<name type="personal"><namePart type="given">C.</namePart>
<namePart type="family">Pandu Rangan</namePart>
<role><roleTerm type="text">editor</roleTerm>
</role>
</name>
<name type="personal"><namePart type="given">Bernhard</namePart>
<namePart type="family">Steffen</namePart>
<role><roleTerm type="text">editor</roleTerm>
</role>
</name>
<name type="personal"><namePart type="given">Madhu</namePart>
<namePart type="family">Sudan</namePart>
<role><roleTerm type="text">editor</roleTerm>
</role>
</name>
<name type="personal"><namePart type="given">Demetri</namePart>
<namePart type="family">Terzopoulos</namePart>
<role><roleTerm type="text">editor</roleTerm>
</role>
</name>
<name type="personal"><namePart type="given">Doug</namePart>
<namePart type="family">Tygar</namePart>
<role><roleTerm type="text">editor</roleTerm>
</role>
</name>
<name type="personal"><namePart type="given">Moshe</namePart>
<namePart type="given">Y.</namePart>
<namePart type="family">Vardi</namePart>
<role><roleTerm type="text">editor</roleTerm>
</role>
</name>
<name type="personal"><namePart type="given">Gerhard</namePart>
<namePart type="family">Weikum</namePart>
<role><roleTerm type="text">editor</roleTerm>
</role>
</name>
<originInfo><publisher>Springer</publisher>
<copyrightDate encoding="w3cdtf">2007</copyrightDate>
<issuance>serial</issuance>
</originInfo>
<identifier type="ISSN">0302-9743</identifier>
<identifier type="eISSN">1611-3349</identifier>
<identifier type="SeriesID">558</identifier>
<recordInfo><recordOrigin>Springer-Verlag Berlin Heidelberg, 2007</recordOrigin>
</recordInfo>
</relatedItem>
<identifier type="istex">63B6B696DA9C87DCC8A49D4DF4E297EB0AEB9E05</identifier>
<identifier type="ark">ark:/67375/HCB-0CL3CNSL-4</identifier>
<identifier type="DOI">10.1007/978-3-540-75520-3_37</identifier>
<identifier type="ChapterID">37</identifier>
<identifier type="ChapterID">Chap37</identifier>
<accessCondition type="use and reproduction" contentType="copyright">Springer-Verlag Berlin Heidelberg, 2007</accessCondition>
<recordInfo><recordContentSource authority="ISTEX" authorityURI="https://loaded-corpus.data.istex.fr" valueURI="https://loaded-corpus.data.istex.fr/ark:/67375/XBH-RLRX46XW-4">springer</recordContentSource>
<recordOrigin>Springer-Verlag Berlin Heidelberg, 2007</recordOrigin>
</recordInfo>
</mods>
<json:item><extension>json</extension>
<original>false</original>
<mimetype>application/json</mimetype>
<uri>https://api.istex.fr/ark:/67375/HCB-0CL3CNSL-4/record.json</uri>
</json:item>
</metadata>
</istex>
</record>

Pour manipuler ce document sous Unix (Dilib)

EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Istex/Corpus

HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 001724 | SxmlIndent | more

HfdSelect -h $EXPLOR_AREA/Data/Istex/Corpus/biblio.hfd -nk 001724 | SxmlIndent | more

Pour mettre un lien sur cette page dans le réseau Wicri

{{Explor lien
   |wiki=    Wicri/Lorraine
   |area=    InforLorV4
   |flux=    Istex
   |étape=   Corpus
   |type=    RBID
   |clé=     ISTEX:63B6B696DA9C87DCC8A49D4DF4E297EB0AEB9E05
   |texte=   Farthest-Polygon Voronoi Diagrams
}}

This area was generated with Dilib version V0.6.33.
Data generation: Mon Jun 10 21:56:28 2019. Site generation: Fri Feb 25 15:29:27 2022

	Serveur d'exploration sur la recherche en informatique en Lorraine
	Attention, ce site est en cours de développement ! Attention, site généré par des moyens informatiques à partir de corpus bruts. Les informations ne sont donc pas validées.

Serveur d'exploration sur la recherche en informatique en Lorraine

Farthest-Polygon Voronoi Diagrams

Farthest-Polygon Voronoi Diagrams

Source :

Abstract

Links to Exploration step

Le document en format XML

Pour manipuler ce document sous Unix (Dilib)

Pour mettre un lien sur cette page dans le réseau Wicri