Finding a largest-area triangle in a terrain in near-linear time

DOI10.1007/978-3-030-83508-8_19OpenAlexW3196805238MaRDI QIDQ832865

Joydeep Mukherjee, Sandip Das, Sergio Cabello, Arun Kumar Das

Publication date: 25 March 2022

Full work available at URL: https://arxiv.org/abs/2104.11420

zbMATH Keywords

terraininclusion problemgeometric optimisationhereditary segment tree

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Data structures (68P05)

Related Items (1)

Large \(k\)-gons in a 1.5D terrain

Cites Work

• Unnamed Item
• Unnamed Item
• Maximum-area triangle in a convex polygon, revisited
• Finding largest rectangles in convex polygons
• A polynomial solution for the Potato-peeling problem
• Geometric applications of a matrix-searching algorithm
• 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
• Algorithms for bichromatic line-segment problems and polyhedral terrains
• Largest triangle inside a terrain
• Finding Extremal Polygons
• Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms
• Finding large sticks and potatoes in polygons
• Shortest Paths Help Solve Geometric Optimization Problems in Planar Regions
• A PARALLEL ALGORITHM FOR ENCLOSED AND ENCLOSING TRIANGLES
• Peeling Potatoes Near-Optimally in Near-Linear Time

This page was built for publication: Finding a largest-area triangle in a terrain in near-linear time