Answers are grounded in this paper and cite their sources.
Well-separated pair decomposition (WSPD) is a well-known geometric decomposition used for encoding distances, introduced in 1995 by Paul B. Callahan and S. Rao Kosaraju in a seminal paper. We implemented this remarkable decomposition following the nontrivial algorithm for computing the partial fair split tree of a point set presented in the original article. Our implementation is done in C++. In addition to that, we made further effort to publish it as a Python package on PyPI. By doing so, we made our software easily accessible on Windows, Linux, or macOS to researchers and students worldwide.
No takes yet. Share an insight, caveat, or question.
Domagoj Matijević (2024) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: