4 search results - page 1 / 1 » ijfcs 2002 |
IJFCS
2002
13 years 10 months ago
2002
IJFCS
2002
13 years 10 months ago
2002
IJFCS
2002
13 years 10 months ago
2002
We propose a new data structure to compute the Delaunay triangulation of a set of points in the plane. It combines good worst case complexity, fast behavior on real data, small me...
IJFCS
2002
13 years 10 months ago
2002
Vector algorithms allow the computation of an output vector r = r1r2 :::rm given an input vector e = e1e2 :::em in a bounded number of operations, independent of m the length of t...