Issues
- 0
Question abount implementation
#51 opened by rilpires - 2
- 2
`Extent` is broken?
#44 opened by nemosmithasf - 5
Serialization and Deserialization
#37 opened by tabiodun - 1
- 6
findInCircle?
#30 opened by Fil - 2
Return coincident points with find
#38 opened by cguastini - 1
cover
#36 opened by nickbetteridge - 2
Add basic aabb query to the lib
#29 opened by Fxlr8 - 1
Define behavior of add/remove during iteration.
#16 opened by mbostock - 1
Allow filters on quadtree.find
#19 opened by bmschmidt - 2
- 1
- 2
Seeing weird remove behavior
#21 opened by chaocodes - 1
Running out of memory
#22 opened by akinnee - 1
Register with bower.
#1 opened by mbostock - 0
d3.quadtree([nodes[, x, y]])
#15 opened by mbostock - 1
Represent points as [x, y], not {x: x, y: y}.
#11 opened by mbostock - 0
Introduction is outdated.
#9 opened by mbostock - 0
Don’t expose public fields.
#12 opened by mbostock - 0
Add quadtree.size().
#13 opened by mbostock - 0
Add quadtree.points().
#14 opened by mbostock - 1
The root properties should be public.
#8 opened by mbostock - 0
Remove should collapse more nodes.
#10 opened by mbostock - 0
Delete a node?
#2 opened by mbostock - 0
Restore find.
#7 opened by mbostock - 1
Post-order traversal?
#4 opened by mbostock - 1
Eliminate recursion?
#5 opened by mbostock - 1
Rename root.visit to root.each?
#3 opened by mbostock - 1