Sciweavers

1245 search results - page 138 / 249
» Triangulation for Points on Lines
Sort
View
COMBINATORICA
2004
69views more  COMBINATORICA 2004»
14 years 9 months ago
Structural Results For Planar Sets With Many Similar Subsets
Consider a k-element subset P of the plane. It is known that the maximum number of sets similar to P that can be found among n points in the plane is (n2 ) if and only if the cros...
Bernardo M. Ábrego, György Elekes, Sil...
ICIP
2009
IEEE
15 years 9 months ago
Efficient Distance Estimation For Fitting Implicit Quadric Surfaces
This paper presents a novel approach for estimating the shortest Euclidean distance from a given point to the corresponding implicit quadric fitting surface. It first estimates t...
Angel D. Sappa, Mohammad Rouhani
CVPR
2000
IEEE
15 years 12 months ago
On the Synthesis of Dynamic Scenes from Reference Views
We consider a scene, containing many objects moving with constant velocity along straight line paths, seen from three reference viewpoints at three different times.The scene may e...
Yonatan Wexler, Amnon Shashua
90
Voted
ESA
2009
Springer
74views Algorithms» more  ESA 2009»
15 years 4 months ago
On Inducing Polygons and Related Problems
Bose et al. [2] asked whether for every simple arrangement A of n lines in the plane there exists a simple n-gon P that induces A by extending every edge of P into a line. We prov...
Eyal Ackerman, Rom Pinchasi, Ludmila Scharf, Marc ...
ICHIT
2009
Springer
15 years 4 months ago
A new stereo matching algorithm for binocular vision
The stereo matching algorithms for binocular vision are very popular and widely applied. However, the algorithms may have lower matching quality or higher time complexity. To impr...
Tao Hu, May Huang