Sciweavers

23 search results - page 3 / 5
» On Stable Line Segments in Triangulations
Sort
View
COMPGEOM
2011
ACM
14 years 1 months ago
Three problems about dynamic convex hulls
We present three results related to dynamic convex hulls: • A fully dynamic data structure for maintaining a set of n points in the plane so that we can find the edges of the c...
Timothy M. Chan
ICIAR
2005
Springer
15 years 3 months ago
Marrying Level Lines for Stereo or Motion
Efficient matching methods are crucial in Image Processing. In the present paper we outline a novel algorithm of ”stable marriages” that is also fair and globally satisfactory ...
Nikom Suvonvorn, Samia Bouchafa, Bertrand Zavidovi...
CVPR
2009
IEEE
16 years 4 months ago
StaRSaC: Stable Random Sample Consensus for Parameter Estimation
We address the problem of parameter estimation in presence of both uncertainty and outlier noise. This is a common occurrence in computer vision: feature localization is perform...
Jongmoo Choi, Gérard G. Medioni
ICIP
2001
IEEE
15 years 11 months ago
A new efficient algorithm for fitting of rectangles and squares
In this paper, we introduce a completely new approach to fitting rectangles and squares to given closed regions using our published ideas in [6], [7], [8]. In these papers, we hav...
Herbert Süße, Klaus Voss
ICRA
1994
IEEE
111views Robotics» more  ICRA 1994»
15 years 1 months ago
From Spider Robots to Half Disk Robots
We study the problem of computing the set F of accessible and stable placements of a spider robot. The body of this robot is a single point and the legs are line segments attached...
Jean-Daniel Boissonnat, Olivier Devillers, Sylvain...