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...
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...
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, ...
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...
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...