83 search results - page 12 / 17 » Acute Triangulations of Polygons |
CCCG
2007
15 years 1 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...
COMPGEOM
1999
ACM
15 years 4 months ago
1999
ACM
We show a remarkable fact about folding paper: From a single rectangular sheet of paper, one can fold it into a flat origami that takes the (scaled) shape of any connected polygo...
103
click to vote
CGF
2010
14 years 12 months ago
2010
In this paper we present a novel method to compute Boolean operations on polygonal meshes. Given a Boolean expression over an arbitrary number of input meshes we reliably and effi...
107
click to vote
COMGEO
2006
ACM
14 years 11 months ago
2006
ACM
Let P be a polyhedral domain occupying a convex volume. We prove that the size of a graded mesh of P with bounded vertex degree is within a factor O(H3 P ) of the size of any Dela...
IJRR
2002
14 years 11 months ago
2002
We present kinetic data structures for detecting collisions between a set of polygons that are moving continuously. Unlike classical collision detection methods that rely on bound...