Martin Landa
5cfaea663a
v.hull: support for vector lines
|
пре 15 година | |
|---|---|---|
| .. | ||
| Makefile | пре 16 година | |
| README | пре 17 година | |
| chull.c | пре 15 година | |
| globals.h | пре 17 година | |
| hull.c | пре 15 година | |
| hull.h | пре 15 година | |
| macros.h | пре 17 година | |
| main.c | пре 15 година | |
| read.c | пре 15 година | |
| v.hull.html | пре 15 година | |
| v_hull.png | пре 17 година | |
| write.c | пре 15 година | |
README
ALGORITHM
v.hull calculates the planar convex hull of a sites list by
means of an algorithm like Graham scan, by computing
first the upper part of the convex hull, and the
the lower part. The algorighm has been converted to C
from the pseudo-code found in "Computational Geometry,
algorithms and applications", M. de Berg, M. van Kreveld,
M. Overmars, O. Schwarzkopf, Springer.
Some reference about the algoright can be found in the
online course "CMSC 754: Computational geometry" by Dave Mount.
Andrea Aime 9/2001
-----------------
chull.c
http://maven.smith.edu/~orourke/books/compgeom.html
http://maven.smith.edu/~orourke/books/ftp.html
v.hull calculates the planar convex hull of a sites list by
means of an algorithm like Graham scan, by computing
first the upper part of the convex hull, and the
the lower part. The algorighm has been converted to C
from the pseudo-code found in "Computational Geometry,
algorithms and applications", M. de Berg, M. van Kreveld,
M. Overmars, O. Schwarzkopf, Springer.
Some reference about the algoright can be found in the
online course "CMSC 754: Computational geometry" by Dave Mount.
Andrea Aime 9/2001
-----------------
chull.c
http://maven.smith.edu/~orourke/books/compgeom.html
http://maven.smith.edu/~orourke/books/ftp.html