4 search results - page 1 / 1 » ijfcs 2002 |
62
Voted
IJFCS
2002
15 years 2 days ago
2002
82
Voted
IJFCS
2002
15 years 2 days ago
2002
130
Voted
IJFCS
2002
15 years 2 days 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...
111
Voted
IJFCS
2002
15 years 2 days 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...