Sciweavers

417 search results - page 58 / 84
» Convex Shape Decomposition
Sort
View
COCOA
2008
Springer
13 years 9 months ago
New Algorithms for k-Center and Extensions
The problem of interest is covering a given point set with homothetic copies of several convex containers C1,...,Ck, while the objective is to minimize the maximum over the dilatat...
René Brandenberg, Lucia Roth
ALGORITHMICA
2010
156views more  ALGORITHMICA 2010»
13 years 7 months ago
On Covering Problems of Rado
T. Rado conjectured in 1928 that if S is a finite set of axis-parallel squares in the plane, then there exists an independent subset I S of pairwise disjoint squares, such that I ...
Sergey Bereg, Adrian Dumitrescu, Minghui Jiang
ICIP
2000
IEEE
14 years 9 months ago
POCS-Based Image Reconstruction from Irregularly-Spaced Samples
This paper presents a method for the reconstruction of a regularlysampled image from its irregularly-spaced samples. Such reconstruction is often needed in image processing and co...
Ryszard Stasinski, Janusz Konrad
ROBIO
2006
IEEE
122views Robotics» more  ROBIO 2006»
14 years 1 months ago
Non-smooth 3D Modeling of a Snake Robot with External Obstacles
Abstract— In this paper we extend a non-smooth 3D mathematical model of a snake robot to also include external obstacles to enable obstacle aided locomotion. The model is based o...
Aksel Andreas Transeth, Remco I. Leine, Christoph ...
BVAI
2005
Springer
14 years 1 months ago
Algorithm That Mimics Human Perceptual Grouping of Dot Patterns
We propose an algorithm that groups points similarly to how human observers do. It is simple, totally unsupervised and able to find clusters of complex and not necessarily convex s...
Giuseppe Papari, Nicolai Petkov