Opened 11 years ago
Closed 11 years ago
#629 closed enhancement (fixed)
Improve the snap algorithm choosing the closest_point as snapped vertex
Reported by: | aperi2007 | Owned by: | strk |
---|---|---|---|
Priority: | major | Milestone: | 3.3.9 |
Component: | Default | Version: | main |
Severity: | Unassigned | Keywords: | history, snap |
Cc: |
Description
Actually the snap algorithm choose as snap point the first vertex that match the rules (under to snap value) calling it "first snappable point". This could cause invalid polygon when there is more than one vertex under the limit snap value. To avoid this kind of invalidity an improve to the algorithm could be to snap the closest_point instead of the first snappable point.
Find the closest_point if a time consuming analyze because should be necessary to analyze all the vertex of the geometry. But realistic many cases are resolvable checking a more limited number of vertex after the the analyzing vertex as example checking 10 or 20 vertex after the first snappable point to see if exists a more closest point.
Change History (3)
comment:1 by , 11 years ago
comment:2 by , 11 years ago
Owner: | changed from | to
---|---|
Status: | new → assigned |
comment:3 by , 11 years ago
Keywords: | history snap added |
---|---|
Milestone: | → 3.3.9 |
Resolution: | → fixed |
Status: | assigned → closed |
see #501 for one case that would be fixed by snapping to closest point