Loading...
A Divide-and-Conquer Algorithm for Computing Voronoi Diagrams
Identifying the closest of a set of locations typically requires computing the distance to each of these locations, given a current position. However, Voronoi Diagrams precompute the geometric areas that each of these locations is closest to in order to ameliorate the cost of computing distances lat...
Na minha lista:
| Udgivet i: | IEEE Int Conf Electro Inf Technol |
|---|---|
| Main Authors: | , , |
| Format: | Artigo |
| Sprog: | Inglês |
| Udgivet: |
2020
|
| Fag: | |
| Online adgang: | https://ncbi.nlm.nih.gov/pmc/articles/PMC7840081/ https://ncbi.nlm.nih.gov/pubmed/33510934 https://ncbi.nlm.nih.govhttp://dx.doi.org/10.1109/eit48999.2020.9208270 |
| Tags: |
Tilføj Tag
Ingen Tags, Vær først til at tagge denne postø!
|