CUAHSI / CUAHSI/HydroDesktop

Search across multiple polygons

Open
#25 0 comments 0 reactions 0 assignees View on GitHub
CodePlex
Dominant language
C#
Stars
76
Forks
21
PR merge metrics
No merged PRs in 30d

Description

jirikadlec2[CodePlex]
When searching across multiple polygons which are neighboring polygons -
try to union these polygons first (using DotSpatial topology function) and then search on the bounding box.

This should speed up the search, by reducing the number of PointInPolygon tests and reducing the number of HIS Central service calls

Contributor guide

No contributing guide indexed for this repository

Research direction

Start by locating the multi-polygon search entry point, the PointInPolygon checks, and the HIS Central service calls. Review how DotSpatial topology functions can union neighboring polygons before the bounding-box search; done means the search still returns the expected results with fewer point-in-polygon tests and service calls.

Written by the indexing model from the issue text.

Assessment

Tech stack
csharp
Domain
search
Issue type
Refactor
Difficulty
4/5
Estimated time
3-5 days
Activity status
Stale
Clarity
Mostly clear
Newbie friendliness
30/100

Get new issues in your inbox

A short digest of beginner-friendly GitHub issues.