Lebesgue's universal covering problem
id:
lebesgue-s-universal-covering-problem-305-2085556
title:
Lebesgue's universal covering problem
text:
Lebesgue's universal covering problem is an unsolved problem in geometry that asks for the convex shape of smallest area that can cover every planar set of diameter one. The diameter of a set by definition is the least upper bound of the distances between all pairs of points in the set. A shape covers a set if it contains a congruent subset. In other words the set may be rotated, translated or reflected to fit inside the shape.
brand slug:
wiki
category slug:
encyclopedia
description:
Unsolved geometry problem
original url:
https://en.wikipedia.org/wiki/Lebesgue%27s_universal_covering_problem
date created:
date modified:
2023-02-25T22:07:43Z
main entity:
{"identifier":"Q28456108","url":"https://www.wikidata.org/entity/Q28456108"}
image:
{"content_url":"https://upload.wikimedia.org/wikipedia/commons/e/e1/Lebesgue-circle-triangle.svg","width":231,"height":324}
fields total:
13
integrity:
15