Question abount implementation
Nobody has claimed this yet.
Assessment
- Difficulty
- 5/5
- Estimated time
- Over a week
- Newbie friendliness
- 25/100
- Issue type
- Feature
- Clarity
- Mostly clear
- Activity status
- Stale
- Tech stack
- javascript
- Domain
- data
Research direction
Start with the README’s description of how distinct and coincident points are represented, then inspect the quadtree implementation to understand when leaves subdivide. The issue asks whether subdivision could use a configurable point-count threshold; done would require deciding whether to support that design and describing its effects on memory and insertion time.
Written by the indexing model from the issue text.
Description
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 that ALWAYS subdivide when adding a new point, except if this is a point(datum) exactly the same as another that already exists?
I'm very curious about this design choice of not allowing to have custom criteria on when should subdivide leaf nodes (ex: above 10 points), it's just that I have this intuition that it would alleviate so much memory and time entering so many nodes
- Dominant language
- JavaScript
- Stars
- 238
- Forks
- 54
- Avg merge
- 1d 13h
- Merged PRs (30d)
- 2
Getting set up
This project ships no dev container, Dockerfile or contributing guide, so setting up is up to you: start from its README, and see our first-contribution guide for the general steps.
First steps
- Read the whole issue, then the project's contributing guide.
- Comment on the issue to say you are picking it up — it saves two people doing the same work.
- Fork the repository and make your change on a branch.
- Open a pull request that references the issue number.
More from d3/d3-quadtree
-
`Extent` is broken?Open
Difficulty 2/5 1-3 hours Newbie friendliness 38/100
d3/d3-quadtree#44 · 2 comments ·
-
knn?Open
Difficulty 5/5 Over a week Newbie friendliness 15/100
d3/d3-quadtree#42 · 2 comments ·
-
Difficulty 2/5 1-3 hours Newbie friendliness 42/100
d3/d3-quadtree#39 · 1 comment ·
-
Allow filters on quadtree.findPossibly taken @mbostock claimed this 3438 days ago. Open
d3/d3-quadtree#19 · 1 comment · 1 reaction · 1 assignee ·
Similar issues
-
maintenance
Difficulty 2/5 1-3 hours Newbie friendliness 78/100
assistant-ui/assistant-ui#10496 · 1 comment · 1 reaction ·
Maintainers usually reply within 1 day
-
ai bug design good first issue
Difficulty 2/5 1-3 hours Newbie friendliness 82/100
neomjs/neo-agent-institution#927 ·
Maintainers usually reply within 1 day
-
Difficulty 2/5 1-3 hours Newbie friendliness 78/100
gramps-project/gramps-web#1671 ·
Maintainers usually reply within 1 day
-
bug good first issue priority: P2 status: ready
Difficulty 2/5 1-3 hours Newbie friendliness 78/100
RhinoLink-Tech/data-fabric#502 ·
Maintainers usually reply within 1 day
-
Difficulty 1/5 Under an hour Newbie friendliness 75/100
cline/mcp-marketplace#3708 ·