Sciweavers

4486 search results - page 88 / 898
» Adaptable Boundary Sets
Sort
View
IROS
2006
IEEE
163views Robotics» more  IROS 2006»
15 years 10 months ago
Pair-wise Registration of 3D/Color Data Sets with ICP
- The ICP (Iterative Closest Point) algorithm remains a very popular method for the registration of 3D data sets, when an initial guess of the relative pose between them is known. ...
Lounis Douadi, Marie-José Aldon, Andr&eacut...
WEA
2010
Springer
300views Algorithms» more  WEA 2010»
15 years 11 months ago
Using Bound Sets in Multiobjective Optimization: Application to the Biobjective Binary Knapsack Problem
This paper is devoted to a study of the impact of using bound sets in biobjective optimization. This notion, introduced by Villareal and Karwan [19], has been independently revisit...
Charles Delort, Olivier Spanjaard
SIBGRAPI
2006
IEEE
15 years 10 months ago
Point set compression through BSP quantization
This work introduces a new compression scheme for point sets. This scheme relies on an adaptive binary space partition (BSP) which takes into account the geometric structure of the...
Alex Laier Bordignon, Thomas Lewiner, Hélio...
SMI
2006
IEEE
134views Image Analysis» more  SMI 2006»
15 years 10 months ago
Evolution of T-Spline Level Sets with Distance Field Constraints for Geometry Reconstruction and Image Segmentation
We study the evolution of T-spline level sets (i.e, implicitly defined T-spline curves and surfaces). The use of T-splines leads to a sparse representation of the geometry and al...
Huaiping Yang, Matthias Fuchs, Bert Jüttler, ...
DIAGRAMS
2004
Springer
15 years 10 months ago
Ensuring the Drawability of Extended Euler Diagrams for up to 8 Sets
Abstract. This paper shows by a constructive method the existence of a diagrammatic representation called extended Euler diagrams for any collection of sets X1, ..., Xn , n < 9....
Anne Verroust, Marie-Luce Viaud