Special condensed packing for point data
Open
Nobody has claimed this yet.
enhancement
- Dominant language
- JavaScript
- Stars
- 1.6k
- Forks
- 66
- PR merge metrics
- No merged PRs in 30d
Description
I wonder if it's possible to use twice less memory specifically for point data, where we know that maxX and maxY duplicate minX and minY. This could look like an option in the constructor (onlyPoints = false), and then adding special case handling for indexed leaves.
Contributor guide
No contributing guide indexed for this repository
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.
Research direction
Start by locating the constructor and the indexed-leaf handling in the JavaScript source. Review how point bounds are stored and how the proposed onlyPoints option would affect them, then verify that point indexing and querying still work without duplicating maxX and maxY.
Written by the indexing model from the issue text.
Assessment
- Tech stack
- javascript
- Domain
- search
- Issue type
- Feature
- Difficulty
- 5/5
- Estimated time
- Over a week
- Activity status
- Stale
- Clarity
- Mostly clear
- Newbie friendliness
- 35/100