Sciweavers

1879 search results - page 187 / 376
» Computational geometry algorithms library
Sort
View
CAD
2005
Springer
15 years 6 months ago
A Delaunay-based region-growing approach to surface reconstruction from unorganized points
This paper presents a Delaunay-based region-growing (DBRG) surface reconstruction algorithm that holds the advantages of both Delaunay-based and region-growing approaches. The pro...
Chuan-Chu Kuo, Hong-Tzong Yau
COMPGEOM
1992
ACM
15 years 11 months ago
A Subexponential Bound for Linear Programming
We present a simple randomized algorithm which solves linear programs with n constraints and d variables in expected minfO(d 22dn); e 2 pdln(n= p d)+O( p d+lnn)g time in the unit ...
Jirí Matousek, Micha Sharir, Emo Welzl
ICCV
2009
IEEE
1052views Computer Vision» more  ICCV 2009»
16 years 11 months ago
A direct approach for efficiently tracking with 3D Morphable Models
We present an efficient algorithm for fitting a morphable model to an image sequence. It is built on a projective geometry formulation of perspective projection, which results in a...
Enrique Muñoz, José M. Buenaposada, Luis Baumela
SI3D
2003
ACM
16 years 8 days ago
Application of the two-sided depth test to CSG rendering
Shadow mapping is a technique for doing real-time shadowing. Recent work has shown that shadow mapping hardware can be used as a second depth test in addition to the z-test. In th...
Sudipto Guha, Shankar Krishnan, Kamesh Munagala, S...
294
Voted
ISCSCT
2008
IEEE
16 years 1 months ago
Image Rectification Using Affine Epipolar Geometric Constraint
—To rapidly and accurately search the corresponding points along scan-lines, rectification of stereo pairs are performed so that corresponding epipolar lines are parallel to the ...
Liansheng Sui, Jiulong Zhang, Duwu Cui