Two-dimensional recursive spatial subdivision.

Is d3/d3-quadtree beginner-friendly?

We have not seen enough recent pull requests from outside contributors to d3/d3-quadtree to say how often they are merged. No beginner-friendly issue is open right now; the list below has the other issues we hold for it.

Stars
238
Forks
54
Open beginner issues
0
Indexed issues
5
Avg merge
1d 13h
Merged PRs (30d)
2
Dominant language
JavaScript
License
ISC
Last GitHub push
Nov 3, 2026
Latest indexed
Nov 8, 2026
Contributing guide
No contributing guide
Code of conduct
No code of conduct
Beginner labels
No beginner labels indexed

How to contribute to d3/d3-quadtree

  1. There is no contributing guide, so start from the README and a few recently merged pull requests to see how changes are proposed.
  2. Your contributions will be published under the project's ISC license.
  3. Follow the repository to hear when a new beginner-friendly issue opens, or look through the other issues below.

Issues somebody may already be working on are listed last. List everything by date

  • Question abount implementation
    Open

    Difficulty 5/5 Over a week Newbie friendliness 25/100

    d3/d3-quadtree#51 ·

  • `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 ·

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

    Difficulty 2/5 1-3 hours Newbie friendliness 42/100

    d3/d3-quadtree#39 · 1 comment ·

  • Allow filters on quadtree.find
    Possibly taken @mbostock claimed this 3438 days ago. Open

    d3/d3-quadtree#19 · 1 comment · 1 reaction · 1 assignee ·

Get new issues in your inbox

A short digest of beginner-friendly GitHub issues.