Processing System for Two-dimensionally Distributed Data : (1) Triangulation of Two-dimensionally Irregularly Spaced Points
An algorithm to triangulate the two-dimensionally irregularly spaced points is explained. By using the algorithm, contour map can be obtained directly from the field observation data.
Saved in:
| Published in | Geoinformatics Vol. 1988; no. 13; pp. 1 - 16 |
|---|---|
| Main Authors | , |
| Format | Journal Article |
| Language | English |
| Published |
Japan Society of Geoinformatics
25.11.1988
|
| Online Access | Get full text |
Cover
Loading…
| Summary: | An algorithm to triangulate the two-dimensionally irregularly spaced points is explained. By using the algorithm, contour map can be obtained directly from the field observation data. |
|---|---|
| ISSN: | 0388-502X 1347-541X |
| DOI: | 10.6010/geoinformatics1975.1988.13_1 |