Sciweavers

70 search results - page 5 / 14
» Convex Hulls in a 3-Dimensional Space
Sort
View
DAM
2007
84views more  DAM 2007»
13 years 7 months ago
Estimates of covering numbers of convex sets with slowly decaying orthogonal subsets
Covering numbers of precompact symmetric convex subsets of Hilbert spaces are investigated. Lower bounds are derived for sets containing orthogonal subsets with norms of their ele...
Vera Kurková, Marcello Sanguineti
SODA
1992
ACM
109views Algorithms» more  SODA 1992»
13 years 8 months ago
New Algorithms for Minimum Area k-gons
Given a set P of n points in the plane, we wish to find a set Q P of k points for which the convex hull conv(Q) has the minimum area. We solve this, and the related problem of fi...
David Eppstein
SCALESPACE
2009
Springer
14 years 2 months ago
Computational Geometry-Based Scale-Space and Modal Image Decomposition
In this paper a framework for defining scale-spaces, based on the computational geometry concepts of α-shapes, is proposed. In this approach, objects (curves or surfaces) of incr...
Anatole Chessel, Bertrand Cinquin, Sabine Bardin, ...
FMSD
2006
104views more  FMSD 2006»
13 years 7 months ago
Some ways to reduce the space dimension in polyhedra computations
Convex polyhedra are often used to approximate sets of states of programs involving numerical variables. The manipulation of convex polyhedra relies on the so-called double descri...
Nicolas Halbwachs, David Merchat, Laure Gonnord
ICRA
2005
IEEE
124views Robotics» more  ICRA 2005»
14 years 1 months ago
Sensor-based Planning for Planar Multi-Convex Rigid Bodies
— This paper presents a method for a planar rigid body consisting of multiple convex bodies to explore an unknown planar workspace, i.e., an unknown configuration space diffeomo...
Ji Yeong Lee, Howie Choset