regions of inaccessibility
Nobody has claimed this yet.
- Dominant language
- JavaScript
- Stars
- 1.6k
- Forks
- 163
- PR merge metrics
- No merged PRs in 30d
Description
I'm sure this is outside the scope of this module, but I was wondering your thoughts if you wanted to weigh in.
I am interested in finding regions of inaccessibility, which I would define as all points that have a distance to the polygon close to that of the pole of inaccessibility's distance to the polygon. I think I could adapt this algorithm so that once the pole of inaccessibility is found, I could visit the cells again and prune cells which are guaranteed to not have any regions of inaccessibility, keep cells that are wholly regions of inaccessible and split cells that are in-between. Something akin to alpha beta pruning, IIRC.
For my application, points that are almost poles can be reasonable solutions. For example, like putting text on a polygon :)
Contributor guide
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
No file, test, or entry point is identified. Start by reviewing the existing pole-of-inaccessibility algorithm and the proposed cell-pruning approach, then clarify the scope and definition of a region. Done would require an agreed design and validation that the resulting regions or near-pole points meet the intended use case.
Written by the indexing model from the issue text.
Assessment
- Tech stack
- javascript
- Domain
- computer-graphics
- Issue type
- Feature
- Difficulty
- 5/5
- Estimated time
- Over a week
- Activity status
- Stale
- Clarity
- Needs clarification
- Newbie friendliness
- 20/100