2980 search results - page 327 / 596 » Computational Geometry |
187
click to vote
CGF
2005
15 years 6 months ago
2005
This paper describes a method to obtain a closed surface that approximates a general 3D data point set with non-uniform density. Aside from the positions of the initial data point...
166
click to vote
JUCS
2007
15 years 6 months ago
2007
: Sparse graphs and their associated matroids play an important role in rigidity theory, where they capture the combinatorics of some families of generic minimally rigid structures...
178
click to vote
IPL
2002
15 years 6 months ago
2002
We consider the problem of decomposing polygons (with holes) into various types of simpler polygons. We focus on the problem of partitioning a rectilinear polygon, with holes, int...
161
click to vote
DAM
1999
15 years 6 months ago
1999
It is well known that on a line, a target point in unknown position can be found by walking a path at most 9 times as long as the distance from the start to the target point, in t...
134
click to vote
TOG
2002
15 years 6 months ago
2002
This paper describes a new method for contouring a signed grid whose edges are tagged by Hermite data (i.e; exact intersection points and normals). This method avoids the need to ...