Indecomposable Coverings with Homothetic Polygons
Author:
- 2 April 2015
- journal article
- Published by Springer Nature in Discrete & Computational Geometry
- Vol. 53 (4) , 817-824
Abstract
No abstract availableKeywords
All Related Versions
This publication has 9 references indexed in Scilit:
- Convex Polygons are Self-CoverableDiscrete & Computational Geometry, 2014
- Survey on Decomposition of Multiple Coverings2013
- Octants Are Cover-DecomposableDiscrete & Computational Geometry, 2011
- Indecomposable Coverings with Concave PolygonsDiscrete & Computational Geometry, 2009
- Convex Polygons are Cover-DecomposableDiscrete & Computational Geometry, 2009
- Multiple Coverings of the Plane with TrianglesDiscrete & Computational Geometry, 2007
- Indecomposable CoveringsLecture Notes in Computer Science, 2007
- Convex Bodies: The Brunn–Minkowski Theory1993
- Covering the plane with convex polygonsDiscrete & Computational Geometry, 1986