IPL
2006
13 years 4 months ago
2006
Let P be a polygon with n vertices. We say that two points of P see each other if the line segment connecting them lies inside (the closure of) P. In this paper we present efficie...
IJRR
2008
13 years 4 months ago
2008
: We present algorithms for computing all placements of two and three fingers that cage a given polygonal object with n edges in the plane. A polygon is caged when it is impossible...
DCG
2006
13 years 4 months ago
2006
The maximal area of a polygon with n = 2m edges and unit diameter is not known when m 5, nor is the maximal perimeter of a convex polygon with n = 2m edges and unit diameter known...
DM
2010
13 years 4 months ago
2010
Given a polygon P in the plane, a pop operation is the reflection of a vertex with respect to the line through its adjacent vertices. We define a family of alternating polygons, a...
CAGD
2010
13 years 4 months ago
2010
A Kokotsakis mesh is a polyhedral structure consisting of an n-sided central polygon P0 surrounded by a belt of polygons in the following way: Each side ai of P0 is shared by an a...
ADCM
2010
13 years 5 months ago
2010
Wachspress and mean value coordinates are two generalizations of triangular barycentric coordinates to convex polygons and have recently been used to construct mappings between po...
CCCG
2009
13 years 6 months ago
2009
We model the problem of detecting intruders using a set of infrared beams by the perimeter defense problem: given a polygon P, find a minimum set of edges S of the polygon such th...
BMVC
1998
13 years 6 months ago
1998
A method of extracting, classifying and modelling non-rigid shapes from an image sequence is presented. Shapes are approximated by polygons where the number of sides is related to...
WSCG
2004
13 years 6 months ago
2004
Collision detection between moving objects is an open question which raises major problems concerning its algorithmic complexity. In this paper we present a polygon collision dete...
CCCG
2003
13 years 6 months ago
2003
A decomposition of a polygon P is a set of polygons whose geometric union is exactly P. We consider the problem of decomposing a polygon, which may contain holes, using subpolygon...