Optimal Embedded and Enclosing Isosceles Triangles
From MaRDI portal
Publication:6066459
DOI10.1142/s012905412342008xzbMath1526.51012arXiv2205.11637WikidataQ128993284 ScholiaQ128993284MaRDI QIDQ6066459
Gergely Kiss, Gábor Somlai, János Pach, Unnamed Author, Mónika Csikós
Publication date: 16 November 2023
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2205.11637
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Minimum-area enclosing triangle with a fixed angle
- Convex disks can cover their shadow
- Maximum-area triangle in a convex polygon, revisited
- Minimum-volume enclosing ellipsoids and core sets
- Circumscribed polygons of small area
- Can you cover your shadows?
- Triangle in a triangle: On a problem of Steinhaus
- Geometric algorithms and combinatorial optimization
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Implementation of linear minimum area enclosing triangle algorithm. Application note
- Largest triangles in a polygon
- On the minimal volume of simplices enclosing a convex body
- Finding Extremal Polygons
- Finding minimal enclosing boxes
- Equilateral Triangles and Triangles
- On the regularity of the growth of the modulus and argument of an entire function in the metric of L p [0, 2π]
- Minimum-Area ellipse containing a finite set of points. II
- On Triangles Circumscribing Plane Convex Sets
- On minimum circumscribed polygons
- Geometry. I, II. Transl. from the French by M. Cole and S. Levy
This page was built for publication: Optimal Embedded and Enclosing Isosceles Triangles
