1v.delaunay(1) Grass User's Manual v.delaunay(1)
2
3
4
6 v.delaunay - Create a Delaunay triangulation from an input vector map
7 containing points or centroids.
8
10 vector
11
13 v.delaunay
14 v.delaunay help
15 v.delaunay [-rl] input=name output=name [--overwrite]
16
17 Flags:
18 -r Use only sites in current region
19
20 -l Output triangulation as a graph (lines), not areas
21
22 --overwrite
23
24 Parameters:
25 input=name
26 Name of input vector map
27
28 output=name
29 Name for output vector map
30
32 v.delaunay uses an existing vector points map (input) to create a
33 Delaunay triangulation vector map (output).
34
35 Delaunay triangulation and Voronoi diagram example: | Delaunay Trianguā
36 lation (left pane), Voronoi diagram (center pane), and both (right
37 pane)
38
40 Commands used with the Spearfish dataset to create the above figure.
41 g.region n=4927250 s=4919400 w=588650 e=594850
42 d.frame -c fr=one at=0,100,0,33.3333
43 d.frame -c fr=two at=0,100,33.3333,66.6667
44 d.frame -c fr=three at=0,100,66.6667,100
45 v.delaunay -lr in=archsites out=arch_delaunay
46 d.frame -s one
47 d.vect arch_delaunay
48 d.vect archsites color=red fcolor=red size=5 icon=basic/circle
49 v.voronoi -l in=archsites out=arch_voronoi
50 d.frame -s two
51 d.vect arch_voronoi type=line
52 d.vect archsites color=red fcolor=red size=5 icon=basic/circle
53 d.frame -s three
54 d.vect arch_voronoi type=line
55 d.vect arch_delaunay color=blue
56 d.vect archsites color=red fcolor=red size=5 icon=basic/circle
57
58
60 Steve J. Fortune, [4m(1987). A Sweepline Algorithm for Voronoi Diagrams,
61 Algorithmica 2, 153-174.
62
64 v.voronoi, v.hull,
65
67 James Darrell McCauley, Purdue University
68 GRASS 5 update, improvements: Andrea Aime, Modena, Italy
69 GRASS 5.7 update: Radim Blazek
70
71 Last changed: $Date: 2006/05/24 08:51:52 $
72
73 Full index
74
75
76
77GRASS 6.2.2 v.delaunay(1)