Sciweavers

1879 search results - page 255 / 376
» Computational geometry algorithms library
Sort
View
COMPGEOM
2010
ACM
15 years 9 months ago
A kinetic triangulation scheme for moving points in the plane
We present a simple randomized scheme for triangulating a set P of n points in the plane, and construct a kinetic data structure which maintains the triangulation as the points of...
Haim Kaplan, Natan Rubin, Micha Sharir
ICCV
2009
IEEE
16 years 9 months ago
An Algebraic Approach to Affine Registration of Point Sets
This paper proposes a new affine registration algorithm for matching two point sets in IR2 or IR3. The input point sets are represented as probability density functions, using e...
Jeffrey Ho, Adrian Peter, Anand Rangarajan, Ming-H...
CVPR
2004
IEEE
16 years 6 months ago
Efficient Search of Faces from Complex Line Drawings
Single 2D line drawing is a straightforward method to illustrate 3D objects. The faces of an object depicted by a line drawing give very useful information for the reconstruction ...
Jianzhuang Liu, Xiaoou Tang
120
Voted
3DPVT
2006
IEEE
153views Visualization» more  3DPVT 2006»
15 years 10 months ago
Reconstructing a 3D Line from a Single Catadioptric Image
This paper demonstrates that, for axial non-central optical systems, the equation of a 3D line can be estimated using only four points extracted from a single image of the line. T...
Douglas Lanman, Megan Wachs, Gabriel Taubin, Ferna...
IEEECGIV
2005
IEEE
15 years 10 months ago
A Practical Implementation of a 3-D Game Engine
Creating a 3-D game engine is not a trivial task as gamers often demand for high quality output with top notch performance in games. In this paper, we show you how various real-ti...
Thomas C. S. Cheah, Kok-Why Ng