DAVID H DOUGLAS
Biographic Data
| ID | 7248259 |
|---|---|
| NAME | DAVID H DOUGLAS |
| GIVEN NAMES | DAVID H |
| FAMILY NAME | DOUGLAS |
| SIGNATURE | DOUGLAS D H |
| AFFILIATIONS | University of Ottawa/Simon Fraser University, British Columbia |
| VERIFIED | No |
| TOTAL WORKS | 6 |
| TOTAL CITATIONS | 0 |
| AUTHOR COUNT | 6 |
| EDITOR COUNT | 0 |
| FIRST PUBLICATION YEAR | 1973 |
| LATEST PUBLICATION YEAR | 1994 |
| H-INDEX | 0 |
Least-cost Path in GIS Using an Accumulated Cost Surface and Slopelines
One of the most interesting and potentially useful applications of geographic information systems is the computation over a mapped space of the fastest, shortest, least-cost, or least-impact routes, given a map of the area with its frictions, costs and impediments. The problem is compared to the refraction of light, and a general solution is discussed, with algorithms to implement these. The problem is broken down into the computation of an accum…
The Proper Distribution of Tasks to Digitize a Clean Boundary Network
The ease of programming, and thus the common availability of computer programs that display regions filled with colour or texture, or that calculate area, perimeter, or moment-centre, is completely incongruent with the difficulty of producing the data sets required for them to represent the regions. This is termed the 'boundary network' problem. There are many ways, of varying awkwardness, around the problem. The integration of a good boundary ne…
Technology And Education In A Developing Country/An Experience Involving Computer-Assisted Cartography And Indonesia
In 1983 the Midwest Universities Consortium for International Affairs (MUCIA) entered into an agreement with the Ministry of Education of the Government of Indonesia to implement World Bank Education Project IX. A major activity of the project was to bring consultants to three Indonesian universities in fields identified by the universities. One of these fields was computer-assisted cartography by the Facultas Geografi of Universitas Gadjah Mada …
Experiments to Locate Ridges and Channels to Create a New Type of Digital Elevation Model
There have been numerous proposals to combine the advantages of the adaptability of the contour digital elevation model with the neighbourhood functions of the grid. Notable among these is the triangular irregular network model (TIN). This paper presents another approach to digital elevation modelling based on traces of channels and ridges, and other information-rich lines that may be identified on a surface
Part 2
Algorithms for the Reduction of the Number of Points Required to Represent a Digitized Line or Its Caricature
All digitizing methods, as a general rule, record lines with far more data than is necessary for accurate graphic reproduction or for computer analysis. Two algorithms to reduce the number of points required to represent the line and, if desired, produce caricatures, are presented and compared with the most promising methods so far suggested. Line reduction will form a major part of automated generalization
No prominent works on this page.
Algorithms for the Reduction of the Number of Points Required to Represent a Digitized Line or Its Caricature
All digitizing methods, as a general rule, record lines with far more data than is necessary for accurate graphic reproduction or for computer analysis. Two algorithms to reduce the number of points required to represent the line and, if desired, produce caricatures, are presented and compared with the most promising methods so far suggested. Line reduction will form a major part of automated generalization
Part 2
Experiments to Locate Ridges and Channels to Create a New Type of Digital Elevation Model
There have been numerous proposals to combine the advantages of the adaptability of the contour digital elevation model with the neighbourhood functions of the grid. Notable among these is the triangular irregular network model (TIN). This paper presents another approach to digital elevation modelling based on traces of channels and ridges, and other information-rich lines that may be identified on a surface
Technology And Education In A Developing Country/An Experience Involving Computer-Assisted Cartography And Indonesia
In 1983 the Midwest Universities Consortium for International Affairs (MUCIA) entered into an agreement with the Ministry of Education of the Government of Indonesia to implement World Bank Education Project IX. A major activity of the project was to bring consultants to three Indonesian universities in fields identified by the universities. One of these fields was computer-assisted cartography by the Facultas Geografi of Universitas Gadjah Mada …
The Proper Distribution of Tasks to Digitize a Clean Boundary Network
The ease of programming, and thus the common availability of computer programs that display regions filled with colour or texture, or that calculate area, perimeter, or moment-centre, is completely incongruent with the difficulty of producing the data sets required for them to represent the regions. This is termed the 'boundary network' problem. There are many ways, of varying awkwardness, around the problem. The integration of a good boundary ne…
Least-cost Path in GIS Using an Accumulated Cost Surface and Slopelines
One of the most interesting and potentially useful applications of geographic information systems is the computation over a mapped space of the fastest, shortest, least-cost, or least-impact routes, given a map of the area with its frictions, costs and impediments. The problem is compared to the refraction of light, and a general solution is discussed, with algorithms to implement these. The problem is broken down into the computation of an accum…
Computer Science (6 works) · Mathematics (5 works) · Geometry (4 works) · Algorithm (3 works) · Engineering (3 works) · Geographic Information Systems Studies (3 works) · Geography (2 works) · Geology (2 works) · Historical Geography and Cartography (2 works) · Remote sensing (2 works)