Dynamic Voronoi Diagram for Moving Disks
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Song, Chanyoung | - |
dc.contributor.author | Cha, Jehyun | - |
dc.contributor.author | Lee, Mokwon | - |
dc.contributor.author | Kim, Deok-Soo | - |
dc.date.accessioned | 2021-07-30T04:43:43Z | - |
dc.date.available | 2021-07-30T04:43:43Z | - |
dc.date.created | 2021-07-14 | - |
dc.date.issued | 2021-06 | - |
dc.identifier.issn | 1077-2626 | - |
dc.identifier.uri | https://scholarworks.bwise.kr/hanyang/handle/2021.sw.hanyang/1108 | - |
dc.description.abstract | Voronoi diagrams are powerful for understanding spatial properties. However, few reports have been made for moving generators despite their important applications. We present a topology-oriented event-increment (TOI-E) algorithm for constructing a Voronoi diagram of moving circular disks in the plane over the time horizon [0, t(infinity)) . The proposed TOI-E algorithm computes the event history of the Voronoi diagram over the entire time horizon in O (k(F)log n + k(C)nlog n) time with O(nlog n) preprocessing time and O(n + k(F) + k(C)) memory for n disk generators, k(F) edge flips, and k(C) disk collisions during the time horizon. Given an event history, the Voronoi diagram of an arbitrary moment t* < t(infinity )can be constructed in O(k* + n) time where k* represents the number of events in [0, t*) . An example of the collision avoidance problem among moving disks is given by predicting future conjunctions among the disks using the proposed algorithm. Dynamic Voronoi diagrams will be very useful as a platform for the planning and management of the traffics of unmanned vehicles such as cars on street, vessels on surface, drones and airplanes in air, and satellites in geospace. | - |
dc.language | 영어 | - |
dc.language.iso | en | - |
dc.publisher | IEEE COMPUTER SOC | - |
dc.title | Dynamic Voronoi Diagram for Moving Disks | - |
dc.type | Article | - |
dc.contributor.affiliatedAuthor | Kim, Deok-Soo | - |
dc.identifier.doi | 10.1109/TVCG.2019.2959321 | - |
dc.identifier.scopusid | 2-s2.0-85091843075 | - |
dc.identifier.wosid | 000649620700012 | - |
dc.identifier.bibliographicCitation | IEEE TRANSACTIONS ON VISUALIZATION AND COMPUTER GRAPHICS, v.27, no.6, pp.2923 - 2940 | - |
dc.relation.isPartOf | IEEE TRANSACTIONS ON VISUALIZATION AND COMPUTER GRAPHICS | - |
dc.citation.title | IEEE TRANSACTIONS ON VISUALIZATION AND COMPUTER GRAPHICS | - |
dc.citation.volume | 27 | - |
dc.citation.number | 6 | - |
dc.citation.startPage | 2923 | - |
dc.citation.endPage | 2940 | - |
dc.type.rims | ART | - |
dc.type.docType | Article | - |
dc.description.journalClass | 1 | - |
dc.description.isOpenAccess | Y | - |
dc.description.journalRegisteredClass | scie | - |
dc.description.journalRegisteredClass | scopus | - |
dc.relation.journalResearchArea | Computer Science | - |
dc.relation.journalWebOfScienceCategory | Computer Science, Software Engineering | - |
dc.subject.keywordPlus | COLLISION-AVOIDANCE | - |
dc.subject.keywordPlus | SEARCH ALGORITHM | - |
dc.subject.keywordPlus | CIRCLE SET | - |
dc.subject.keywordPlus | POINT SET | - |
dc.subject.keywordPlus | PACKING | - |
dc.subject.keywordPlus | EVACUATION | - |
dc.subject.keywordPlus | MODEL | - |
dc.subject.keywordAuthor | Unmanned vehicles | - |
dc.subject.keywordAuthor | moving vehicles | - |
dc.subject.keywordAuthor | path planning | - |
dc.subject.keywordAuthor | collision avoidance | - |
dc.subject.keywordAuthor | topology event | - |
dc.subject.keywordAuthor | weighted Voronoi diagram | - |
dc.identifier.url | https://ieeexplore.ieee.org/document/8933488 | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
222, Wangsimni-ro, Seongdong-gu, Seoul, 04763, Korea+82-2-2220-1365
COPYRIGHT © 2021 HANYANG UNIVERSITY.
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.