Convex Polygons are Self-Coverable
Authors:
- Balázs KeszeghBKBalázs Keszegh
- Dömötör PálvölgyiDPDömötör Pálvölgyi
Open Access
- 18 April 2014
- journal article
- Published by Springer Nature in Discrete & Computational Geometry
- Vol. 51 (4) , 885-895
Abstract
No abstract availableKeywords
All Related Versions
This publication has 2 references indexed in Scilit:
- Octants Are Cover-DecomposableDiscrete & Computational Geometry, 2011
- Concrete and Abstract Voronoi Diagrams1989