—This paper presents HSM3D, an algorithm for global rigid 6DOF alignment of 3D point clouds. The algorithm works by projecting the two input sets into the Radon/Hough domain, who...
We investigate the following question: “Given an intersecting multi-hypergraph on n points, what fraction of edges must be covered by any of the best 2 points?” (Here “best...
Let P be a set of n points in Rd. The radius of a k-dimensional flat F with respect to P, denoted by RD(F, P), is defined to be maxp∈P dist(F, p), where dist(F, p) denotes the...
Corresponding image points of a rigid object in a discrete sequence of images fulfil the so-called multilinear constraint. In this paper the continuous time analogue of this const...
Standard client-server workflow management systems have an intrinsic scalability limitation, the central server, which represents a bottleneck for large-scale applications. This s...
Roberto Silveira Silva Filho, Jacques Wainer, Edmu...