Sciweavers

5019 search results - page 18 / 1004
» On the Reflexivity of Point Sets
Sort
View
DCG
2010
135views more  DCG 2010»
13 years 8 months ago
Universal Sets of n Points for One-bend Drawings of Planar Graphs with n Vertices
This paper shows that any planar graph with n vertices can be point-set embedded with at most one bend per edge on a universal set of n points in the plane. An implication of this...
Hazel Everett, Sylvain Lazard, Giuseppe Liotta, St...
FGR
2006
IEEE
169views Biometrics» more  FGR 2006»
14 years 2 months ago
Combining PCA and LFA for Surface Reconstruction from a Sparse Set of Control Points
This paper presents a novel method for 3D surface reconstruction based on a sparse set of 3D control points. For object classes such as human heads, prior information about the cl...
Reinhard Knothe, Sami Romdhani, Thomas Vetter
ESA
2009
Springer
127views Algorithms» more  ESA 2009»
14 years 1 months ago
Geometric Spanners for Weighted Point Sets
Let (S, d) be a finite metric space, where each element p ∈ S has a non-negative weight w(p). We study spanners for the set S with respect to weighted distance function dw, wher...
Mohammad Ali Abam, Mark de Berg, Mohammad Farshi, ...
ICCV
2003
IEEE
14 years 10 months ago
How To Deal with Point Correspondences and Tangential Velocities in the Level Set Framework
In this paper, we overcome a major drawback of the level set framework: the lack of point correspondences. We maintain explicit backward correspondences from the evolving interfac...
Jean-Philippe Pons, Gerardo Hermosillo, Renaud Ker...
ICPR
2008
IEEE
14 years 2 months ago
Correspondences of point sets using Particle Filters
The paper shows how Particle Filters can be used to establish visually consistent partial correspondences between similar features in unrestricted 2D point sets representing shape...
Rolf Lakämper, Shusha Li, Marc Sobel