Duality between Lines and Points
Fuente:
arXiv
Enregistré dans:
| Auteur principal: | |
|---|---|
| Format: | Preprint |
| Publié: |
2025
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866915453660561408 |
|---|---|
| author | Saxena, Sanjeev |
| author_facet | Saxena, Sanjeev |
| contents | There are several notions of duality between lines and points. In this note, it is shown that all these can be studied in a unified way. Most interesting properties are independent of specific choices.
It is also shown that either dual mapping can be its own inverse or it can preserve relative order (but not both).
Generalisation to higher dimensions is also discussed. An elementary and very intuitive treatment of relationship between arrangements in $d+1$ dimensions and searching for $k$-nearest neighbour in $d$-dimensions is also given. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2503_17372 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Duality between Lines and Points Saxena, Sanjeev Computational Geometry Data Structures and Algorithms There are several notions of duality between lines and points. In this note, it is shown that all these can be studied in a unified way. Most interesting properties are independent of specific choices. It is also shown that either dual mapping can be its own inverse or it can preserve relative order (but not both). Generalisation to higher dimensions is also discussed. An elementary and very intuitive treatment of relationship between arrangements in $d+1$ dimensions and searching for $k$-nearest neighbour in $d$-dimensions is also given. |
| title | Duality between Lines and Points |
| topic | Computational Geometry Data Structures and Algorithms |
| url | https://arxiv.org/abs/2503.17372 |