Sciweavers

498 search results - page 46 / 100
» Measuring the Complexity of Polygonal Objects
Sort
View
CAD
2005
Springer
13 years 11 months ago
Optimizing the topological and combinatorial complexity of isosurfaces
Since the publication of the original Marching Cubes algorithm, numerous variations have been proposed for guaranteeing water-tight constructions of triangulated approximations of...
Carlos Andújar, Pere Brunet, Antoni Chica, ...
SMA
2005
ACM
125views Solid Modeling» more  SMA 2005»
14 years 4 months ago
Multi-representation interaction for physically based modeling
For simulations involving complex objects, a number of different properties must be represented. An example of this is in modeling an object undergoing combustion—heat amounts,...
Zeki Melek, John Keyser
VLDB
2002
ACM
113views Database» more  VLDB 2002»
14 years 11 months ago
Searching in metric spaces by spatial approximation
We propose a new data structure to search in metric spaces. A metric space is formed by a collection of objects and a distance function de ned among them, which satis es the trian...
Gonzalo Navarro
TIP
2008
219views more  TIP 2008»
13 years 11 months ago
Binary Partition Trees for Object Detection
This paper discusses the use of Binary Partition Trees (BPTs) for object detection. BPTs are hierarchical region-based representations of images. They define a reduced set of regio...
Verónica Vilaplana, Ferran Marqués, ...
IJCV
2000
180views more  IJCV 2000»
13 years 10 months ago
Probabilistic Models of Appearance for 3-D Object Recognition
We describe how to model the appearance of a 3-D object using multiple views, learn such a model from training images, and use the model for object recognition. The model uses pro...
Arthur R. Pope, David G. Lowe