Item Infomation
Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Kolja, Junginger | - |
| dc.contributor.author | Evanthia, Papadopoulou | - |
| dc.date.accessioned | 2023-04-05T02:17:16Z | - |
| dc.date.available | 2023-04-05T02:17:16Z | - |
| dc.date.issued | 2023 | - |
| dc.identifier.uri | https://link.springer.com/article/10.1007/s00454-022-00463-z | - |
| dc.identifier.uri | https://dlib.phenikaa-uni.edu.vn/handle/PNK/7523 | - |
| dc.description | CC BY | vi |
| dc.description.abstract | Updating an abstract Voronoi diagram in linear time, after deletion of one site, has been an open problem in a long time; similarly, for any concrete Voronoi diagram of generalized (non-point) sites. In this paper we present a simple, expected linear-time algorithm to update an abstract Voronoi diagram after deletion of one site. To achieve this result, we use the concept of a Voronoi-like diagram, a relaxed Voronoi structure of independent interest. Voronoi-like diagrams serve as intermediate structures, which are considerably simpler to compute, thus, making an expected linear-time construction possible. | vi |
| dc.language.iso | en | vi |
| dc.publisher | Springer | vi |
| dc.subject | Voronoi diagram | vi |
| dc.subject | Voronoi-like diagrams | vi |
| dc.title | Deletion in Abstract Voronoi Diagrams in Expected Linear Time and Related Problems | vi |
| dc.type | Book | vi |
| Appears in Collections | OER - Khoa học Tự nhiên | |
Files in This Item:
