Universal convex covering problems under translation and discrete rotations

11/27/2022
by   Mook Kwon Jung, et al.
0

We consider the smallest-area universal covering of planar objects of perimeter 2 (or equivalently closed curves of length 2) allowing translation and discrete rotations. In particular, we show that the solution is an equilateral triangle of height 1 when translation and discrete rotation of π are allowed. Our proof is purely geometric and elementary. We also give convex coverings of closed curves of length 2 under translation and discrete rotations of multiples of π/2 and 2π/3. We show a minimality of the covering for discrete rotation of multiples of π/2, which is an equilateral triangle of height smaller than 1, and conjecture that the covering is the smallest-area convex covering. Finally, we give the smallest-area convex coverings of all unit segments under translation and discrete rotations 2π/k for all integers k≥ 3.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/01/2019

A convex cover for closed unit curves has area at least 0.0975

We combine geometric methods with numerical box search algorithm to show...
research
01/20/2018

A smaller cover for closed unit curves

Forty years ago Schaer and Wetzel showed that a 1/π×1/2π√(π^2-4) rectang...
research
12/24/2017

Largest and Smallest Area Triangles on a Given Set of Imprecise Points

In this paper we study the following problem: we are given a set of impr...
research
11/04/2022

Smallest covering regions and highest density regions for discrete distributions

This paper examines the problem of computing a canonical smallest coveri...
research
12/24/2017

Largest and Smallest Area Triangles on Imprecise Points

Assume we are given a set of parallel line segments in the plane, and we...
research
08/09/2023

An explicit construction of Kaleidocycles

We model a family of closed kinematic chains, known as Kaleidocycles, wi...

Please sign up or login with your details

Forgot password? Click here to reset