Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with gis-principle
Search options not deleted
user 960
Use for questions which involve a GIS principle or theory and are software agnostic
4
votes
Algorithms for matching segments
If you tear apart one of the linestrings to compare and test if the vertexpoints is within some distance from the other linestring to compare you can control the test in many ways.
those examples work …
- 13.3k
23
votes
What are Definition, Algorithms and Practical Solutions for Concave Hull?
There is an implementation of ST_ConcaveHull in PostGIS trunk.
http://postgis.net/docs/ST_ConcaveHull.html
- 13.3k