Sciweavers

110 search results - page 11 / 22
» Greedy List Intersection
Sort
View
WACV
2005
IEEE
14 years 3 months ago
Automatic Augmentation and Meshing of Sparse 3D Scene Structure
We propose a novel method of robustly and automatically creating surface meshes from the very sparsely populated 3D point clouds typically produced by Structure from Motion algori...
Oli Cooper, Neill W. Campbell, David P. Gibson
EWC
2010
112views more  EWC 2010»
13 years 8 months ago
Meshing volumes with curved boundaries
Abstract This paper introduces a three-dimensional mesh generation algorithm for domains whose boundaries are curved surfaces, possibly with sharp features. The algorithm combines ...
Steve Oudot, Laurent Rineau, Mariette Yvinec
KDD
2003
ACM
156views Data Mining» more  KDD 2003»
14 years 10 months ago
Fast vertical mining using diffsets
A number of vertical mining algorithms have been proposed recently for association mining, which have shown to be very effective and usually outperform horizontal approaches. The ...
Mohammed Javeed Zaki, Karam Gouda
SODA
2004
ACM
115views Algorithms» more  SODA 2004»
13 years 11 months ago
Minimizing the stabbing number of matchings, trees, and triangulations
The (axis-parallel) stabbing number of a given set of line segments is the maximum number of segments that can be intersected by any one (axis-parallel) line. We investigate probl...
Sándor P. Fekete, Marco E. Lübbecke, H...
CGF
2008
153views more  CGF 2008»
13 years 10 months ago
Computing Local Signed Distance Fields for Large Polygonal Models
The signed distance field for a polygonal model is a useful representation that facilitates efficient computation in many visualization and geometric processing tasks. Often it is...
Byungjoon Chang, Deukhyun Cha, Insung Ihm