this is for holding javascript data
Xavier Holt edited Rectangle_Point_Query_We_represent__.md
about 8 years ago
Commit id: 2631dbf92340bd9e6ab6bb8ff381ed141ce09f26
deletions | additions
diff --git a/Rectangle_Point_Query_We_represent__.md b/Rectangle_Point_Query_We_represent__.md
index 1f2cf73..d6074d9 100644
--- a/Rectangle_Point_Query_We_represent__.md
+++ b/Rectangle_Point_Query_We_represent__.md
...
## Algorithm and Running Time
- **Preprocessing:** Create a kd-tree with \(d=4\) using \(r = \{x_\min, x_\max, y_\min, y_\max\}\ \forall r \in R \) as our dimensions: \(O(n\log n)\) space, \(O(n)\) time.
-
**Query:** Perform a range search and report all points in the region defined by