Gespeichert in:
| Hauptverfasser: | , , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2024
|
| Schlagworte: | |
| Online-Zugang: | https://arxiv.org/abs/2402.12371 |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866917593493798912 |
|---|---|
| author | Gärtner, Bernd Rasiti, Fatime Schnider, Patrick |
| author_facet | Gärtner, Bernd Rasiti, Fatime Schnider, Patrick |
| contents | Enclosing depth is a recently introduced depth measure which gives a lower bound to many depth measures studied in the literature. So far, enclosing depth has only been studied from a combinatorial perspective. In this work, we give the first algorithms to compute the enclosing depth of a query point with respect to a data point set in any dimension. In the plane we are able to optimize the algorithm to get a runtime of O(n log n). In constant dimension, our algorithms still run in polynomial time. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2402_12371 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Computing Enclosing Depth Gärtner, Bernd Rasiti, Fatime Schnider, Patrick Computational Geometry Enclosing depth is a recently introduced depth measure which gives a lower bound to many depth measures studied in the literature. So far, enclosing depth has only been studied from a combinatorial perspective. In this work, we give the first algorithms to compute the enclosing depth of a query point with respect to a data point set in any dimension. In the plane we are able to optimize the algorithm to get a runtime of O(n log n). In constant dimension, our algorithms still run in polynomial time. |
| title | Computing Enclosing Depth |
| topic | Computational Geometry |
| url | https://arxiv.org/abs/2402.12371 |