### Abstract

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

Language | English |
---|---|

Title of host publication | International Conference on Cyberworlds 2018 |

Pages | 120-125 |

Number of pages | 6 |

Status | Published - 2018 |

Event | International Conference on Cyberworlds 2018 - Nanyang Technological University, Singapore, Singapore Duration: 3 Oct 2018 → 5 Oct 2018 https://cw2018.fraunhofer.sg/ |

### Conference

Conference | International Conference on Cyberworlds 2018 |
---|---|

Abbreviated title | Cyberworlds |

Country | Singapore |

City | Singapore |

Period | 3/10/18 → 5/10/18 |

Internet address |

### Fingerprint

### Cite this

*International Conference on Cyberworlds 2018*(pp. 120-125)

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

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Research › peer-review

*International Conference on Cyberworlds 2018.*pp. 120-125, International Conference on Cyberworlds 2018, Singapore, Singapore, 3/10/18.

}

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 -