A compactness lemma for convex plane sets
Views: 28 / PDF downloads: 10
Keywords:
compact, finite subcover, dissection, lattice pointsAbstract
Given a closed bounded convex plane set covered by a family of open sets, we show that there is a finite dissection of the convex set into convex subsets, each of which lies within some open set of the covering.
Downloads
Published
																			2011-09-30
																	
				How to Cite
Huxley, M. (2011). A compactness lemma for convex plane sets. Eurasian Mathematical Journal, 2(3). Retrieved from https://emj.enu.kz/index.php/main/article/view/97
Issue
Section
								Articles
							
						 
							


