General-Purpose Spatial Decomposition Algorithms : Experimental Results

@inproceedings{Tate2000GeneralPurposeSD,
  title={General-Purpose Spatial Decomposition Algorithms : Experimental Results},
  author={Stephen R. Tate and Ke Xu},
  year={2000}
}
In this paper, we experimentally explore four different hierarchical space decomposition algorithms. Three of these algorithms are known from prior literature, whereas the fourth was derived as a result of initial experimental work with the previous algorithms, and is presented for the first time in this paper. The new algorithm has several variations, and one of them (called TX-AL) is consistently faster than all of the other algorithms, despite the fact that its worst-case asymptotic… CONTINUE READING

Citations

Publications citing this paper.
Showing 1-2 of 2 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 12 references

The LEDA user manual, version 3.8

K. Mehlhorn, S. Näher, M. Seel, C. Uhrig
For more information on the LEDA sofware library, • 1999
View 2 Excerpts

Data Structures and Algorithms in Java

World wide series in computer science • 1998
View 1 Excerpt

The Art of Computer Programming; Volume 3: Sorting and Searching (Second ed.)

D. E. Knuth
1998
View 2 Excerpts

FastCap: a multipole accelerated 3-D capacitance extraction program

IEEE Trans. on CAD of Integrated Circuits and Systems • 1991
View 2 Excerpts

An O(n log n) Algorithm for the All-nearest.Neighbors Problem

Discrete & Computational Geometry • 1989
View 1 Excerpt

Similar Papers

Loading similar papers…