279 search results - page 20 / 56 » Implicit Convex Polygons |
CCCG
2007
13 years 9 months ago
2007
Given a convex polyhedron with n vertices and F faces, what is the fewest number of pieces, each of which unfolds to a simple polygon, into which it may be cut by slices along edg...
STOC
2003
ACM
14 years 8 months ago
2003
ACM
We initiate an investigation of sublinear algorithms for geometric problems in two and three dimensions. We give optimal algorithms for intersection detection of convex polygons a...
28
Voted
CAGD
2005
13 years 7 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...
CAGD
2007
13 years 7 months ago
2007
Barycentric coordinates are a fundamental concept in computer graphics and geometric modeling. We extend the geometric construction of Floater’s mean value coordinates [8,11] to...
ESA
2008
Springer
13 years 9 months ago
2008
Springer
Abstract. We present data structures for maintaining the relative convex hull of a set of points (sites) in the presence of pairwise non-crossing line segments (barriers) that subd...