92 search results - page 8 / 19 » The Number of Triangulations on Planar Point Sets |
COMPGEOM
2004
ACM
15 years 5 months ago
2004
ACM
Let P be a set of n points in general position in the plane. Let Xk(P ) denote the number of empty convex k-gons determined by P. We derive, using elementary proof techniques, sev...
89
Voted
COCOON
2003
Springer
15 years 4 months ago
2003
Springer
In this paper, we show some properties of a pseudotriangle and present three combinatorial bounds: the ratio of the size of minimum pseudotriangulation of a point set S and the siz...
99
Voted
IWPEC
2004
Springer
15 years 5 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...
99
Voted
COMPGEOM
2010
ACM
15 years 4 months ago
2010
ACM
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...
104
click to vote
ECCV
2006
Springer
16 years 1 months ago
2006
Springer
Triangulation consists in finding a 3D point reprojecting the best as possible onto corresponding image points. It is classical to minimize the reprojection error, which, in the p...