Largest triangle inside a terrain

DOI10.1016/J.TCS.2020.12.018MaRDI QIDQ2222094zbMATH OpenOpenAlexFDO

Authors Arun Kumar Das, Sandip Das, Joydeep Mukherjee

Publication date 3 February 2021

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2020.12.018

zbMATH Keywords

approximation algorithmscomputational geometrygeometric optimisationinclusion problemterrain

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25)

Recommendations

• Largest triangles in a polygon
• FINDING PLANAR REGIONS IN A TERRAIN – IN PRACTICE AND WITH A GUARANTEE
• Finding planar regions in a terrain -- in practice and with a guarantee
• Linear algorithm to find the largest intriangles of a planar convex polygon
• Largest and smallest area triangles on imprecise points

Cites work

• A PARALLEL ALGORITHM FOR ENCLOSED AND ENCLOSING TRIANGLES
• A polynomial solution for the Potato-peeling problem
• Circumscribing a convex polygon by a polygon of fewer sides with minimal area addition
• Euclidean shortest paths in the presence of rectilinear barriers
• Finding large sticks and potatoes in polygons
• Finding largest rectangles in convex polygons
• scientific article; zbMATH DE number 1049272 (Why is no real title available?)
• scientific article; zbMATH DE number 1433426 (Why is no real title available?)
• Maximum-area triangle in a convex polygon, revisited
• Minimum-area enclosing triangle with a fixed angle
• 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
• Peeling potatoes near-optimally in near-linear time
• Ray shooting in polygons using geodesic triangulations
• Shortest Paths Help Solve Geometric Optimization Problems in Planar Regions

Cited in

(7)

• Computing large planar regions in terrains, with an application to fracture surfaces
• Largest triangles in a polygon
• Finding planar regions in a terrain -- in practice and with a guarantee
• Largest area parallelogram inside a digital object in a triangular grid
• Large \(k\)-gons in a 1.5D terrain
• Finding a largest-area triangle in a terrain in near-linear time
• Finding a largest-area triangle in a terrain in near-linear time

This page was built for publication: Largest triangle inside a terrain

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2222094)