Large \(k\)-gons in a 1.5D terrain
From MaRDI portal
Publication:6168930
DOI10.1007/978-3-031-22105-7_5arXiv2206.02396OpenAlexW4313350927MaRDI QIDQ6168930
Publication date: 10 August 2023
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2206.02396
Cites Work
- Unnamed Item
- Unnamed Item
- Finding the largest area axis-parallel rectangle in a polygon
- Finding a largest-area triangle in a terrain in near-linear time
- Largest and smallest convex hulls for imprecise points
- A polynomial solution for the Potato-peeling problem
- Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
- On the largest convex polygon contained in a non-convex n-gon, or how to peel a potato
- Optimal shortest path queries in a simple polygon
- Largest triangle inside a terrain
- An algorithm for generalized point location and its applications
- Finding large sticks and potatoes in polygons
- Peeling Potatoes Near-Optimally in Near-Linear Time
This page was built for publication: Large \(k\)-gons in a 1.5D terrain
