137 search results - page 15 / 28 » On polygons excluding point sets |
112
click to vote
ISAAC
2004
Springer
15 years 10 months ago
2004
Springer
In the Paired Pointset Traversal problem we ask whether, given two sets A = {a1, . . . , an} and B = {b1, . . . , bn} in the plane, there is an ordering π of the points such that ...
135
click to vote
CCCG
2009
15 years 2 months ago
2009
We consider a special class of art gallery problems inspired by wireless localization. Given a simple polygon P, place and orient guards each of which broadcasts a unique key with...
157
click to vote
CGF
2006
15 years 5 months ago
2006
Spline curves are useful in a variety of geometric modeling and graphics applications and covering problems abound in practical settings. This work defines a class of covering dec...
173
Voted
CAGD
2008
15 years 3 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...
131
Voted
COMPGEOM
1996
ACM
15 years 9 months ago
1996
ACM
A triangulation of a point set Pn is a partitioning of the convex hull Conv(Pn) into a set of triangles with disjoint interiors such that the vertices of these triangles are in Pn...