Abstract
The need to analyze and visualize distances between objects arises in many use cases. Although the problem to calculate the distance between two polygonal objects may sound simple, real-world scenarios with large models will always be challenging, but optimization techniques – such as space partitioning – can reduce the complexity of the average case
significantly.
Our contribution to this problem is a publicly available benchmark to compare distance calculation algorithms. Furthermore, we evaluated the two most important techniques (hierarchical tree structures versus grid-based approaches).
significantly.
Our contribution to this problem is a publicly available benchmark to compare distance calculation algorithms. Furthermore, we evaluated the two most important techniques (hierarchical tree structures versus grid-based approaches).
Originalsprache | englisch |
---|---|
Titel | International Conference on Cyberworlds 2018 |
Seiten | 120-125 |
Seitenumfang | 6 |
Publikationsstatus | Veröffentlicht - 2018 |
Veranstaltung | 17th International Conference on Cyberworlds: CW 2018 - Nanyang Technological University, Singapore, Singapur Dauer: 3 Okt. 2018 → 5 Okt. 2018 https://cw2018.fraunhofer.sg/ http://www.cyberworlds-conference.org/ |
Konferenz
Konferenz | 17th International Conference on Cyberworlds |
---|---|
Kurztitel | Cyberworlds |
Land/Gebiet | Singapur |
Ort | Singapore |
Zeitraum | 3/10/18 → 5/10/18 |
Internetadresse |