Note: This content is accessible to all versions of every browser. However, this browser does not seem to support current Web standards, preventing the display of our site's design details.

  

Polycover

Author(s):

M. Baotic, F.D. Torrisi
Conference/Journal:

vol. AUT03-11
Abstract:

This paper deals with the problem of detecting if a convex polyhedron $P$ is covered by a finite set of non-empty convex polyhedra $R_i$, $i=1,ldots,r$. Namely we want to see is $P subseteq (cup_{i=1}^r R_i)$. In this paper we focus on the case where the polytopes are given in H-representation.

Further Information
Year:

2003
Type of Publication:

(04)Technical Report
Supervisor:



No Files for download available.
% Autogenerated BibTeX entry
@TechReport { BaoTor:2003:IFA_723,
    author={M. Baotic and F.D. Torrisi},
    title={{Polycover}},
    institution={},
    year={2003},
    number={},
    address={},
    month=jun,
    url={http://control.ee.ethz.ch/index.cgi?page=publications;action=details;id=723}
}
Permanent link