Rechercher une page de manuel
v.delaunay.1grass
Langue: en
Version: 315046 (ubuntu - 07/07/09)
Section: 1 (Commandes utilisateur)
NAME
v.delaunayDESCRIPTION
v.delaunay uses an existing vector points map (input) to create a Delaunay triangulation vector map (output).
Delaunay triangulation and Voronoi diagram example: | Delaunay Triangulation (left pane), Voronoi diagram (center pane), and both (right pane)
EXAMPLE
Commands used with the Spearfish dataset to create the above figure.g.region n=4927250 s=4919400 w=588650 e=594850
d.frame -c fr=one at=0,100,0,33.3333
d.frame -c fr=two at=0,100,33.3333,66.6667
d.frame -c fr=three at=0,100,66.6667,100
v.delaunay -lr in=archsites out=arch_delaunay
d.frame -s one
d.vect arch_delaunay
d.vect archsites color=red fcolor=red size=5 icon=basic/circle
v.voronoi -l in=archsites out=arch_voronoi
d.frame -s two
d.vect arch_voronoi type=line
d.vect archsites color=red fcolor=red size=5 icon=basic/circle
d.frame -s three
d.vect arch_voronoi type=line
d.vect arch_delaunay color=blue
d.vect archsites color=red fcolor=red size=5 icon=basic/circle
REFERENCES
Steve J. Fortune, (1987). A Sweepline Algorithm for Voronoi Diagrams, Algorithmica 2, 153-174.SEE ALSO
v.voronoi, v.hull,AUTHORS
James Darrell McCauley, Purdue UniversityGRASS 5 update, improvements: Andrea Aime, Modena, Italy
GRASS 5.7 update: Radim Blazek
Last changed: $Date: 2006/05/24 08:51:52 $
Full index
Contenus ©2006-2024 Benjamin Poulain
Design ©2006-2024 Maxime Vantorre