We describe our experience with a new algorithm for the reconstruction of surfaces from unorganized sample points in IR 3. The algorithm is the first for this problem with provab...
Nina Amenta, Marshall W. Bern, Manolis Kamvysselis
Abstract. Finding feasible points for which the proof succeeds is a critical issue in safe Branch and Bound algorithms which handle continuous problems. In this paper, we introduce...
Alexandre Goldsztejn, Yahia Lebbah, Claude Michel,...
We study algorithms for clustering data that were recently proposed by Balcan, Blum and Gupta in SODA’09 [4] and that have already given rise to two follow-up papers. The input f...
Thispaper presents a new hybrid range image segmentation approach. Two separate techniques are applied consecutively. First, iin edge based segmentation technique extracts the edg...
In this paper we present a local fitting algorithm for converting smooth planar curves to Bsplines. For a smooth planar curve a set of points together with their tangent vectors a...