DC Field | Value | Language |
---|---|---|
dc.contributor.author | Oh, E. | - |
dc.contributor.author | Ahn, H.-K. | - |
dc.date.accessioned | 2020-02-27T00:50:08Z | - |
dc.date.available | 2020-02-27T00:50:08Z | - |
dc.date.created | 2019-03-26 | - |
dc.date.issued | 2020-03 | - |
dc.identifier.issn | 0179-5376 | - |
dc.identifier.uri | https://oasis.postech.ac.kr/handle/2014.oak/101204 | - |
dc.description.abstract | Given a set of sites in a simple polygon, a geodesic Voronoi diagram of the sites partitions the polygon into regions based on distances to sites under the geodesic metric. We present algorithms for computing the geodesic nearest-point, higher-order and farthest-point Voronoi diagrams of m point sites in a simple n-gon, which improve the best known ones for m <= n/polylog n. Moreover, the algorithms for the geodesic nearest-point and farthest-point Voronoi diagrams are optimal for m <= n/polylog n. This partially answers a question posed by Mitchell in the Handbook of Computational Geometry. | - |
dc.language | English | - |
dc.publisher | SPRINGER | - |
dc.relation.isPartOf | DISCRETE & COMPUTATIONAL GEOMETRY | - |
dc.title | Voronoi Diagrams for a Moderate-Sized Point-Set in a Simple Polygon | - |
dc.type | Article | - |
dc.identifier.doi | 10.1007/s00454-019-00063-4 | - |
dc.type.rims | ART | - |
dc.identifier.bibliographicCitation | DISCRETE & COMPUTATIONAL GEOMETRY, v.63, no.2, pp.418 - 454 | - |
dc.identifier.wosid | 000511936600006 | - |
dc.citation.endPage | 454 | - |
dc.citation.number | 2 | - |
dc.citation.startPage | 418 | - |
dc.citation.title | DISCRETE & COMPUTATIONAL GEOMETRY | - |
dc.citation.volume | 63 | - |
dc.contributor.affiliatedAuthor | Ahn, H.-K. | - |
dc.identifier.scopusid | 2-s2.0-85062708699 | - |
dc.description.journalClass | 1 | - |
dc.description.journalClass | 1 | - |
dc.description.isOpenAccess | N | - |
dc.type.docType | Article | - |
dc.subject.keywordAuthor | Geodesic distance | - |
dc.subject.keywordAuthor | Simple Polygons | - |
dc.subject.keywordAuthor | Voronoi diagrams | - |
dc.relation.journalWebOfScienceCategory | Computer Science, Theory & Methods | - |
dc.relation.journalWebOfScienceCategory | Mathematics | - |
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.