Publication

Convex polygons are cover-decomposable

2010
Journal paper

Abstract

We show that for any open convex polygon P, there is a constant k(P) such that any k(P)-fold covering of the plane with translates of P can be decomposed into two coverings.

Official source

https://infoscience.epfl.ch/record/158746?ln=en

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Convex polygons are cover-decomposable

Graph Chatbot

Chat with Graph Search

Quadratic serendipity element shape functions on general planar polygons

On the ‘cultural transfer’ of modern architecture northwards - Akzeptiere: Das Buch und seine Geschichte

System for planning and/or providing neuromodulation

Quadratic serendipity element shape functions on general planar polygons

System for planning and/or providing neuromodulation

On the ‘cultural transfer’ of modern architecture northwards - Akzeptiere: Das Buch und seine Geschichte