126 search results - page 10 / 26 » Self-improving algorithms for delaunay triangulations |
COMPGEOM
1995
ACM
15 years 1 months ago
1995
ACM
This paper presents an experimental comparison of a number of different algorithms for computing the Deluanay triangulation. The algorithms examined are: Dwyer’s divide and conq...
COMPGEOM
2009
ACM
15 years 4 months ago
2009
ACM
Computers with multiple processor cores using shared memory are now ubiquitous. In this paper, we present several parallel geometric algorithms that specifically target this envi...
64
Voted
IPPS
2010
IEEE
14 years 7 months ago
2010
IEEE
ESA
1997
Springer
15 years 1 months ago
1997
Springer
68
Voted
COMPGEOM
2004
ACM
15 years 3 months ago
2004
ACM
For many geometric problems, there are efficient algorithms that use surprisingly very little extra space other than the given array holding the input. For many geometric query pr...