Capturing the Shape of a Point Set With a Line Segment

Authors

  • Nathan van Beusekom TU Eindhoven
  • Marc van Kreveld Utrecht University
  • Max van Mulken TU Eindhoven
  • Marcel Roeloffzen TU Eindhoven
  • Bettina Speckmann TU Eindhoven
  • Jules Wulms TU Eindhoven

DOI:

https://doi.org/10.57717/cgt.v4i1.74

Abstract

Detecting location-correlated groups in point sets is an important task in a wide variety of applications areas. In addition to merely detecting such groups, the group's shape carries meaning as well. In this paper, we represent a group's shape using a simple geometric object, a line segment. Specifically, given a radius r, we say a line segment is representative of a point set P of n points if it is within distance r of each point p in P. We aim to find the shortest such line segment. This problem is equivalent to stabbing a set of circles of radius r using the shortest line segment. We describe an algorithm to find the shortest representative segment in O(n log h + h log3 h) time, where h is the size of the convex hull of P. Additionally, we show how to maintain a stable approximation of the shortest representative segment when the points in P move.

Downloads

Published

2025-12-09

How to Cite

van Beusekom, N., van Kreveld, M., van Mulken, M., Roeloffzen, M., Speckmann, B., & Wulms, J. (2025). Capturing the Shape of a Point Set With a Line Segment. Computing in Geometry and Topology, 4(1), 10:1–10:35. https://doi.org/10.57717/cgt.v4i1.74

Issue

Section

Original Research Articles

Categories