Before revision:  Our sequential range query implementations outperforms the CGAL implementation by more than a factor of 2, and gets an additional 63-fold speedup on all cores .
After revision:  Our sequential range query implementations outperforms the CGAL library by at least 2x in both construction and queries. Our sequential implementation can be slightly slower than the R-tree in the Boost library in some cases (0.6-2.5x), but has significantly better query performance (1.6-1400x) than Boost .