Smallest universal covers for families of triangles

DOI10.1016/j.comgeo.2020.101686zbMath1471.52017OpenAlexW3041276582MaRDI QIDQ827315

Ji-won Park, Otfried Schwarzkopf

Publication date: 7 January 2021

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

Full work available at URL: https://hal.inria.fr/hal-02972966/file/eurocg20_paper_51.pdf

zbMATH Keywords

unit circleuniversal covertrianglessmallest areaconvex cover

Mathematics Subject Classification ID

Packing and covering in (2) dimensions (aspects of discrete geometry) (52C15)

Related Items (1)

Universal convex covering problems under translations and discrete rotations

Cites Work

• Unnamed Item
• A generalization of the convex Kakeya problem
• Largest placement of one convex polygon inside another
• The smallest convex cover for triangles of perimeter two
• The smallest triangular cover for triangles of diameter one
• The Lebesgue universal covering problem
• Research Problems in Discrete Geometry
• Fits and Covers
• A LOWER BOUND FOR LEBESGUE'S UNIVERSAL COVER PROBLEM

This page was built for publication: Smallest universal covers for families of triangles