Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | 김덕수 | - |
dc.date.accessioned | 2022-11-24T01:41:57Z | - |
dc.date.available | 2022-11-24T01:41:57Z | - |
dc.date.issued | 2021-06 | - |
dc.identifier.citation | IEEE TRANSACTIONS ON VISUALIZATION AND COMPUTER GRAPHICS, v. 27, NO. 6, Page. 2923-2940 | en_US |
dc.identifier.issn | 1077-2626;1941-0506 | en_US |
dc.identifier.uri | https://ieeexplore.ieee.org/document/8933488 | en_US |
dc.identifier.uri | https://repository.hanyang.ac.kr/handle/20.500.11754/177348 | - |
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. | en_US |
dc.description.sponsorship | This work was supported by the National Research Foundation of Korea (MSIT) [Nos. 2017R1A3B1023591 and 2016 K1A4A3914691]. C. Song and J. Cha contributed equally to this work. | en_US |
dc.language | en | en_US |
dc.publisher | IEEE COMPUTER SOC | en_US |
dc.subject | Unmanned vehicles | en_US |
dc.subject | moving vehicles | en_US |
dc.subject | path planning | en_US |
dc.subject | collision avoidance | en_US |
dc.subject | topology event | en_US |
dc.subject | weighted Voronoi diagram | en_US |
dc.title | Dynamic Voronoi Diagram for Moving Disks | en_US |
dc.type | Article | en_US |
dc.relation.no | 6 | - |
dc.relation.volume | 27 | - |
dc.identifier.doi | 10.1109/TVCG.2019.2959321 | en_US |
dc.relation.page | 2923-2940 | - |
dc.relation.journal | IEEE TRANSACTIONS ON VISUALIZATION AND COMPUTER GRAPHICS | - |
dc.contributor.googleauthor | Song, Chanyoung | - |
dc.contributor.googleauthor | Cha, Jehyun | - |
dc.contributor.googleauthor | Lee, Mokwon | - |
dc.contributor.googleauthor | Kim, Deok-Soo | - |
dc.sector.campus | S | - |
dc.sector.daehak | 공과대학 | - |
dc.sector.department | 기계공학부 | - |
dc.identifier.pid | dskim | - |
dc.identifier.orcid | https://orcid.org/0000-0001-7855-2604 | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.