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

Original language | English |
---|---|

Title of host publication | International Conference on Cyberworlds 2018 |

Pages | 120-125 |

Number of pages | 6 |

Publication 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 Dive into the research topics of 'A Benchmark for Distance Measurements'. Together they form a unique fingerprint.

## Cite this

Krispel, U., Fellner, D. W., & Ullrich, T. (2018). A Benchmark for Distance Measurements. In

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