99 search results - page 3 / 20 » On empty convex polygons in a planar point set |
EJC
2008
13 years 5 months ago
2008
Let X be a set of points in general position in the plane. General position means that no three points lie on a line and no two points have the same x-coordinate. Y X is a cup, r...
CAGD
2005
13 years 5 months ago
2005
Abstract: Barycentric coordinates can be used both to express a point inside a tetrahedron as a convex combination of the four vertices and to linearly interpolate data given at th...
CVPR
2000
IEEE
14 years 7 months ago
2000
IEEE
In this paper, we address the problem of curve and surface reconstruction from sets of points. We introduce regular interpolants which are polygonal approximations of planar curve...
CCCG
2010
13 years 7 months ago
2010
By a polygonization of a finite point set S in the plane we understand a simple polygon having S as the set of its vertices. Let B and R be sets of blue and red points, respective...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
We study the problem of Upward Point-Set Embeddability, that is the problem of deciding whether a given upward planar digraph D has an upward planar embedding into a point set S. W...