Finding a Largest-Area Triangle in a Terrain in Near-Linear Time
Fuente:
arXiv
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Preprint |
| Published: |
2021
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866912231057260544 |
|---|---|
| author | Cabello, Sergio Das, Arun Kumar Das, Sandip Mukherjee, Joydeep |
| author_facet | Cabello, Sergio Das, Arun Kumar Das, Sandip Mukherjee, Joydeep |
| contents | A terrain is an $x$-monotone polygon whose lower boundary is a single line segment. We present an algorithm to find in a terrain a triangle of largest area in $O(n \log n)$ time, where $n$ is the number of vertices defining the terrain. The best previous algorithm for this problem has a running time of $O(n^2)$. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2104_11420 |
| institution | arXiv |
| publishDate | 2021 |
| record_format | arxiv |
| spellingShingle | Finding a Largest-Area Triangle in a Terrain in Near-Linear Time Cabello, Sergio Das, Arun Kumar Das, Sandip Mukherjee, Joydeep Computational Geometry Data Structures and Algorithms A terrain is an $x$-monotone polygon whose lower boundary is a single line segment. We present an algorithm to find in a terrain a triangle of largest area in $O(n \log n)$ time, where $n$ is the number of vertices defining the terrain. The best previous algorithm for this problem has a running time of $O(n^2)$. |
| title | Finding a Largest-Area Triangle in a Terrain in Near-Linear Time |
| topic | Computational Geometry Data Structures and Algorithms |
| url | https://arxiv.org/abs/2104.11420 |