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 voronoi-thiessen
Search options not deleted
user 19408
Thiessen polygons are polygons (generated from a set of points) whose boundaries define the area that is closest to each point relative to all other points. Thiessen polygons are mathematically defined by the perpendicular bisectors of the lines between all points and are created by means of a triangulated irregular network (TIN) structure.
16
votes
2
answers
2k
views
Constructing a Voronoi diagram using a complicated travel time metric
I have in my possession four sets of shapefiles:
1. Locations (points), around 1000
2. Roads (lines), each road has a speed attribute
3. Terrain (polygons), each zone also has a speed attribute
4. Riv …
- 301