DC Field | Value | Language |
---|---|---|
dc.contributor.author | Oh, E. | - |
dc.contributor.author | Barba, L. | - |
dc.contributor.author | Ahn, H.-K. | - |
dc.date.accessioned | 2020-02-27T00:51:18Z | - |
dc.date.available | 2020-02-27T00:51:18Z | - |
dc.date.created | 2019-12-06 | - |
dc.date.issued | 2020-05 | - |
dc.identifier.issn | 0178-4617 | - |
dc.identifier.uri | https://oasis.postech.ac.kr/handle/2014.oak/101218 | - |
dc.description.abstract | Given a set of point sites in a simple polygon, the geodesic farthest-point Voronoi diagram partitions the polygon into cells, at most one cell per site, such that every point in a cell has the same farthest site with respect to the geodesic metric. We present an O(nloglogn+mlogm)-time algorithm to compute the geodesic farthest-point Voronoi diagram of m point sites in a simple n-gon. This improves the previously best known algorithm by Aronov et al. (Discrete Comput Geom 9(3):217-255, 1993). In the case that all point sites are on the boundary of the simple polygon, we can compute the geodesic farthest-point Voronoi diagram in O((n+m)loglogn) time. | - |
dc.language | English | - |
dc.publisher | SPRINGER | - |
dc.relation.isPartOf | ALGORITHMICA | - |
dc.title | The Geodesic Farthest-Point Voronoi Diagram in a Simple Polygon | - |
dc.type | Article | - |
dc.identifier.doi | 10.1007/s00453-019-00651-z | - |
dc.type.rims | ART | - |
dc.identifier.bibliographicCitation | ALGORITHMICA, v.82, no.5, pp.1434 - 1473 | - |
dc.identifier.wosid | 000495675700001 | - |
dc.citation.endPage | 1473 | - |
dc.citation.number | 5 | - |
dc.citation.startPage | 1434 | - |
dc.citation.title | ALGORITHMICA | - |
dc.citation.volume | 82 | - |
dc.contributor.affiliatedAuthor | Oh, E. | - |
dc.contributor.affiliatedAuthor | Ahn, H.-K. | - |
dc.identifier.scopusid | 2-s2.0-85075140523 | - |
dc.description.journalClass | 1 | - |
dc.description.journalClass | 1 | - |
dc.description.isOpenAccess | N | - |
dc.type.docType | Article | - |
dc.subject.keywordPlus | Computational geometry | - |
dc.subject.keywordPlus | Graphic methods | - |
dc.subject.keywordPlus | Best-known algorithms | - |
dc.subject.keywordPlus | Geodesic metric | - |
dc.subject.keywordPlus | Simple polygon | - |
dc.subject.keywordPlus | Time algorithms | - |
dc.subject.keywordPlus | Voronoi diagrams | - |
dc.subject.keywordPlus | Geodesy | - |
dc.subject.keywordAuthor | Farthest-point Voronoi diagram | - |
dc.subject.keywordAuthor | Geodesic metric | - |
dc.subject.keywordAuthor | Simple polygon | - |
dc.relation.journalWebOfScienceCategory | Computer Science, Software Engineering | - |
dc.relation.journalWebOfScienceCategory | Mathematics, Applied | - |
dc.description.journalRegisteredClass | scie | - |
dc.description.journalRegisteredClass | scopus | - |
dc.relation.journalResearchArea | Computer Science | - |
dc.relation.journalResearchArea | Mathematics | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.
library@postech.ac.kr Tel: 054-279-2548
Copyrights © by 2017 Pohang University of Science ad Technology All right reserved.