A Benchmark for Distance Measurements

Publikation: Beitrag in Buch/Bericht/KonferenzbandBeitrag in einem KonferenzbandForschungBegutachtung

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).
Originalspracheenglisch
TitelInternational Conference on Cyberworlds 2018
Seiten120-125
Seitenumfang6
PublikationsstatusVeröffentlicht - 2018
VeranstaltungInternational Conference on Cyberworlds 2018 - Nanyang Technological University, Singapore, Singapur
Dauer: 3 Okt 20185 Okt 2018
https://cw2018.fraunhofer.sg/

Konferenz

KonferenzInternational Conference on Cyberworlds 2018
KurztitelCyberworlds
LandSingapur
OrtSingapore
Zeitraum3/10/185/10/18
Internetadresse

Fingerprint

Distance measurement
Acoustic waves

Dies zitieren

Krispel, U., Fellner, D. W., & Ullrich, T. (2018). A Benchmark for Distance Measurements. in International Conference on Cyberworlds 2018 (S. 120-125)

A Benchmark for Distance Measurements. / Krispel, Ulrich; Fellner, Dieter W.; Ullrich, Torsten.

International Conference on Cyberworlds 2018. 2018. S. 120-125.

Publikation: Beitrag in Buch/Bericht/KonferenzbandBeitrag in einem KonferenzbandForschungBegutachtung

Krispel, U, Fellner, DW & Ullrich, T 2018, A Benchmark for Distance Measurements. in International Conference on Cyberworlds 2018. S. 120-125, Singapore, Singapur, 3/10/18.
Krispel U, Fellner DW, Ullrich T. A Benchmark for Distance Measurements. in International Conference on Cyberworlds 2018. 2018. S. 120-125
Krispel, Ulrich ; Fellner, Dieter W. ; Ullrich, Torsten. / A Benchmark for Distance Measurements. International Conference on Cyberworlds 2018. 2018. S. 120-125
@inproceedings{948679dd3c6b4ffb952326a5f323e6de,
title = "A Benchmark for Distance Measurements",
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 casesignificantly.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).",
author = "Ulrich Krispel and Fellner, {Dieter W.} and Torsten Ullrich",
year = "2018",
language = "English",
pages = "120--125",
booktitle = "International Conference on Cyberworlds 2018",

}

TY - GEN

T1 - A Benchmark for Distance Measurements

AU - Krispel, Ulrich

AU - Fellner, Dieter W.

AU - Ullrich, Torsten

PY - 2018

Y1 - 2018

N2 - 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 casesignificantly.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).

AB - 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 casesignificantly.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).

M3 - Conference contribution

SP - 120

EP - 125

BT - International Conference on Cyberworlds 2018

ER -