A Benchmark for Distance Measurements

Research output: Chapter in Book/Report/Conference proceedingConference contributionResearchpeer-review

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).
Original languageEnglish
Title of host publicationInternational Conference on Cyberworlds 2018
Pages120-125
Number of pages6
Publication statusPublished - 2018
EventInternational Conference on Cyberworlds 2018 - Nanyang Technological University, Singapore, Singapore
Duration: 3 Oct 20185 Oct 2018
https://cw2018.fraunhofer.sg/

Conference

ConferenceInternational Conference on Cyberworlds 2018
Abbreviated titleCyberworlds
CountrySingapore
CitySingapore
Period3/10/185/10/18
Internet address

Fingerprint

Distance measurement
Acoustic waves

Cite this

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

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

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

Research output: Chapter in Book/Report/Conference proceedingConference contributionResearchpeer-review

Krispel, U, Fellner, DW & Ullrich, T 2018, A Benchmark for Distance Measurements. in International Conference on Cyberworlds 2018. pp. 120-125, International Conference on Cyberworlds 2018, Singapore, Singapore, 3/10/18.
Krispel U, Fellner DW, Ullrich T. A Benchmark for Distance Measurements. In International Conference on Cyberworlds 2018. 2018. p. 120-125
Krispel, Ulrich ; Fellner, Dieter W. ; Ullrich, Torsten. / A Benchmark for Distance Measurements. International Conference on Cyberworlds 2018. 2018. pp. 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 -