Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Bounded boxes, Hausdorff distance, and a new proof of an interesting Hellytype theorem.
 

Summary: Bounded boxes, Hausdorff distance, and a new proof of an interesting
Helly­type theorem.
Nina Amenta \Lambda
The Geometry Center
1300 South Second Street
Minneapolis, MN. 55454
Abstract
In the first part of this paper, we reduce two geometric
optimization problems to convex programming: find­
ing the largest axis­aligned box in the intersection of a
family of convex sets, and finding the translation and
scaling that minimizes the Hausdorff distance between
two polytopes. These reductions imply that important
cases of these problems can be solved in expected linear
time. In the second part of the paper, we use convex
programming to give a new, short proof of an interest­
ing Helly­type theorem, first conjectured by Gr¨unbaum
and Motzkin.
1 Introduction
Linear programming is a popular tool in computa­

  

Source: Amenta, Nina - Department of Computer Science, University of California, Davis

 

Collections: Biology and Medicine; Computer Technologies and Information Sciences