Before revision:  It has O(n^6\log n) construction time, uses O(n^6) space, and has query time O(\log n+k), where k is the number of intersected segments with the query shape  .
After revision:  It has O(n^6\log n) construction time, uses O(n^6) space, and has query time O(\log n+k), where k is the number of intersected segments with the query shape . We also give a massively parallel algorithm for relative c-packedness with O(1) rounds .