985 search results - page 8 / 197 » Piercing Convex Sets |
SIAMJO
2000
13 years 7 months ago
2000
Let F be a compact subset of the n-dimensional Euclidean space Rn represented by (finitely or infinitely many) quadratic inequalities. We propose two methods, one based on successi...
ICRA
2009
IEEE
14 years 2 months ago
2009
IEEE
— In a wide range of applications the orientation of a rigid body does not need to be restricted to one given orientation, but can be given as a continuous set of frames. We addr...
TCS
2008
13 years 7 months ago
2008
Filling operations are procedures which are used in Discrete Tomography for the reconstruction of lattice sets having some convexity constraints. Many algorithms have been publish...
DGCI
2006
Springer
13 years 9 months ago
2006
Springer
Filling operations are procedures which are used in Discrete Tomography for the reconstruction of lattice sets having some convexity constraints. In [1], an algorithm which perform...
ORDER
2011
13 years 2 months ago
2011
We prove a Hadwiger transversal type result, characterizing convex position on a family of non-crossing convex bodies in the plane. This theorem suggests a definition for the ord...