99 search results - page 8 / 20 » On empty convex polygons in a planar point set |
149
click to vote
CAGD
2008
15 years 6 months ago
2008
A simple proof is provided for the fact that the set of all possible triangulations of a planar point set in a polygonal domain is closed under the basic diagonal flip operation.
171
click to vote
CORR
2011
Springer
14 years 9 months ago
2011
Springer
Motivated by the desire to cope with data imprecision [8], we study methods for preprocessing a set of planar regions such that whenever we are given a set of points, each of whic...
144
click to vote
IWVF
2001
Springer
15 years 10 months ago
2001
Springer
The paper introduces a new approximation scheme for planar digital curves. This scheme defines an approximating sausage ‘around’ the given digital curve, and calculates a mini...
200
click to vote
CAGD
2008
15 years 4 months ago
2008
In this paper we present a local fitting algorithm for converting smooth planar curves to Bsplines. For a smooth planar curve a set of points together with their tangent vectors a...
162
click to vote
DCG
2007
15 years 6 months ago
2007
Steinitz’s Theorem states that a graph is the 1-skeleton of a convex polyhedron if and only if it is 3-connected and planar. The polyhedron is called a geometric realization of ...