locationtech / locationtech/spatial4j
Line densification based on geodetic error tolerance
Nobody has claimed this yet.
- Dominant language
- Java
- Stars
- 961
- Forks
- 172
- PR merge metrics
- No merged PRs in 30d
Description
I'd like to be able to interpolate a pair of adjacent points geodetically by adding a point at the place along the geodetic path that maximizes the distance away from the Euclidean straight-line path. And I'd like to know what that distance delta is, so an algorithm can either decide to add a point or not to. With this capability, I could take a polygon or line string and densify it to configurable geodetic distance tolerances.
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 files, tests, or entry points are identified in the issue. Start by locating the existing geodetic path and distance APIs; done should include interpolation that reports the maximum deviation from the Euclidean segment and supports tolerance-based densification.
Written by the indexing model from the issue text.
Assessment
- Tech stack
- java
- Domain
- data
- Issue type
- Feature
- Difficulty
- 5/5
- Estimated time
- Over a week
- Activity status
- Stale
- Clarity
- Mostly clear
- Newbie friendliness
- 30/100