91 search results - page 10 / 19 » Triangulating a Plane |
COMPGEOM
2004
ACM
15 years 2 months ago
2004
ACM
Given a set of n points S in the plane, a triangulation of S is a subdivision of the convex hull into triangles whose vertices are from S. In the kinetic setting, the input point ...
GC
2011
Springer
14 years 27 days ago
2011
Springer
Given an algebraic hypersurface O in Êd, how many simplices are necessary for a simplicial complex isotopic to O? We address this problem and the variant where all vertices of the...
100
click to vote
PAMI
2011
14 years 4 months ago
2011
—In this paper, we describe the explicit application of articulation constraints for estimating the motion of a system of articulated planes. We relate articulations to the relat...
IWPEC
2004
Springer
15 years 2 months ago
2004
Springer
We propose to look at the computational complexity of 2-dimensional geometric optimization problems on a finite point set with respect to the number of inner points (that is, poi...
CVPR
2006
IEEE
15 years 11 months ago
2006
IEEE
This paper presents a method for capturing and computing 3D parallax. 3D parallax, as used here, refers to vertical offset from the ground plane, height. The method is based on an...