102291 search results - page 184 / 20459 » Computability in Computational Geometry |
162
click to vote
SGP
2003
15 years 7 months ago
2003
In this paper we develop a new description for subdivision surfaces based on a graph grammar formalism. Subdivision schemes are specified by a context sensitive grammar in which ...
154
Voted
COMPGEOM
2004
ACM
15 years 11 months 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 ...
258
click to vote
TOG
2012
13 years 8 months ago
2012
We present a simple algorithm to compute continuous penalty forces to determine collision response between rigid and deformable models bounded by triangle meshes. Our algorithm co...
204
click to vote
CGF
2011
14 years 9 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...
130
Voted
VIS
2003
IEEE
16 years 7 months ago
2003
IEEE
We present a method to represent unstructured scalar fields at multiple levels of detail. Using a parallelizable classification algorithm to build a cluster hierarchy, we generate...