COMGEO
1999
ACM
13 years 4 months ago
1999
ACM
COMGEO
1999
ACM
13 years 4 months ago
1999
ACM
This paper discusses algorithms for labeling sets of points in the plane, where labels are not restricted to some finite number of positions. We show that continuously sliding lab...
COMGEO
1999
ACM
13 years 4 months ago
1999
ACM
The use of polygonal meshes for the representation of highly complex geometric objects has become the de facto standard in most computer graphics applications. Especially triangle...
COMGEO
1999
ACM
13 years 4 months ago
1999
ACM
Many algorithms for reducing the number of triangles in a surface model have been proposed, but to date there has been little theoretical analysis of the approximations they produ...
COMGEO
1999
ACM
13 years 4 months ago
1999
ACM
We present a new approach for simplifying models composed of rational spline patches. Given an input model, the algorithm computes a new approximation of the model in terms of cub...
COMGEO
1999
ACM
13 years 4 months ago
1999
ACM
COMGEO
1999
ACM
13 years 4 months ago
1999
ACM
COMGEO
1999
ACM
13 years 4 months ago
1999
ACM
The visual nature of geometry applications makes them a natural area where visualization can be an effective tool for demonstrating algorithms. In this paper we propose a new mode...
COMGEO
1999
ACM
13 years 4 months ago
1999
ACM
COMGEO
1999
ACM
13 years 4 months ago
1999
ACM
Let S be a set of n points in IRd and let t > 1 be a real number. A t-spanner for S is a directed graph having the points of S as its vertices, such that for any pair p and q o...