ON COMPUTING ENCLOSING ISOSCELES TRIANGLES AND RELATED PROBLEMS

DOI10.1142/S0218195911003536zbMath1221.65058MaRDI QIDQ3007722

Carlos Seara, Prosenjit Bose, Saurabh Sethia, Mercè Mora

Publication date: 17 June 2011

Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)

zbMATH Keywords

volumeareasurface areaperimetergeometric structureenclosing isosceles triangle

Mathematics Subject Classification ID

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

Related Items

Isoperimetric triangular enclosures with a fixed angle, Minimum-area enclosing triangle with a fixed angle, Separating Bichromatic Point Sets by Minimal Triangles with a Fixed Angle, Scandinavian thins on top of cake: new and improved algorithms for stacking and packing

Cites Work

• Unnamed Item
• On the ball spanned by balls
• Some aperture-angle optimization problems
• Aperture-angle optimization problems in three dimensions
• Finding the smallest triangles containing a given convex polygon
• Computing the width of a set
• Enclosing a Set of Objects by Two Minimum Area Rectangles
• APPROXIMATING THE DIAMETER, WIDTH, SMALLEST ENCLOSING CYLINDER, AND MINIMUM-WIDTH ANNULUS
• SOME LOWER BOUNDS ON GEOMETRIC SEPARABILITY PROBLEMS