d3-quadtree

d3-quadtree copied to clipboard

Bumps [word-wrap](https://github.com/jonschlinkert/word-wrap) from 1.2.3 to 1.2.4. Release notes Sourced from word-wrap's releases. 1.2.4 What's Changed Remove default indent by @​mohd-akram in jonschlinkert/word-wrap#24 🔒fix: CVE 2023 26115 (2) by @​OlafConijn in...

dependabot[bot]

Bumps [semver](https://github.com/npm/node-semver) from 7.3.5 to 7.5.4. Release notes Sourced from semver's releases. v7.5.4 7.5.4 (2023-07-07) Bug Fixes cc6fde2 #588 trim each range set before parsing (@​lukekarrys) 99d8287 #583 correctly parse...

dependabot[bot]

knn?

2

See https://observablehq.com/@llb4ll/k-nearest-neighbor-search-using-d3-quadtrees

Fil

Bumps [terser](https://github.com/terser/terser) from 5.7.0 to 5.14.2. Changelog Sourced from terser's changelog. v5.14.2 Security fix for RegExps that should not be evaluated (regexp DDOS) Source maps improvements (#1211) Performance improvements in...

dependabot[bot]

quadtree.find(x, y, radius, *filter*)

5

Adds a *filter* option on quadtree.find closes https://github.com/d3/d3-quadtree/issues/19

Fil

`Extent` is broken?

2

If a tree has the extent `[[1,1],[5,5]]`, calling `tree.extent( tree.extent() )` returns a tree with the extent `[[1,1], [9,9]]`

nemosmithasf

quadtree.find(x, y, 0) should return [x, y] if it's present in the tree

1

`d3.quadtree().add([1, 2]).find(1, 2, 0)` returns `undefined`, while I'd expect it to return `[1, 2]`.

pallosp

Allow filters on quadtree.find

1

I like to use an optional filter argument with the find method so that the search can return only the nearest relevant point (e.g.: the nearest red point if blue...

bmschmidt

As said in the README: > (...) Each distinct point exists in a unique leaf node; coincident points are represented by a linked list. (...) So this is a quadtree...

rilpires