3005 search results - page 238 / 601 » Computational geometry for sculpture |
169
click to vote
COMPGEOM
2010
ACM
15 years 12 months ago
2010
ACM
Let G be an unweighted graph of complexity n cellularly embedded in a surface (orientable or not) of genus g. We describe improved algorithms to compute (the length of) a shortest...
176
click to vote
VISUALIZATION
1998
IEEE
15 years 11 months ago
1998
IEEE
We consider interpolation between keyframe hierarchies. We impose a set of weak constraints that allows smooth interpolation between two keyframe hierarchies in an animation or, m...
162
click to vote
COMPGEOM
2004
ACM
16 years 6 days ago
2004
ACM
We propose a strategy to decompose a polygon, containing zero or more holes, into “approximately convex” pieces. For many applications, the approximately convex components of ...
208
Voted
SIGGRAPH
2010
ACM
15 years 11 months ago
2010
ACM
Geodesic curves in surfaces are not only minimizers of distance, but they are also the curves of zero geodesic (sideways) curvature. It turns out that this property makes patterns...
214
click to vote
CGF
2011
14 years 10 months ago
2011
Efficient methods to compute intrinsic distances and geodesic paths have been presented for various types of surface representations, most importantly polygon meshes. These meshe...