Sciweavers

137 search results - page 15 / 28
» On polygons excluding point sets
Sort
View
ISAAC
2004
Springer
79views Algorithms» more  ISAAC 2004»
14 years 1 months ago
Paired Pointset Traversal
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 ...
Peter Hui, Marcus Schaefer
CCCG
2009
13 years 6 months ago
Wireless Localization with Vertex Guards is NP-hard
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...
Tobias Christ, Michael Hoffmann
CGF
2006
125views more  CGF 2006»
13 years 8 months ago
Translational Covering of Closed Planar Cubic B-Spline Curves
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...
Cristina Neacsu, Karen Daniels
CAGD
2008
119views more  CAGD 2008»
13 years 7 months ago
A local fitting algorithm for converting planar curves to B-splines
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...
Chongyang Deng, Xunnian Yang
COMPGEOM
1996
ACM
14 years 17 days ago
Flipping Edges in Triangulations
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...
Ferran Hurtado, Marc Noy, Jorge Urrutia