Article
Cited 0 time in 
Cited 0 time in 
Cited 0 time in
Metadata Downloads
Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Oh, E. | - |
| dc.contributor.author | AHN, HEE KAP | - |
| dc.date.accessioned | 2021-12-03T04:04:22Z | - |
| dc.date.available | 2021-12-03T04:04:22Z | - |
| dc.date.created | 2018-07-18 | - |
| dc.date.issued | 2017-03 | - |
| dc.identifier.issn | 0302-9743 | - |
| dc.identifier.uri | https://oasis.postech.ac.kr/handle/2014.oak/107801 | - |
| dc.description.abstract | We present an O(n2 log4 n)-time algorithm for computing the center region of a set of n points in the three-dimensional Euclidean space. This improves the previously best known algorithm by Agarwal, Sharir and Welzl, which takes O(n2+��) time for any �� > 0. It is known that the complexity of the center region is ��(n2), thus our algorithm is almost tight. The second problem we consider is computing a colored version of the center region in the two-dimensional Euclidean space. We present an O(n log4 n)-time algorithm for this problem. ? Springer International Publishing AG 2017. | - |
| dc.language | English | - |
| dc.publisher | Springer Verlag | - |
| dc.relation.isPartOf | Lecture Notes in Computer Science | - |
| dc.title | Computing the center region and its variants | - |
| dc.type | Article | - |
| dc.identifier.doi | 10.1007/978-3-319-53925-6_20 | - |
| dc.type.rims | ART | - |
| dc.identifier.bibliographicCitation | Lecture Notes in Computer Science, v.10167 LNCS, pp.254 - 265 | - |
| dc.identifier.wosid | 000413067200020 | - |
| dc.citation.endPage | 265 | - |
| dc.citation.startPage | 254 | - |
| dc.citation.title | Lecture Notes in Computer Science | - |
| dc.citation.volume | 10167 LNCS | - |
| dc.contributor.affiliatedAuthor | Oh, E. | - |
| dc.contributor.affiliatedAuthor | AHN, HEE KAP | - |
| dc.identifier.scopusid | 2-s2.0-85014289431 | - |
| dc.description.journalClass | 1 | - |
| dc.description.journalClass | 1 | - |
| dc.description.isOpenAccess | N | - |
| dc.type.docType | Proceedings Paper | - |
| dc.subject.keywordPlus | Time algorithms | - |
| dc.subject.keywordPlus | Two dimensional Euclidean spaces | - |
| dc.subject.keywordPlus | Geometry | - |
| dc.subject.keywordPlus | Best-known algorithms | - |
| dc.subject.keywordPlus | Euclidean spaces | - |
| dc.subject.keywordPlus | Artificial intelligence | - |
| dc.subject.keywordPlus | Computer science | - |
| dc.subject.keywordPlus | Computers | - |
| dc.relation.journalWebOfScienceCategory | Computer Science, Theory & Methods | - |
| dc.relation.journalWebOfScienceCategory | Mathematics | - |
| dc.description.journalRegisteredClass | scie | - |
| dc.description.journalRegisteredClass | scopus | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.
Communities & Collection
Related Researcher
- 안희갑AHN, HEE-KAP
- Grad. School of AI