Sciweavers

387 search results - page 7 / 78
» Towards in-place geometric algorithms and data structures
Sort
View
115
Voted
3DPVT
2004
IEEE
149views Visualization» more  3DPVT 2004»
15 years 4 months ago
Fan-Meshes: A Geometric Primitive for Point-Based Description of 3D Models and Scenes
We propose a new data structure, called Fan-Meshes (FM), for reconstructing 3D models and scenes represented by dense scanning point clouds. It is a local piecewise linear approxi...
Xiaotian Yan, Fang Meng, Hongbin Zha
ECCV
2002
Springer
16 years 2 months ago
A Comparison of Search Strategies for Geometric Branch and Bound Algorithms
Over the last decade, a number of methods for geometric matching based on a branch-and-bound approach have been proposed. Such algorithms work by recursively subdividing transforma...
Thomas M. Breuel
CVPR
2007
IEEE
16 years 2 months ago
Integrating Global and Local Structures: A Least Squares Framework for Dimensionality Reduction
Linear Discriminant Analysis (LDA) is a popular statistical approach for dimensionality reduction. LDA captures the global geometric structure of the data by simultaneously maximi...
Jianhui Chen, Jieping Ye, Qi Li
ICCV
2009
IEEE
16 years 5 months ago
Decomposing a Scene into Geometric and Semantically Consistent Regions
High-level, or holistic, scene understanding involves reasoning about objects, regions, and the 3D relationships between them. This requires a representation above the level of ...
Stephen Gould, Richard Fulton, Daphne Koller
ALGORITHMICA
2008
79views more  ALGORITHMICA 2008»
15 years 16 days ago
Practical Methods for Shape Fitting and Kinetic Data Structures using Coresets
The notion of -kernel was introduced by Agarwal et al. [5] to set up a unified framework for computing various extent measures of a point set P approximately. Roughly speaking, a ...
Hai Yu, Pankaj K. Agarwal, Raghunath Poreddy, Kast...