Sciweavers

394 search results - page 31 / 79
» Expected Case for Projecting Points
Sort
View
ICRA
2009
IEEE
151views Robotics» more  ICRA 2009»
15 years 6 months ago
HSM3D: Feature-less global 6DOF scan-matching in the Hough/Radon domain
—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...
Andrea Censi, Stefano Carpin
DM
1998
81views more  DM 1998»
14 years 11 months ago
On intersecting hypergraphs
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...
Barry Guiduli, Zoltán Király
COMPGEOM
2003
ACM
15 years 5 months ago
High-dimensional shape fitting in linear time
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...
Sariel Har-Peled, Kasturi R. Varadarajan
IJCV
1998
121views more  IJCV 1998»
14 years 11 months ago
Continuous Time Matching Constraints for Image Streams
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...
Kalle Åström, Anders Heyden
ISADS
1999
IEEE
15 years 4 months ago
CORBA based Architecture for Large Scale Workflow
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...