Minimum-area enclosing triangle with a fixed angle

DOI10.1016/j.comgeo.2013.07.002zbMath1287.65012arXiv1009.3006OpenAlexW1992151444MaRDI QIDQ390370

Prosenjit Bose, Jean-Lou De Carufel

Publication date: 8 January 2014

Published in: Computational Geometry (Search for Journal in Brave)

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

zbMATH Keywords

geometric constraintsgeometric optimizationenclosing problemminimum area triangle

Mathematics Subject Classification ID

Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Related Items (5)

Isoperimetric triangular enclosures with a fixed angle ⋮ Optimal Embedded and Enclosing Isosceles Triangles ⋮ Separating Bichromatic Point Sets by Minimal Triangles with a Fixed Angle ⋮ Largest triangle inside a terrain ⋮ An algorithm to find maximum area polygons circumscribed about a convex polygon

Cites Work

• Unnamed Item
• On enclosing k points by a circle
• Geometric complexity of some location problems
• Computing the smallest \(k\)-enclosing circle and related problems
• ON COMPUTING ENCLOSING ISOSCELES TRIANGLES AND RELATED PROBLEMS
• Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems
• Finding the smallest triangles containing a given convex polygon
• An optimal algorithm for finding minimal enclosing triangles

This page was built for publication: Minimum-area enclosing triangle with a fixed angle