Sciweavers

387 search results - page 65 / 78
» Towards in-place geometric algorithms and data structures
Sort
View
VISUALIZATION
1998
IEEE
15 years 4 months ago
Interpolation of triangle hierarchies
We consider interpolation between keyframe hierarchies. We impose a set of weak constraints that allows smooth interpolation between two keyframe hierarchies in an animation or, m...
Axel Friedrich, Konrad Polthier, Markus Schmies
SDM
2008
SIAM
140views Data Mining» more  SDM 2008»
15 years 1 months ago
Creating a Cluster Hierarchy under Constraints of a Partially Known Hierarchy
Although clustering under constraints is a current research topic, a hierarchical setting, in which a hierarchy of clusters is the goal, is usually not considered. This paper trie...
Korinna Bade, Andreas Nürnberger
COMPGEOM
2005
ACM
15 years 2 months ago
Kinetic sorting and kinetic convex hulls
Let S be a set of n points moving on the real line. The kinetic sorting problem is to maintain a data structure on the set S that makes it possible to quickly generate a sorted li...
Mohammad Ali Abam, Mark de Berg
CVPR
2007
IEEE
16 years 2 months ago
Stereo Matching via Disparity Estimation and Surface Modeling
Two new techniques are proposed to improve stereo matching performance in this work. First, to address the disparity discontinuity problem in occluded regions, we present a dispar...
Jong Dae Oh, Siwei Ma, C. C. Jay Kuo
94
Voted
MVA
2010
126views Computer Vision» more  MVA 2010»
14 years 10 months ago
Rapid automated detection of roots in minirhizotron images
An approach for rapid, automatic detection of plant roots in minirhizotron images is presented. The problem is modeled as a Gibbs point process with a modified Candy model, in wh...
Guang Zeng, Stanley T. Birchfield, Christina E. We...