Farthest-polygon voronoi diagrams
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Cheong, O. | - |
dc.contributor.author | Everett, H. | - |
dc.contributor.author | Glisse, M. | - |
dc.contributor.author | Gudmundsson, J. | - |
dc.contributor.author | Hornus, S. | - |
dc.contributor.author | Lazard, S. | - |
dc.contributor.author | Lee, M. | - |
dc.contributor.author | Na, H.-S. | - |
dc.date.available | 2019-04-10T11:21:55Z | - |
dc.date.created | 2018-04-17 | - |
dc.date.issued | 2007 | - |
dc.identifier.isbn | 9783540755197 | - |
dc.identifier.issn | 0302-9743 | - |
dc.identifier.uri | http://scholarworks.bwise.kr/ssu/handle/2018.sw.ssu/33709 | - |
dc.description.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. © Springer-Verlag Berlin Heidelberg 2007. | - |
dc.relation.isPartOf | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | - |
dc.title | Farthest-polygon voronoi diagrams | - |
dc.type | Conference | - |
dc.type.rims | CONF | - |
dc.identifier.bibliographicCitation | 15th Annual European Symposium on Algorithms, ESA 2007, v.4698 LNCS, pp.407 - 418 | - |
dc.description.journalClass | 2 | - |
dc.identifier.scopusid | 2-s2.0-38049027918 | - |
dc.citation.conferenceDate | 2007-10-08 | - |
dc.citation.conferencePlace | Eilat | - |
dc.citation.endPage | 418 | - |
dc.citation.startPage | 407 | - |
dc.citation.title | 15th Annual European Symposium on Algorithms, ESA 2007 | - |
dc.citation.volume | 4698 LNCS | - |
dc.contributor.affiliatedAuthor | Na, H.-S. | - |
dc.type.docType | Conference Paper | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
Soongsil University Library 369 Sangdo-Ro, Dongjak-Gu, Seoul, Korea (06978)02-820-0733
COPYRIGHT ⓒ SOONGSIL UNIVERSITY, ALL RIGHTS RESERVED.
Certain data included herein are derived from the © Web of Science of Clarivate Analytics. All rights reserved.
You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.