Repository logo

Infoscience

  • English
  • French
Log In
Logo EPFL, École polytechnique fédérale de Lausanne

Infoscience

  • English
  • French
Log In
  1. Home
  2. Academic and Research Output
  3. Journal articles
  4. Convex polygons are cover-decomposable
 
research article

Convex polygons are cover-decomposable

Pálvölgyi, D.  
•
Tóth, G.
2010
Discrete & Computational Geometry

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.

  • Details
  • Metrics
Type
research article
DOI
10.1007/s00454-009-9133-y
Web of Science ID

WOS:000274331500001

Author(s)
Pálvölgyi, D.  
Tóth, G.
Date Issued

2010

Published in
Discrete & Computational Geometry
Volume

43

Issue

3

Start page

483

End page

496

Subjects

Multiple coverings

•

Decomposability

•

Wedges

•

Plane

Editorial or Peer reviewed

REVIEWED

Written at

EPFL

EPFL units
DCG  
Available on Infoscience
November 26, 2010
Use this identifier to reference this record
https://infoscience.epfl.ch/handle/20.500.14299/59258
Logo EPFL, École polytechnique fédérale de Lausanne
  • Contact
  • infoscience@epfl.ch

  • Follow us on Facebook
  • Follow us on Instagram
  • Follow us on LinkedIn
  • Follow us on X
  • Follow us on Youtube
AccessibilityLegal noticePrivacy policyCookie settingsEnd User AgreementGet helpFeedback

Infoscience is a service managed and provided by the Library and IT Services of EPFL. © EPFL, tous droits réservés