Wildland Resource Information System:
user's guide
Robert M. Russell
PACIFIC
SOUTHWEST
Forest and Range
Experiment Station
FOREST SERVICE
U.S.DEPARTMENT OF AGRICULTURE
P. 0 . BOX 245, BERKELEY, CALJFORNIA 94701
USDA FOREST SERVICE
GENERAL TECHNICAL
REPORT PSW- 10 I1975
David A. Sharpnack
Elliot L. Amidon
Russell, Robert M., David A. Sharpnack, and Elliot L. Amidon
1975. Wildland Resource Information System: user's guide. USDA
Forest Serv. Gen. Tech. Rep. PSW-10, 36 p., illus. Pacific
Southwest Forest and Range Exp. Stn., Berkeley, Calif.
This user's guide provides detailed information about how to use the
computer programs of WRIS, a computer system for storing and manipulating data about land areas. Instructions explain how to prepare maps,
digitize by automatic scanners or by hand, produce polygon maps, and
combine map layers. Support programs plot maps, store them on tapes,
produce summaries, and perform housekeeping tasks.
Oxford:624:U681.3:(084.3) Retrieval Terms: timber management; wildland management; resource use
planning; computer programs; map compilation; WRIS; management information systems.
The Authors
are assigned to the Station's research unit investigating measurement and
analysis techniques for management planning, with headquarters in Berkeley, Calif. ROBERT M. RUSSELL, the unit computer programmer, received a bachelor's degree in mathematics at the University of Michigan
(1956), and worked as a programmer at the University of California, Berkeley, from 1958 until 1966, when he joined the Station staff. DAVID A.
SHARPNACK, a research forester, was educated at the University of Idaho
(bachelor's degree in forestry, 1961) and the University of California,
Berkeley (master's degree in statistics, 1969), and has been with the Station since 1962. ELLIOT L. AMIDON is in charge of the measurement and
analysis techniques research unit. He earned a bachelor's degree in forest
management at Colorado State University (1954) and a master's degree in
agricultural economics at the University of California, Berkeley (1961),
and was assigned to production economics research at the Station until he
assumed his present position in 1971.
CONTENTS Page
1. Preparing Maps ....................................... 1 2. Digitizing Maps With a Scanning Densitometer ............... 1 2.1 Equipment ...................................... 1 2.2 Aperture and Spacing Alternatives .................... 1 2.3 Photographic Reduction ............................ 2 2.4 Scanning Procedure ............................... 2 2.5 Selection of Density Threshold ....................... 2 2.6 Converting to Binary Map (FREQTB) .................. 8 3 . Digitizing Maps by Hand ............................... 8 3.1 Equipment ...................................... 8 3.2 Digitizing Procedure ............................... 8 3.3 Converting to Binary Map (HANDY) .................. 8 4 . Producing a Polygon Map ............................... 9 4.1 Editing the Binary Map ............................. 9 4.1.1 Editing Guidelines ............................ 9 4.1.2 Recording Error Corrections ................... 11 4.2 Recording Polygon Labels .......................... 11 4.2.1 Setup ..................................... 11 4.2.2 Symbol Transcription ........................ 11 4.2.3 Label Recording ............................ 11 4.2.4 Master Label Accumulation .................... 11 4.3 Extracting Polygons fr6m a Binary Map (POLLY) ....... 12 4.4 Editing POLLY Printout ........................... 12 4.5 Editing a Polygon File with a Line Plotter .............. 18 4.6 Work Flow ..................................... 19 5. Combining Layers ................................... 19 5.1 Overlaying Maps from Two Layers (MOSAIC) .......... 19 5.2 Aggregating Overlay Acreages (TALLY) ............... 20 6 . Support Programs .................................... 21 6.1 Plotting a Map (CHART) ........................... 21 6.2 Storing Several Maps on One Tape (FLEET) ............ 21 6.3 Printing Diagnostic Summary of a Map (GOSSIP) ........ 22 6.4 Printing General Summary of a Map(RUM0R) . . . . . . . . . 22 6.5 Housekeeping Program (SIGNAL) .................... 22 7. Program Notes
7.1 Computer System ................................. 24 7.2 Files .......................................... 24 7.3 Card Formats ................................... 25 7.3.1 System Cards ............................... 25 7.3.2 Header Records ............................. 25 7.3.3 Integer Lists ............................... 26 7.3.4 Comments ................................. 26 7.4 Printout ........................................ 26 8 . Appendixes ........................................ 27 A-Transcribing Forest-type Descriptions
to Computer-Readable Format ........................ 27 B-Major Forest-type Assignments ....................... 28 C-Operating the PDS Microdensitometer . . . . . . . . . . . . . . . . . 36 PREFACE The Wildland Resource Information System
(WRIS) is a computerized system for storing and
manipulating data about land areas. The resource
manager defines a geographic area by drawing a
boundary around it on a map. In nature, such boundaries are irregular in shape. We retain their shapes
within the system by representing them mathematically as multiple-edged polygons. Polygons are the
fundamental building blocks of WRIS. They can
represent timber stands, soil types, alternative treatments, and many other categories. WRIS has so far
been used mostly for timber management; therefore
examples and terminology in this report are taken
from that activity. But the system can be put to work
in other fields-even those outside of forestry.
A group of polygons forms a map. The mosaic of
polygons must exhaust the surface area, but polygons
must not overlap each other. All polygons on one
map must be from the same layer (sometimes called
an overlay by other workers). The layer can represent
one kind of attribute, such as timber type. Other
layers may be constructed, defining different attributes of the same ground area. To handle combinations of attributes, WRIS can overlay any two layers.
The attribute of a polygon is expressed as a label,
consisting of from 1 t o 3 6 characters. Each polygon
must have a label attached t o it. A label is not unique
-it may occur many times on a map, once for every
polygon containing the same attribute. The polygons
on a map are assigned unique serial numbers, called
item numbers, for identification purposes.
WRIS can be applied t o an entire National Forest
by dividing the Forest into townships (quadrangle
sheets would be better) and by processing the maps as
separate units. Each layer on a township map is
drawn separately with inked lines on 24- by 24-inch
(610 m m by 610 mm) paper by using a scale of 4
inches per mile. (Other scales and smaller map sheets
are possible.) Then we scan it on a microdensitometer
with a grid spacing of .024 inch (.61 mm). Our scanner requires transparencies no larger than 9 inches
(229 mm) on a side, so the map needs t o be reduced
photographically.
The scanning operation stores the map in digital
form on magnetic tape. This tape is condensed by a
computer program (FREQTB) which also prints out
the grid so it can be checked for errors. The grid
consists of zeroes and ones: zeroes for the areas between lines, and ones for the points falling on polygon boundary lines.
The POLLY program then converts this grid into a
file of polygons and attaches a label to each. When
this is done for each layer on each township, a complete data base becomes available for a Forest. Other
programs are used to combine layers (MOSAIC), accumulate acreage totals (TALLY), and draw the maps
on a digital plotter (CHART).
If a map sheet is extremely simple, containing few
boundary lines, most of the scanned points are
zeroes. It is more efficient t o hand digitize this kind
of map and t o process it through the HANDY program instead of using FREQTB.
WRIS was developed by the Station's research unit
investigating measurement and analysis techniques for
management planning. This User's Guide provides
detailed information about how t o use the computer
programs of the system. For a fuller description of
the development and characteristics of WRIS and for
production information, see the companion report
WRIS: A Resource Information System for Wildland
Management (USDA Forest Service Research Paper
PSW-107). Copies are available upon request to:
Director
Pacific Southwest Forest and Range Experiment
Station
P.O. Box 245
Berkeley, California 94701
Attention: Publication Distribution
The WRIS computer programs are also available
upon request. They will be copied on a magnetic tape,
t o be supplied by the requestor. Before sending the
tape, the requestor should contact this Station (Attention: Computer Services Librarian), at the above
address, and give the tape format desired.
1.
PREPARING MAPS
Preparing maps c o r r e c t l y i s t h e s i n g l e
most important s t e p i n t h e d i g i t i z i n g process. Eliminating e r r o r s a t t h i s s t e p has
a g r e a t e r impact on c o s t than doing s o a t
any o t h e r s t a g e . These two sources of
e r r o r s can be eliminated: poor ink l i n e
q u a l i t y and l o g i c a l map e r r o r s .
Ink l i n e s should be of uniform width
and uniform d e n s i t y . Moving t h e pen t o o
r a p i d l y along a s t r a i g h t edge when inking
s t r a i g h t boundaries produces a t h i n , weak
l i n e . A good q u a l i t y inking job can comp l e t e l y eliminate t h e need t o make corrections i n l a t e r stages.
The most common l o g i c a l e r r o r s t h a t
can be eliminated a t t h i s s t a g e a r e polygons
without l a b e l s and two d i f f e r e n t l a b e l s i n
one polygon. The l a t t e r e r r o r may occur
because t h e s i z e and shape obscure t h e
f a c t t h a t it i s one polygon. I t may a l s o
occur because t h e l i n e s e p a r a t i n g two polygons was not inked.
Maps t o be d i g i t i z e d with a scanner
must be s p e c i a l l y prepared. Draw i n ink
t h e polygons t o be d i g i t i z e d . They must be
nonoverlapping and completely f i l l t h e a r e a
t o be d i g i t i z e d . Have only one l a y e r o f
information p e r map; f o r example, one map
f o r timber-type, one f o r management cons t r a i n t s , and one f o r a d m i n i s t r a t i v e
boundaries. To have polygons f i l l t h e a r e a
assign a s p e c i a l l a b e l t o a l l a r e a s which
a r e not of i n t e r e s t . This s t e p i s c r i t i c a l
f o r finding a l l e r r o r s during t h e e d i t i n g
process. The map must a l s o be f r e e of
i s l a n d s ( f i g . 1) . Remove by connecting
them t o t h e "mainland" i n two separate
p l a c e s ( f i g . 2 ) . Eliminating i s l a n d s c r e a t e s
new polygons. These must be labeled with
t h e same l a b e l a s t h e polygon they were
s p l i t from. The new polygons should be a t
l e a s t l a r g e enough f o r a l a b e l t o be e a s i l y
printed inside.
A l l t h e maps on t h e S t a n i s l a u s and
Eldorado National Forests were drawn with
a ft2 rapidograph pen. Write a l l o t h e r
information on t h e map, such a s polygon
l a b e l s , control point numbers, o r geographic
coordinates with a non-photo blue p e n c i l .
No s p e c i a l preparation o f maps i s needed
f o r t h e hand d i g i t i z i n g process. However,
comments about l o g i c a l e r r o r s s t i l l apply.
2.
2.1
DIGITIZING A MAP WITH A SCANNING
DENSITOMETER
Equipment
In d i g i t i z i n g with scanning densitometer
t h e o p t i c a l d e n s i t y of a map i s measured a t
every p o i n t . For t h e i n v e n t o r i e s o f t h e
Eldorado and S t a n i s l a u s National Forests w
used a Photometric Data Systems PDS-1010.1'
R e l a t i v e l y slow but a c c u r a t e , t h i s f l a t - b e d
densitometer uses orthogonal lead screws
and stepping motors t o provide a r a s t e r
scan of t r a n s p a r e n t m a t e r i a l . Output i s
a 1 0 - b i t d e n s i t y f o r each spot i n t h e r a s t e r .
These d e n s i t i e s a r e w r i t t e n on magnetic tape
a t 556 b p i . The 10-bit d e n s i t y provides
a gray-scale of 1024 l e v e l s . The scanner
bed has a 9-by 9-inch (229 mm) scan a r e a .
To accommodate t h e bed s i z e and t h e need
f o r using a transparency, a photographic
reduction negative i s scanned r a t h e r than
t h e o r i g i n a l map. Therefore, t h e u s e r has
wide choice of map s i z e and m a t e r i a l .
2.2
Aperture and Spacing A l t e r n a t i v e s
The scanner can make a d e n s i t y reading
a t any g r i d spacing which i s a multiple of
2 o r 3 micrometers. The scanner can use one
o f 20 apertures ( s i z e of spot measured)
ranging from 3.5 t o 3 9 6 . 6 7 micrometers i n
diameter. In a d d i t i o n , t h e reduction f a c t o r
used i n making t h e negative can be varied.
Ink l i n e width on t h e o r i g i n a l map can a l s o
be v a r i e d .
The optimum combination of spacing,
a p e r t u r e , reduction, and l i n e width i s
influenced by f o u r major i n t e r r e l a t e d fact o r s : map s i z e , map d e t a i l , scanning time,
and computer processing time. A l o s s i n
e f f i c i e n c y due t o a change i n one f a c t o r
can be p a r t i a l l y o f f s e t by changes i n t h e
other three.
1. Map s i z e : The l a r g e r t h e map t h e
longer it t a k e s t o scan and process t h e
d a t a f o r a given l e v e l o f d e t a i l . Spacing,
a p e r t u r e s , and l i n e width can be increased
t o speed up processing i f map d e t a i l permits.
2. Map d e t a i l : Spacing and a p e r t u r e
cannot be l a r g e r than t h e d i s t a n c e between
t h e c l o s e s t l i n e s which must be recognized
a s s e p a r a t e , times t h e reduction f a c t o r .
Line width times reduction f a c t o r must a l s o
be equal t o o r l a r g e r than spacing and aperture.
I/Trade names and commercial e n t e r p r i s e s
o r products a r e mentioned s o l e l y f o r i n f o r mation. No endorsement by t h e U.S. Department of Agriculture i s implied.
3. Scanning time: Scanning time i s
a f u n c t i o n o f t h e l e n g t h of a row i n micrometers and t h e number o f rows. Typical
scanning times f o r 24- by 24-inch (610 mm
by 610 mm) maps run from 10 t o 1 3 h o u r s .
T h e r e f o r e , use t h e maximum r e d u c t i o n f a c t o r
possible.
4. Computer p r o c e s s i n g time : Processi n g time i s almost wholly a f u n c t i o n o f t h e
t o t a l number o f d e n s i t y r e a d i n g s . Theref o r e , use t h e widest s p a c i n g p o s s i b l e cons i s t e n t with t h e requirements o f map d e t a i l .
Spacing can be up t o 10 p e r c e n t wider t h a n
the aperture.
We found t h a t a s p a c i n g of 60 ym, an
a p e r t u r e o f 56 pm, a 10X r e d u c t i o n f a c t o r ,
and #2 rapidograph pen l i n e s provide good
r e s u l t s . This combination i s f o r 1:15840s c a l e and 1:31680-scale maps and f o r photog r a p h i c equipment with a maximum r e d u c t i o n
o f 1 1 X . The c a p a b i l i t y f o r g r e a t e r reduct i o n might have changed t h e parameters.
Use d i f f e r e n t weights i n a s s e s s i n g
optimum combinations i f t h e scanner has
d i f f e r e n t o p e r a t i n g c h a r a c t e r i s t i c s . For
example, many high-speed s c a n n e r s have
only t h r e e a p e r t u r e s and e q u i v a l e n t s p a c i n g s .
The scanning t i m e s , however, run from 2
t o 10 minutes, s o maximum r e d u c t i o n i s n o t
needed. S e l e c t a convenient a p e r t u r e and
s p a c i n g and vary t h e r e d u c t i o n f a c t o r t o
s u i t map d e t a i l .
2.3
Photographic Reduction
I t i s n o t n e c e s s a r y t o o b t a i n an
exact reduction f a c t o r . Scale control is
o b t a i n e d through c o n t r o l p o i n t s r a t h e r than
by c a l c u l a t i o n o f a sequence o f enlargement
and r e d u c t i o n f a c t o r s . Almost any high
c o n t r a s t copy f i l m intended f o r l i n e
drawings can be used f o r making t h e
r e d u c t i o n n e g a t i v e . A combination o f
t r a n s m i t t e d and r e f l e c t e d l i g h t produces
t h e b e s t r e s u l t s . The t r a n s m i t t e d l i g h t
i n c r e a s e s t h e c o n t r a s t between ink l i n e s
and background. The r e f l e c t e d l i g h t i s
needed t o wash o u t t h e non-photo b l u e
labels.
2.4
Scanning Procedure
Place t h e n e g a t i v e on t h e scanner
bed s o t h a t t h e scan s t a r t s i n t h e upper
l e f t hand c o r n e r o f t h e s c a n a r e a and
t h e f i r s t scan l i n e i s l e f t t o r i g h t a c r o s s
t h e t o p . I n s e t t i n g up t h e X and Y scan
limits, be s u r e t o i n c l u d e a s few e x t r a
r e a d i n g s a s p o s s i b l e . The e x t r a r e a d i n g s
i n c r e a s e t h e volume o f d a t a and t h u s t h e
cost of processing.
The machine s e t t i n g s we used f o r t h e
S t a n i s l a u s and Eldorado National F o r e s t s
maps t o g e t a spacing o f 60 pm and an
a p e r t u r e o f 56 pm were: s e t upper and
lower a p e r t u r e t u r r e t a t E , s e t upper and
lower magnification a t 2, s e t micrometers
per s t e p a t 6, s e t steps per reading a t
10, X-axis motor a t B , and Y-axis motor a t
E.
(See a l s o Appendix C.)
2.5
S e l e c t i o n o f Density Threshold
To e x t r a c t polygons from t h e scanner
d a t a , t h e g r i d o f d e n s i t i e s ( f i g . 3)
must be converted t o a b i n a r y map, which
i s a g r i d with ones f o r l i n e s and zeros
f o r spaces between l i n e s . To c o n v e r t ,
a l l d e n s i t i e s below a t h r e s h o l d a r e s e t
t o one and a l l d e n s i t i e s above t h a t t h r e s h o l d t o zero. When a scanner t a p e i s r e a d ,
a l l o r a sample o f t h e d e n s i t i e s a r e used
t o c o n s t r u c t a frequency t a b l e . The mode,
t h e most f r e q u e n t c l a s s , r e p r e s e n t s t h e
d e n s i t y o f most o f t h e background o f a map.
The mode i s used t o c a l i b r a t e t h e d e n s i t i e s
f o r d i f f e r e n c e s i n exposure and development
i n making t h e n e g a t i v e .
The t h r e s h o l d i s s e t by t h e d e n s i t y
adjustment f a c t o r r e a d i n t o t h e program
FREQTB ( f i g . 4 ) . The d e n s i t y adjustment
f a c t o r i s t h e number o f d e n s i t y l e v e l s t h e
t h r e s h o l d i s below t h e mode ( f i g s . 5 , 6 , 7 ) .
The l a r g e r t h e d e n s i t y adjustment f a c t o r
t h e lower t h e t h r e s h o l d and t h u s t h e
fewer ones t o r e p r e s e n t l i n e s . A p a r t i c u l a r d e n s i t y adjustment f a c t o r should
be c o n s t a n t f o r one b a t c h o f maps and
n e g a t i v e s . A new b a t c h may r e q u i r e
changing t h e adjustment f a c t o r . Tying
t h e t h r e s h o l d t o t h e mode t a k e s c a r e o f
minor d i f f e r e n c e s w i t h i n a b a t c h . E d i t
f i r s t FREQTB p r i n t o u t f o r a b a t c h o f
maps b e f o r e making any more runs.
(See
s e c t i o n 4 . 1 on e d i t i n g a b i n a r y map.) I f
t h e l i n e s have t o o many gaps, (ADDS) t h e
t h r e s h o l d i s t o o low.
To r a i s e t h e t h r e s h o l d , lower t h e
d e n s i t y adjustment. I f t h e r e a r e t o o
many p l a c e s which should be gaps and a r e
n o t (DELETES), t h e t h r e s h o l d i s t o o h i g h .
Lower t h e t h r e s h o l d by e n l a r g i n g t h e
adjustment f a c t o r . The a b s o l u t e number
o f ADDS and DELETES i s used t o judge t h e
t h r e s h o l d . About twice a s many DELETES
a s ADDS i s a good balance t o s t r i v e f o r
( f i g s , 8, 9 , 10).
Figure 1--Polygons labeled A are considered islands by WRIS.
Figure 2--The islands in figure 1 have been removed by adding
connecting lines.
Figure 3--Densities of a two-digit scan of a portion of a map
743C
644C
602C
541C
427C
383C
347C
354C
318C
290C
304C
8)
9)
10)
11)
12)
13)
14)
15)
16)
17)
18)
threshold
I
density
adjustment
factc
Figure 5--A binary map was produced from the densities of figure 3,
but the threshold used was too low.
Figure 4--Frequency table shows the
relationship between the mode, density
adjustment factor, and threshold.
00000000000000000000100000011111000000000011111111111111111100000
00000000000000000001000000110000110110001110000001100000000000000
10000000000000000001000001100000011111111110000000000000000000000
11000000000000000001000001100000000000000011000000000000000000000
00110000000000000001100001000000000000000001100000000000000000000
00011000000000000001100010000000000000000000100000000000000000000
.
from the densities of figure 3 with
the correct threshold used.
00001100000000000001100100000000000000000000100000000000000000000 00000100000000000001100100000000000000000001100000000000000000000 00000010000000000001001000000000000000001111000000000000000000000
00000011000000000001111000011110000011111000000001111110000000000
00000001100000000001000001110110001100000000011111110011100000000
00000000100000000000001110001100110000000111100000000000110000000
00000000100000000000111000010001100000111100000000000000011111001
00000000100000000001100000110011000011100000000000000000110111111
00000000100111000001100000111100000110000000000000000001100000000
00000001101101100000100000010000011000001111111100000111000000000
00000011001100111001100000000000110011110000001111111100000000000
00000010001100001111000000000011001111000000000000001000000000000
00000110000100000110000000000110011011000000000000001000000000000
00001100000100000000000000001101100011000000000000001100000000000
00001000000100000000000000110011000001000000000000001100000000000
00011000000100000000000001100110000001110000000000001000000000000
00110000000100000000000010011000000000001000000000001100000000000
00100000000100000000001100110000000000001100000000000100000000000
01100000000110000000011001100000000000000100000000000100000000000
01000000000011100001110011000000000000000110000000001100000000000
10000000000000111111000100000000000000000011000000011000000000000
Figure 7 - 4 binary map was produced
from the densities of figure
3 with a
threshold that was too high.
00001100000100000000000000111011000011000000000000001100000000000
00011000000100000000000001101110000001111000000000001100000000000
00110000000100000000000111011100000000011100000000001100000000000
00110000000110000000001110110000000000001100000000001100000000000
01100000000110000000011001100000000000000100000000001100000000000
11000000000111110001110011000000000000000110000000001100000000000
11000000000001111111001110000000000000000011100000011000000000000
10000000000000000000011100000000000000000001111111110000000000000
00000000000000000000111000000000000000000000011111000000000000000 00000000000100000011100000000000000000000000000000000000000000000
00000000001111111111000000000000000000000000000000000000000000001 00000000111000000000000000000000000000000000000000000000000000001 oooooooiiioooooooooooooooooooorinnoonooooooooooooooooooooooooooooo
Figure 8-FREQTB printout of
binary map in figure 5.
Figure 9-FREQTB printout of
binary map in figure 6,
Figure 10--FREQTBprintout of binary map in figure 7.
2.6
INPUT UNIT=A$
FILES=4;SKIPS=O$
DENSITY ADJUSTMENT FACT@R=22$
FOREST=ELD@RADfe
LAYER=TIMBER;MAP=17;
OUTPUT UNIT=B$
@ FIN
Converting Binary Map (FREQTB)
FREQTB r e a d s a microdensitometer
t a p e and t a b u l a t e s t h e frequency o f
each d e n s i t y l e v e l from 0 t o 63, u s i n g
t h e s i x h i g h - o r d e r b i t s o f each d e n s i t y
r e a d i n g . Each s i x - b i t v a l u e i s converted
t o a one, i f below, o r a zero, i f above
an e s t a b l i s h e d t h r e s h o l d . FREQTB computes
t h i s t h r e s h o l d by s u b t r a c t i n g t h e DENSITY
ADJUSTMENT FACTOR from t h e mode o f t h e
d e n s i t y frequency t a b l e . The r e s u l t i n g
matrix of binary values duplicates t h e
scanned n e g a t i v e , w i t h ones r e p r e s e n t i n g
l i n e s (low d e n s i t y ) and zeros r e p r e s e n t i n g
t h e background (high d e n s i t y ) . The onelzero
v a l u e s a r e w r i t t e n compactly on t a p e f o r
use by POLLY. To allow manual e d i t i n g ,
t h e binary values are a l s o printed.
FREQTB w i l l process one o r more
f i l e s ( i - e . , maps) from one scan t a p e ,
with o u t p u t on one o r more t a p e s a s
s p e c i f i e d by t h e u s e r .
Input Cards:
1.
System c a r d s .
2. Input u n i t d e s c r i p t i o n , c o n t a i n i n g
u n i t d e s i g n a t i o n , number o f f i l e s (good
and bad) on t h e i n p u t t a p e (FILES=n) , and
number o f f i l e s ( i f any) t o be skipped a t
t h e beginning (SKIPS=n)
.
3. DENSITY ADJUSTMENT FACTOR f o r
f i r s t map. (See S e c t i o n 2.5.)
4 . Header r e c o r d ( f o r e s t , map, and
l a y e r ) and o u t p u t u n i t f o r f i r s t map.
I f two o r more maps a r e t o be processed from t h e i n p u t t a p e , items 3 and 4 may
be r e p e a t e d f o r each map. They must be i n
t h e same o r d e r a s t h e scanning was done, a s
FREQTB does n o t rewind and then s e a r c h t h e
t a p e f o r subsequent maps. Five minutes of
Univac 1108 computer time i s adequate f o r
a FREQTB job on a map o f 1000 scan rows and
1000 r e a d i n g s p e r row. This s i z e map would
produce about 180 pages o f output ( l e s s i f
map has l a r g e blank a r e a s ) .
Sample i n p u t deck:
@ RUN JqEDgE,
123456,5,200
@ CTL CLS=N
@FHASG A=1234
@W ASG B=5678
@ ASG X=9876
@ CUR
IN X
TRI X
@ XQT FREQTB
3.
DIGITIZING MAPS BY HAND
The computer time r e q u i r e d t o p r o c e s s
an automatically-scanned map does n o t
depend on i t s complexity. The same number
o f d e n s i t y readings must be taken on a
simple map a s on a "busy" one. But
on a simple map, n e a r l y a l l r e a d i n g s a r e
zeroes. Therefore, such a map i s r e l a t i v e l y expensive t o process by t h e
scanner method, c o n s i d e r i n g t h e small
amount o f information c o l l e c t e d .
A b e t t e r method i s t o d i g i t i z e o n l y
t h e lines--and do s o manually. For t h i s
we employ a hand-guided d i g i t i z e r and a
program t h a t processes i t s output i n t o t h e
same form produced by FREQTB. Because o f
i t s l i m i t a t i o n s , we c o n s i d e r t h i s an a l t e r n a t i v e r a t h e r than primary method. Users
should choose t h e s c a l e and a r e a o f t h e i r
maps i n such a way t h a t most of t h e work
can be e f f i c i e n t l y processed by t h e scann i n g method, leaving only a small p a r t t o
be hand d i g i t i z e d .
3.1
Equipment
For hand d i g i t i z i n g , we use a Bendix
Datagrid d i g i t i z e r . I t has a r e s o l u t i o n
Move t h e "cursor"
o f 0.01 inch ( . 25 mm)
over t h e map by following t h e inked l i n e s .
The c u r s o r senses i t s c o o r d i n a t e p o s i t i o n s
a s i t moves, and t h e s e x-y c o o r d i n a t e s a r e
recorded on magnetic t a p e .
.
3.2
D i g i t i z i n g Procedure
Tape t h e map t o t h e d i g i t i z e r s u r f a c e .
Move t h e c u r s o r over a l l l i n e s t o be r e corded. A l l boundaries must be c l o s e d .
A boundary may be recorded i n a s many
p i e c e s (records) a s necessary a s long a s
no gap i s l e f t between p i e c e s . A small
o v e r l a p i s d e s i r a b l e . So i s a small
overrun a t T-shaped i n t e r s e c t i o n s . A
s t r a i g h t l i n e i s b e s t done i n P o i n t Mode,
r e c o r d i n g only t h e end p o i n t s . (For o u r
purposes, Point and Line Modes a r e i n t e r changeable.) A s t r a i g h t l i n e done i n Point
Mode looks b e t t e r when p l o t t e d . Do n o t
d i g i t i z e the control points.
3.3
Converting t o Binary Map (HANDY)
The HANDY program r e c e i v e s a s i n p u t
t h e t a p e w r i t t e n by t h e Bendix d i g i t i z e r -
Output i s a t a p e t h a t a p p e a r s t h e same
a s t h e o u t p u t o f FREQTB: a map scanned
on a g r i d having a s p a c i n g o f .02 i n c h
( . 5 mm). HANDY c o n s t r u c t s a g r i d o f t h a t
spacing, p r e s e t s a l l of i t s points t o
t h e v a l u e 0 , and t h e n changes t o 1 a l l
p o i n t s t h a t any d i g i t i z e d l i n e p a s s e s
o v e r . Thus, overlapped segments a r e merely
redundant. Any s p u r - l i k e overruns a r e p a r e d
o f f during l a t e r processing.
Two c a r d s a r e r e q u i r e d i n p u t . The
f i r s t i s a "header record" c o n t a i n i n g
j u s t t h e name o f t h e i n p u t u n i t b e a r i n g
t h e Bendix t a p e . The o t h e r i s a l s o a
header record, f o r our output tape. I t
must c o n t a i n t h e u n i t name, and F o r e s t ,
Map, and Layer.
Here is a t y p i c a l i n p u t deck:
@ RUN RUSS,583301,1,300
@ CTL CLS=N
@ ASG A=1234
@WH ASG B=5678
@ N CUR
IN X
TRI X
@ N XQT HANDY
INPUT UNIT=A $
OUTPUT UNIT=B; F0REST=ELD@RAD0;
MAP=1; LAYER=TIMBER $
'4.
PRODUCING A POLYGON MAP
Once a map h a s been d i g i t i z e d and
condensed t o b i n a r y form, it i s n e c e s s a r y
t o g e n e r a t e a f i l e of polygons from it
and t o a t t a c h l a b e l s t o t h e polygons.
A c o n s i d e r a b l e amount of e d i t i n g i s
n e c e s s a r y t o c o r r e c t e r r o r s and n o i s e .
4.1
E d i t i n g t h e Binary Map
The g e n e r a l procedure i s t o f l a g a l l
e r r o r s on t h e computer p r i n t o u t . Then
r e c o r d a l l c o r r e c t i o n s on d a t a forms
f o r keypunching. The p r i n t o u t i s a s e r i e s
o f v e r t i c a l s t r i p s , commencing with t h e
l e f t - m o s t edge o f t h e map.
4.1.1
Editing Guidelines
V i s u a l l y scan each s t r i p , comparing it
w i t h t h e map o r a photo o f t h e map f o r e r r o r s .
Careful e d i t i n g of t h e p r i n t o u t a t t h i s stage
w i l l save c o n s i d e r a b l e time and c o s t l a t e r .
C o r r e c t each e r r o r by c i r c l i n g each "0" t o be
d e l e t e d with a r e d p e n c i l and c i r c l i n g with
a b l u e o r green p e n c i l each space where an
"9" i s t o be added. Put a check i n t h e r i g h t
margin i f one o r more c o r r e c t i o n s o c c u r i n
a row. These checks w i l l h e l p t o avoid
omissions a t t h e d a t a r e c o r d i n g s t a g e .
Blocks of 10 l i n e s a r e n o t p r i n t e d i f t h e y
a r e blank.
Follow t h e s e r u l e s f o r adding o r
d e l e t i n g "0 's" :
1 . F i l l i n gaps i n l i n e s w i t h a s few
points a s possible (fig. 11).
2. Open t h e gaps between c l o s e l y i n g
l i n e s ( f i g . 12).
Hints f o r e d i t i n g :
1. C o n s t r u c t l 1 r u l e r s Uc o n s i s t i n g of
t h e column heads f o r each s t r i p . I n s e r t
r u l e r s i n t h e p r i n t o u t a t t h e beginning
o f each s t r i p . T h i s h e l p s t o minimize
t h e e r r o r o f f o r g e t t i n g t o change r u l e r s
a t t h e beginning o f each s t r i p . Column
numbers a r e p r i n t e d a t t h e beginning o f
each s t r i p . Row numbers a r e p r i n t e d along
t h e r i g h t s i d e o f t h e s t r i p . The s t r i p
number i s p r i n t e d i n a column t o t h e r i g h t
o f t h e row number.
2. V i s u a l l y f o l l o w each s t r i n g o f
0 ' s looking f o r gaps i n l i n e s , small
polygons, and a r e a s w i t h a high d e n s i t y o f
0 ' s . These gaps a r e p o t e n t i a l a r e a s f o r
c o r r e c t i o n s . Two 0's a r e c o n s i d e r e d
connected i f t h e y a r e i n a d j a c e n t s p a c e s
e i t h e r v e r t i c a l l y , h o r i z o n t a l l y , o r diagona l l y . Look p a r t i c u l a r l y f o r polygons w i t h
only a few i n t e r i o r c e l l s . Such polygons
a r e h a r d t o s p o t when t h e y a r e formed by
diagonal c o n n e c t i o n s . Two k i n d s o f f e a t u r e s
which can cause e x t r a s m a l l polygons a r e
0
s h a r p 180 t u r n s o f a boundary and two
p a r a l l e l b o u n d a r i e s which a r e c l o s e t o g e t h e r on t h e map b u t n o t s e p a r a t e on t h e
printout.
3. S i n c e each a d d i t i o n and d e l e t i o n
must l a t e r be recorded and keypunched,
t r y t o keep c o r r e c t i o n s t o a minimum.
4 . Two polygons connected by a narrow
neck on t h e map may have two d i f f e r e n t
l a b e l s . T h e r e f o r e , t a k e c a r e when c o r r e c t i n g t h i s k i n d o f gap.
5 . The f i r s t two columns on each s t r i p
a r e r e p e a t s o f t h e l a s t two columns o f t h e
p r e v i o u s s t r i p . These columns almost e l i m i n a t e t h e need t o r e f e r t o p r e v i o u s s t r i p s
w h i l e making c o r r e c t i o n s . Any c o r r e c t i o n s
t o a r e p e a t e d column need o n l y be made
once.
6 . Ignore s t r a y 0 ' s which may occur
due t o p o r t i o n s o f l a b e l s o r specks o f
0000000000000000000000
0
0
0
0
0
0
0
0
0
0
00
0
0
00
0
00
0
00
0
0
00
0
0
00
0
0
00
0
0
00
0
0
0
0
0
0
0
0
0
0
0
00
0
0000000000000000000000
0
00
0
0
0
0
00
0
0
0
00
0
0
0
0
00
0
0
0
0
0
0
0
Figure 12-Examples of lines needing DELETES.
Figure 11--Examples of lines needing ADDS.
d i r t t h a t were photographed. A computer
program w i l l "dissolve" them. I t a l s o
dissolves any piece of a l i n e t h a t i s not
p a r t of a loop. This i s a l l r i g h t i f t h e
l i n e came from a smudge but w i l l be an
e r r o r i f it i s due t o a gap i n an inked
line.
7. I t i s highly d e s i r a b l e t h a t t h e
p r i n t o u t should be e d i t e d twice, each
time by a d i f f e r e n t person. Usually
omissions w i l l be found and t h e l i s t
w i l l lengthen.
4.1.2
Recording Error Corrections
Record t h e row and column numbers
where t h e c o n t r o l p o i n t s appear on t h e
binary map. These a r e t h e GRID CONTROL
POINTS i n t h e PgLLY input deck. Record
them i n clockwise order s t a r t i n g with
t h e lower l e f t corner.
Next record t h e "add" and "delete"
c o r r e c t i o n s marked on t h e FREQTB p r i n t o u t .
For convenience i n handling t h e card
decks l a t e r , s t a r t t h e recording with a
card which i d e n t i f i e d t h e adds and d e l e t e s ;
examples: 'ADDS MAP 30' o r 'DELETES MAP
NUMBER 26'. I t i s h e l p f u l t o s t a r t
recording d e l e t e s a t t h e top of a separate
s h e e t . Each s t r i p has a r u l e r f o r recording column numbers. Look f o r check marks
i n t h e r i g h t margin opposite rows needing
c o r r e c t i o n . Record adds and d e l e t e s by
row and column on d a t a forms; examples,
5 , 62, 10,453. For convenience i n subsequent e d i t i n g , s t a r t each l i n e with a
row e n t r y and end with a column e n t r y
followed by a comma. Leave unused columns
blank. In t h i s way an item w i l l not be
s p l i t between l i n e s , and no e r r o r w i l l
occur i f t h e o r d e r of t h e cards i s changed.
Long consecutive l i s t s of items i n one
row o r one column may be added o r deleted
by t h e following short-cut method: [ R , c ~ A C ~ ] ,
o r [ R ~ A R ~ , c ] . (See a l s o Section 7.33.)
4.2
4.2.1
Recording Polygon Labels
Setup
To record t h e x-y p o s i t i o n of t h e
l a b e l s , e s t a b l i s h axes. The length of each
a x i s s l i g h t l y exceeds t h e l a r g e s t map dimens i o n expected. The v e r t i c a l o r "north-southv
d i r e c t i o n i s designated a s t h e y a x i s .
The map i s positioned within t h e r i g h t angle
formed by t h e x-y axes so t h a t t h e control
p o i n t s (and a l l p o i n t s ) w i l l be p o s i t i v e ,
non-zero i n t e g e r s . The x and y distances
from t h e o r i g i n i n hundredths of an inch
a r e recorded a s explained i n t h e s e c t i o n on
map c o n t r o l p o i n t s .
(7.3.2)
4.2.2
Symbol Transcription
I f both upper and lower case l e t t e r s
a r e used i n a map, a t r a n s l a t i o n i n t o a
format acceptable a s computer input i s
required. Rules and examples a r e described i n Appendix A .
The Mylar maps supplied by t h e cont r a c t o r f o r t h e S t a n i s l a u s and Eldorado
National Forests had standard Region 5
f o r e s t - t y p e c l a s s i f i c a t i o n s and t h e r e f o r e
require t r a n s c r i p t i o n of some symbols.
4.2.3
Label Recording
S t a r t recording l a b e l s and t h e i r x-y
p o s i t i o n on a new l i n e of t h e d a t a form.
S e l e c t a coordinate p o s i t i o n t h a t i s
roughly c e n t r a l l y located i n t h e polygon.
Use a non-photo blue pencil t o check o f f
each l a b e l a s it i s recorded. An e n t i t y
c o n s i s t s of a l a b e l followed by i t s x and
y p o s i t i o n . E n t i t i e s a r e separated by a
comma. The l a s t e n t i t y i s followed by
a d o l l a r sign. Within t h e e n t i t y , t h e
t h r e e p a r t s a r e separated by one o r more
blanks. The x and t h e y coordinates a r e
i n u n i t s of 0.01 inch. Thus, 24 inches
from t h e o r i g i n i s w r i t t e n as 2400.
The d a t a i s w r i t t e n a s one long "stream;"
t h a t i s , t h e end of a l i n e on a data form
has no s i g n i f i c a n c e . I f an e n t i t y i s not
complete when t h e l a s t column i s reached,
simply continue on t h e next l i n e . J u s t
one caution, however. I t i s easy t o
forget t h a t a blank i s a s i g n i f i c a n t chara c t e r ( s e p a r a t o r ) . There i s a tendency t o
forget recording t h e blank when it f a l l s
j u s t a f t e r the l a s t column and thus i n
column 1 of t h e next l i n e .
4.2.4
Master Label Accumulation
When complex l a b e l s such a s t h e timber
l a b e l s shown i n Appendix A a r e used, care
must be taken t o eliminate typographical
and l o g i c a l e r r o r s from t h e l a b e l input
deck. PgLLY, t h e polygon e x t r a c t i n g program,
checks each l a b e l against a master l a b e l
l i s t . A message i s p r i n t e d i f t h e l a b e l i s
n o t on t h e master l i s t . For some l a y e r s an
exhaustive l i s t of l a b e l s i s easy t o make.
I t i s not d i f f i c u l t t o completely l i s t
counties, ranger d i s t r i c t s , o r even management c o n s t r a i n t c l a s s e s . However, t h e r e
may be over 1,000 codes used out of a
possible million o r more codes i n t h e
system used f o r t h e timber l a y e r on t h e
S t a n i s l a u s and Eldorado National Forests.
In t h i s s i t u a t i o n WRIS uses l a b e l decks and
t h e program SIGNAL described i n a following
s e c t i o n t o c o n s t r u c t a complete master l a b e l
list.
The process i s s t a r t e d by using t h e
ADD ITEM c o n t r o l card t o put t h e l a b e l
input deck of t h e f i r s t map i n t o t h e master
l a b e l f i l e . The l a b e l s can then be s o r t e d
and p r i n t e d . This s o r t e d l i s t of l a b e l s
should then be very c a r e f u l l y e d i t e d t o
make s u r e t h a t t h e l a b e l s follow a l l t h e
r u l e s o f t h e coding system. Any i n c o r r e c t
l a b e l s can be d e l e t e d from t h e l i s t by using
t h e DELETE LABELS c o n t r o l card. The corr e c t e d l a b e l s a r e then added t o t h e l i s t .
The next deck of l a b e l s can then be checked
a g a i n s t t h e master l a b e l l i s t by using t h e
CHECK LABELS c o n t r o l card. A l l l a b e l s which
were n o t i n t h e o r i g i n a l deck w i l l be f l a g ged i n t h e p r i n t o u t . These should a l l be
checked c a r e f u l l y and any e r r o r s c o r r e c t e d
i n t h e card deck. This deck can then be
added t o t h e master l i s t with t h e ADD ITEM
c o n t r o l card. Duplicates of l a b e l s a l r e a d y
on t h e master l i s t w i l l be ignored. Each
l a b e l input deck i s processed i n t h i s
way; t h a t i s , by c a r e f u l l y checking any
new l a b e l s before adding t h a t deck t o t h e
master l a b e l l i s t .
3. Header record containing only t h e
output u n i t .
4. c o r r e c t i o n cards f o r binary map
from e d i t i n g of FREQTB p r i n t o u t .
Input Cards
1.
System c a r d s .
2 . Header record ( f o r e s t , map, l a y e r ,
geographic c o n t r o l p o i n t s , map control
points, grid control points, location,
s c a l e ) and i n p u t u n i t f o r t h e binary map.
6.
Label deck.
RUN J@E,123456,3,100
CTL CLS=N
CTL SYS=A
ASG A=1234
@W ASG B=5678
@ ASG X=3477
@ N CUR
IN X
TRI X
@ N XQT POLLY
INPUT UNIT=A; F$JREST=ELD@RAD@;
MAP=236;
LAYER=MANAGE
~N
L@
C ATT;I @ N = T ~ ~R16E;
N
SCALE=31680;
GEOGRAPHIC CONTROL P@INTS=39:30:0.0,
120:15:0.0,39:37:30.0,120:15:0.0, 39:37:30.0,120:07:30.0,39:30:0.0, 120:07:30.0;
MAP CONTROL P~INTS=100,100,102,1322,
1380,1318,1318,100;
GRID CONTROL POINTS=474,2,3,3,4,494,
473,471$
OUTPUT UNIT=B$
'ADDS MAP 236'
10,16 $
'DELETES MAP 236'
388,48, L390A391.451 , 392,44,393,
43, [397,44~45] $
FILE
(ALPHA/ LABELS)
LS 300 1200, RL 600 700$
@
@
@
@
.
E x t r a c t i n g Polygons from Binary Map
(POLLY)
POLLY c o r r e c t s a binary map by using
t h e ADDS and DELETES. I t then e x t r a c t s
polygons from t h e b i n a r y map by using t h e
l a b e l l o c a t i o n s a s s t a r t i n g p o i n t s (see
A l l t h e polygons e x t r a c t e d
Section 4 . 2 . 3 ) .
a r e w r i t t e n on t h e output t a p e . POLLY
w i l l run a batch o f jobs when t h e r e i s a
s e r i e s of c o n t r o l cards following t h e XQT
card.
Master l a b e l f i l e name.
Example Input Deck
When a l l decks have been processed t h e
master l a b e l f i l e w i l l contain a complete
l i s t o f a l l l a b e l s which occur a t l e a s t once
on a s e t o f maps. Any new o r changed l a b e l s
which a r e p u t i n t h e l a b e l deck during
e d i t i n g w i l l be flagged by POLLY. This
procedure provides an a d d i t i o n a l chance t o
check t h e l a b e l a g a i n s t t h e coding r u l e s .
I f t h e l a b e l i s c o r r e c t l y constructed it
can be added t o t h e master l a b e l l i s t .
4.3
5.
Limitations
Maximum number of x-y p o i n t s i n any
polygon: 1991
Maximum number of polygons i n one
map: 500
Maximum number of ADDS and DELETES
combined: 5000
4.4
Editing POLLY P r i n t o u t
P r i n t o u t of a normally terminated PgLLY
run w i l l c o n s i s t of t h e s e s e c t i o n s :
1.
Header record input from cards.
2 . Header record r e s u l t i n g from tape
header record merged with card input record.
3.
Output u n i t number.
4.
5.
L i s t of c o r r e c t i o n s f o r binary map.
INPUT CARD ERROR
a.
b.
c.
d.
The header record card has a format
e r r o r . (See Section 7.3.2.)
Additions input cards
Sorted l i s t o f a d d i t i o n s
Deletions input cards
Sorted l i s t of d e l e t i o n s
L i s t of l a b e l s .
a.
b.
Label input cards
Sorted l i s t o f l a b e l s
TOO MUCH DATA ON INPUT CARDS
The t o t a l amount of d a t a i n t h e header
record i s more than t h e program can
handle. See t h e programmer responsible
f o r WRIS maintenance.
6.
Output header record.
READ ERROR WHILE READING ADDITIONS DECK
7.
Local l a b e l l i s t .
READ ERROR WHILE READING DELETIONS DECK
8.
Detailed l i s t o f e x t r a c t e d polygons.
Both of t h e s e e r r o r s r e s u l t from format
e r r o r s such a s missing o r e x t r a commas,
e x t r a b r a c k e t s , o r lack of a record
terminator. See t h e s e c t i o n s on E d i t i n g
t h e Binary Map and on Card Formats f o r
a complete d e s c r i p t i o n of format.
9. Summary record of number and a r e a
o f polygons.
10.
file.
Confirmation of w r i t i n g o f output
For t h e purpose of e d i t i n g , t h i s output can
be considered i n two groups: Items 1-5
deal with i n p u t ; items 6-10 deal with output.
The p r i n t o u t i s organized f o r use i n
e d i t i n g r a t h e r than a s a record of d a t a .
E r r o r s during i n p u t a r e u s u a l l y recording,
format, o r key punch e r r o r s . There a r e
two groups o f e r r o r s : those which s t o p
t h e program and those t h a t do n o t . I t i s
b e s t t o s t a r t looking a t t h e back of t h e
p r i n t o u t t o s e e i f any input e r r o r s have
stopped t h e program. A l i s t of f a t a l e r r o r
messages follows:
INPUT/OUTPUT FILE SPECIFICATION ERROR i
An input o r output u n i t number i s given
i n t h e wrong p l a c e i n t h e input card deck.
I f i = O an i n p u t u n i t number was given where
an output u n i t number was expected. I f
i=l an output u n i t number was given where
an i n p u t u n i t number was expected. (See
Section 4 . 3 f o r proper deck setup.)
INPUT TAPE SHOULD BE MODE 1 BUT IS i
A f i l e with t h e c o r r e c t Forest, Map and
Layer, but without a binary map was read.
Mode of t h e f i l e i s i. (A b i n a r y map i s
mode 1, a polygon map i s mode 2.)
CANNOT RECOGNIZE THE LABEL nnn
The left-hand s i d e of a header record
e n t i t y (nnn) i s misspelled. (See Section
7.3.2.)
ADDITION OUT OF RANGE ROW i COLUMN j
DELETION OUT OF RANGE ROW i COLUMN j
A row o r column exceeds t h e maximum number
of rows o r columns i n t h e map. The
maximums a r e found i n t h e header record
l a b e l l e d "SCAN ROWS1' and SCAN COLUMNS."
CARD INPUT ERROR
This message i n d i c a t e s a format e r r o r
while reading l a b e l s . (See Section 4.2
f o r l a b e l format.)
ERROR READING LABEL DECK i
I f i equals 4, an e n d - o f - f i l e was
encountered while reading t h e l a b e l deck.
The usual cause i s a missing record
terminator. I f i i s g r e a t e r than 4 t h e r e
a r e more l a b e l s than t h e program can
handle. See t h e programmer responsible
f o r WRIS maintenance.
I f t h e POLLY p r i n t o u t i s not terminated
by one of t h e preceding e r r o r messages,
one of t h e following messages may appear
i n t h e l i s t i n g of l a b e l input cards. (Processing continues a f t e r t h e s e e r r o r s . )
N
MASTER LABEL FOUND nnn
The l a b e l nnn i s not i n t h e master l a b e l
l i s t . I f nnn i s not a v a l i d l a b e l it should
be c o r r e c t e d , otherwise it should be added
t o t h e master l a b e l l i s t . The l a b e l i s
used by t h e program a s i f it were a c o r r e c t
label.
N0
C00RDINATES FOUND F0R THIS LABEL nnn
A recording o r key-punching e r r o r has
r e s u l t e d i n no coordinates being associated
with t h e l a b e l nnn. This l a b e l i s ignored
f o r f u r t h e r processing.
The remaining e r r o r messages r e s u l t from
l o g i c a l e f r o r s i n t h e d a t a . They a r e found
during t h e process of e x t r a c t i n g polygons.
The messages w i l l be i n t e r s p e r s e d with t h e
d e t a i l e d l i s t o f polygons. To be a b l e
t o c o r r e c t l o g i c a l e r r o r s i n t h e d a t a some
understanding of t h e thinning and polygon
e x t r a c t i n g algorithms i s needed.
The thinning algorithm s t a r t s with a
binary map a s output by FREQTB and ends with
a binarymapwith a l l l i n e s 1 b i t t h i c k . I t
s t a r t s a t t h e t o p o f t h e map and looks
a t one row a t a time. A row i s scanned
u n t i l a s t r i n g o f one b i t s i s found. A
one b i t i s eliminated from t h e s t r i n g i f
it i s not e s s e n t i a l f o r maintaining a
connection between one-bits i n t h e row
above o r t h e row below. The b i t s i n a
s t r i n g a r e examined i n t h e following order:
The b i t on t h e l e f t end of t h e s t r i n g i s
eliminated u n t i l a connection would be
broken; then t h e b i t on t h e r i g h t end of
t h e s t r i n g i s eliminated u n t i l a connection
would be broken; f i n a l l y , t h e i n t e r i o r b i t s
a r e examined from l e f t t o r i g h t . When a l l
s t r i n g s i n a row have been examined t h e
program moves t o t h e row below. The main
consequence of t h e thinning process f o r t h e
POLLY e d i t o r i s t h a t a gap i n a l i n e causes
t h e l i n e t o be erased down and t o t h e r i g h t
o r l e f t but not up. The e r a s u r e s t o p s when
t h e l i n e meets o r i n t e r s e c t s another l i n e .
Figures 1 3 and 14 show t h e r e s u l t s o f
t h i n n i n g t h e examples i l l u s t r a t e d i n
Figures 11 and 12. Figures 15 through 18
d u p l i c a t e f i g u r e s 11 through 14, but t h e
ADD and DELETE c o r r e c t i o n s have been made.
The polygon e x t r a c t o r s t a r t s with a l a b e l
l o c a t i o n i n t h e binary map. The l a b e l
l o c a t i o n i s found by t h e program by t r a n s forming t h e x-y l a b e l map coordinates i n t o
row-column g r i d coordinates. S t a r t i n g
a t t h e column of t h e l a b e l l o c a t i o n , t h e
row i s scanned t o t h e r i g h t u n t i l a l i n e i s
encountered. The l i n e i s followed clockwise around t h e polygon. A t any i n t e r s e c t i o n t h e c l o s e s t l i n e i n t h e counterclockwise d i r e c t i o n i s taken. The l i n e i s
followed u n t i l t h e s t a r t i n g p o i n t i s reached.
When a deadend i s encountered t h e l a s t b i t
i n t h e l i n e i s eliminated, and t h e program
attempts t o continue following t h e l i n e .
I f t h e next b i t back along t h e l i n e i s now
a deadend it i s eliminated. This backing
up continues u n t i l a b i t i s found which
can continue t h e l i n e o r u n t i l a f i f t h b i t
would be eliminated. When a f i f t h deadend
b i t i s encountered i n a s t r i n g t h e program
abandons t h e attempt t o e x t r a c t t h e polygon
I f t h e program successfully r e t u r n s t o t h e
s t a r t i n g p o i n t it c r e a t e s an a r t i f i c i a l
deadend by f i l l i n g i n t h e row o f t h e l a b e l
l o c a t i o n from t h e s t a r t i n g p o i n t . t o t h e
l a b e l l o c a t i o n . This a r t i f i c i a l deadend
i s used t o d e t e c t multiple l a b e l s i n a
s i n g l e polygon.
With t h e operation of these two algorithms
i n mind we can describe t h e c o r r e c t i o n of
t h e d a t a e r r o r s signaled by t h e following
e r r o r messages. Several of t h e e r r o r
messages a r e followed by t h i s l a b e l p r i n t o u t :
LABEL NUMBER =n, LABEL=m, X = i ,
Y = j MAP LABEL=kkk
n i s t h e p o s i t i o n o f t h e l a b e l i n t h e input
card deck.
m i s t h e p o s i t i o n of t h e l a b e l i n t h e l o c a l
label l i s t
i , j i s t h e l a b e l l o c a t i o n i n map coordinates
kkk i s t h e label
Error messages which begin with 10 a s t e r i s k s terminate processing of t h a t polygon.
**********LABEL LOCATION OUT OF RANGE**********
When t h e x-y l a b e l location i n map coordinates
i s converted t o row-column i n g r i d coordinates
one of t h e coordinates i s o u t s i d e of t h e
range 1 t o "SCAN ROWS" o r "SCAN COLUMNS."
The l a b e l p r i n t o u t following t h i s message
l o c a t e s t h e l a b e l i n t h e card deck and on
t h e o r i g i n a l map so t h a t it can be c o r r e c t e d .
*****THE FOLLOWING LABEL IS ON OR ADJACENT
TO A LINE*****
The l a b e l l o c a t i o n given i n t h e l a b e l p r i n t out t h a t follows t h i s message may be i n e r r o r
I t s l o c a t i o n near a l i n e may a l s o keep o t h e r
e r r o r s from being d e t e c t e d .
REACHED EDGE OF MAP n
The scan t o t h e r i g h t has gone t o column n
and has not encountered any l i n e . The
l a b e l l o c a t i o n i n t h e following l a b e l p r i n t out may have been misread o r recorded wrong.
I f t h e l a b e l i s f o r a small polygon along
0
0
0
0
0
0
0
00
0
0
0 0
0 0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
000000000000 0000000
0 00
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0000000000000000 0000
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0000000000 0000000000
Figure 13--Results of thinning the examples
Figure 14-Results o f thinning the examples
in figure 12 without making DELETtS.
in figure 11 without making ADDS.
0 0
0 0 0
0 0 00000 00000000000 0
00
0 0
0
000 0 0
0
00
0 0
0
00
0 0
0 0
0 0
0
0 0
0
0 0
0
0 0
0
0 0
0 00
0 0
0
00
0 0
0
0
0 0
0
0
0 0
0
0
0 000000 0 000000 0000 0
0
0 0
0
0 0
0
000
0 0
0
0
00000 0
0
0
0 0
0
0
0 0
0
0
0 0
0
0 0 0
0 0
0
o o 000 o 0
0
00
00 0 o
0 0 0 0
o 0
0
0
0 Figure 15-Results of making ADDS in
the examples in figure 11.
Figure 16-Results of making DELETES
in the examples in figure 12.
0
0
o
0
00
00
0ooooo 0000 0
00000
00 0
oooooo 00
00
000
0
0
00 000000000000000000
0
0
0
0
0
0
00
0
0
0
o
o
0
0
0
0
000
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
000000000000
0000000
0
00
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
000000000000 000 0000
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
000000000
0
000
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0000000000 0000000000
0
0
0
0
0
Figure 18--Results of thinning the examples in figure 16.
Figure 17-Results of thinning the examples in figure 15.
t h e t o p , r i g h t , o r bottom edge a small e r r o r
i n e i t h e r map o r g r i d c o n t r o l p o i n t s could
put t h e l a b e l o u t s i d e of t h e map perimeter.
POLYGON TOO LONG. STOPPED AT ROW i ,
COLUMN j LABEL AT ROW k COLUMN n
The polygon has more than t h e maximum
number o f p o i n t s allowed i n i t s border (see
The following
l i m i t a t i o n s i n Section 4 . 3 ) .
l a b e l p r i n t o u t w i l l l o c a t e t h e polygon on
t h e o r i g i n a l map. The polygon must be c u t
i n t o a t l e a s t two smaller polygons by
adding one b i t s t o t h e b i n a r y map using
c o r r e c t i o n c a r d s . A new l a b e l must be
added t o t h e l a b e l deck f o r each new polygon
created.
**********SCAN INTERRUPTED BY ISLAND**********
LABEL AT ROW i , COLUMN j
The polygon boundary does not enclose t h e
l a b e l and i s t h e r e f o r e an i s l a n d i n s i d e t h e
polygon f o r which t h e l a b e l was intended.
Find t h e i s l a n d using t h e l a b e l p r i n t o u t
which follows t h e e r r o r message. Eliminate
t h e i s l a n d with a d d i t i o n s cards (see a l s o
Section 1 on preparing maps).
DEADEND AT ROW i COLUMN j X=x, Y=y,
POLYGON LABEL AT ROW i , COLUMN j
This i s followed by a l a b e l p r i n t o u t and
one o f t h e t h r e e following messages. I f
t h e deadend i s a r t i f i c i a l t h e l e f t end i s
n e a r a previously used l a b e l l o c a t i o n . That
l a b e l i s found and t h i s message i s p r i n t e d :
**********THE FOf!,L@WINGLABEL IS WITHIN 5
HUNDREDTHS OF THE DEADEND**********
This i s followed by a l a b e l p r i n t o u t . The
two l a b e l s a r e i n t h e same polygon. They
can be found i n t h e s o r t e d l a b e l l i s t and
on t h e o r i g i n a l map so t h a t t h e c o n f l i c t
can be resolved. I f t h e two l a b e l s appear
t o be i n adjacent polygons on t h e map and
t h e i r l a b e l l o c a t i o n s a r e c o r r e c t l y recorded,
a gap i n a l i n e may have caused t h e t h i n n i n g
algorithm t o e r a s e t h e boundary between t h e
two polygons.
I f no l a b e l i s found w i t h i n 0.05 inch
(1.27 m) o f t h e deadend it i s assumed
t o be a r e a l , not a r t i f i c i a l , deadend. In
t h i s case two 20-row by 20-column p i e c e s
of t h e b i n a r y map a r e p r i n t e d . The f i r s t
p i e c e i s o f t h e o r i g i n a l b i n a r y map with
t h e c o r r e c t i o n s incorporated. The second
piece i s t h e thinned map. Both pieces a r e
centered on t h e deadend. For s h o r t deadends
these two p r i n t o u t s should be s u f f i c i e n t
f o r c o r r e c t i n g t h e e r r o r . For more complex
c a s e s , t h e FREQTB p r i n t o u t w i l l have t o be
consulted. Deadends l e s s than 5 b i t s long
w i l l be eliminated from t h e boundary by t h e
program and need not be corrected with
delete cards.
This message i s p r i n t e d and processing of
t h i s polygon terminated when t h e deadend
i s more than 4 b i t s long.
**********DEADEND AT BEGINNING AND END OF
POLYGON**********
When a second l a b e l i n a polygon i s on t h e
same row a s t h e f i r s t l a b e l t h e a r t i f i c i a l
deadend i s not seen a s a deadend i n t h e
usual way. This message i s followed by a
l a b e l p r i n t o u t f o r t h e c u r r e n t l a b e l and
a l a b e l p r i n t o u t f o r t h e l a b e l within 0.05
inch (1.27 mm) of t h e deadend.
A t t h e end of t h e d e t a i l e d l i s t of polygons
a r e four numbers which h e l p determine whether
a l l e r r o r s have been eliminated. F i r s t
NUMBER OF LABELS READ1 should equal 'NUMBER
OF POLYGONS WRITTEN'. Any d i f f e r e n c e comes
from not completing some polygon due t o
an e r r o r . The second p a i r o f items 'AREA
OF ENCLOSING POLYGON' and 'AREA OF ENCLOSED
P@LYGONS1should agree within about one
p a r t i n 4000. While one p a r t i n 4000 i s
u s u a l l y much g r e a t e r accuracy than t h e
d a t a warrants, it makes it very u n l i k e l y
t h a t compensating e r r o r s w i l l give t h e
appearance of an e r r o r - f r e e map.
Occasionally, due t o poor q u a l i t y input o r
c a r e l e s s e d i t i n g , a map w i l l have many
i n t e r r e l a t e d e r r o r s . I t i s sometimes
d i f f i c u l t i n t h e s e cases t o t r a c e t h e
cause of a l l t h e e r r o r s . I t i s b e s t then
t o rerun POLLY with a s many c o r r e c t i o n s
a s can be made. Many of t h e remaining
e r r o r s w i l l disappear and t h e r e s t w i l l
be e a s i e r t o c o r r e c t .
4.5
Editing Polygon F i l e With Line P l o t t e r
Editing a polygon f i l e with a l i n e
p l o t t e r h e l p s d e t e c t e r r o r s t h a t POLLY cannot f i n d . Five kinds of e r r o r s can show up
on t h e l i n e p l o t . A lack of agreement
between t h e two areas p r i n t e d a t t h e end
of POLLY i s an i n d i c a t i o n t h a t a t l e a s t
one of these e r r o r s i s p r e s e n t :
1. A l i n e t h a t does not coincide on
t h e p l o t and t h e map. This e r r o r i s u s u a l l y
caused by a mistake i n e d i t i n g t h e binary
map.
2 . A l i n e i s on t h e map but n o t on t h e
p l o t . I f l a b e l s a r e n o t recorded f o r two
a d j a c e n t polygons, t h e i r common boundary w i l l
not be p l o t t e d . I f one l a b e l i s not recorded
and an e r r o r i n e d i t i n g t h e binary map causes
one s i d e of t h e polygon t o be erased t h e
polygon w i l l be included a s p a r t of t h e
a d j a c e n t polygon. An unrecorded l a b e l f o r
a polygon on t h e edge of t h e map w i l l cause
p a r t of t h e map perimeter t o be missing from
the plot.
3 . A s t r a i g h t h o r i z o n t a l l i n e on t h e
p l o t is n o t on t h e map. A l a b e l i s centered
over t h e l e f t end o f t h e l i n e . I t s l o c a t i o n
f e l l e x a c t l y on a polygon boundary i n s t e a d
of within. PGLLY got l o s t t r y i n g t o c o n s t r u c t
t h e polygon and a c c i d e n t a l l y produced t h i s
spurious l i n e . Check t h e l a b e l ' s coordinates o r the control points.
4. Small polygons, u s u a l l y about onet e n t h inch on a s i d e a r e on t h e p l o t but
n o t on t h e map. These a r e caused by an
e r r o r i n e d i t i n g t h e binary map.
5. Polygons a r e missing from t h e p l o t
Since adjacent polygons have some p a r t of
t h e i r boundary i n common with t h e missing
polygon, it w i l l appear t o be p l o t t e d . The
only c l u e t h a t t h e polygon i s absent i s
t h e lack of a l a b e l .
To e d i t t h e p l o t , t a p e it onto t h e top of
t h e o r i g i n a l map with t h e c o n t r o l p o i n t s
aligned a s closely a s possible.
Control p o i n t s on t h e p l o t should a l l be
within 0.05 inch o f t h e c o n t r o l p o i n t s on
t h e o r i g i n a l map. I f t h e c o n t r o l p o i n t s do
not agree, re-measure t h e c o n t r o l p o i n t s on
t h e o r i g i n a l map t o help f i n d which coordinate
i s i n e r r o r . Usually only one of t h e e i g h t
i s wrong. The most common e r r o r s a r e readings t h a t a r e o f f by 0.1, 1, o r 5 inches.
I f a corner i s o f f by a s much a s 1 inch
POLLY should be rerun with t h e c o r r e c t
corners and a new p l o t made.
Then, with t h e p l o t s t i l l on top o f t h e
map, s y s t e m a t i c a l l y scan t h e p l o t looking
f o r t h e f i v e kinds of e r r o r s d e s i r e d e a r l i e r .
When a l l o f t h e e r r o r s have been found,
use t h e POLLY p r i n t o u t and t h e o r i g i n a l
map t o f i n d t h e cause o f a l l t h e e r r o r s .
Then c o r r e c t t h e POLLY input deck and rerun
POLLY.
4.6
Work Flow
Preceding s e c t i o n s have described
each s t e p i n producing a polygon f i l e from
a map s h e e t . The o r d e r o f t h e s e c t i o n s was
chosen f o r expository purposes. The most
e f f i c i e n t sequence of s t e p s , i n p r a c t i c e ,
may be somewhat d i f f e r e n t . The sequence o f
s t e p s given below was found t o work well
on maps of t h e S t a n i s l a u s and Eldorado
National Forests. Experience with o t h e r
kinds o f map p r o j e c t s may suggest modifications t o these steps.
1. Record t h e l a b e l s (See Section
4.2) . Recording l a b e l s before any o t h e r
work i s done provides an a d d i t i o n a l c l o s e
look a t t h e maps and may uncover some
remaining l o g i c a l e r r o r s .
2. Make t h e negative (see Section 2.3)
3.
Scan t h e negative (see Section
2.4).
4. Convert scan t a p e t o binary map
with FREQTB (See Section 2.6).
5.
Edit t h e binary map (See Section
4.1).
6 . Extract polygons from t h e b i n a r y
map with POLLY (See Section 4.3) . POLLY
output should be e d i t e d and POLLY rerun
u n t i l a l l e r r o r messages a r e eliminated.
7 . P l o t t h e map using CHART (See
Section 6.1) .
8.
Edit t h e p l o t (See Section 4.5)
.
9 . Rerun POLLY making c o r r e c t i o n s
found from p l o t . Area of enclosing polygon
and enclosed polygons should agree t o
about one p a r t i n 4000.
A t t h i s p o i n t t h e map i s ready f o r
use and can be processed by any WRIS
program t h a t operates on a f i l e o f polygons.
5.
5.1
COMBINING LAYERS
Overlaying Maps from Two Layers (MOSAIC)
MOSAIC combines two maps r e p r e s e n t i n g
t h e same a r e a on t h e ground but from d i f f e r e n t l a y e r s . The r e s u l t i s a polygon map
i n which each polygon r e p r e s e n t s t h e a r e a
i n common between a p a i r o f polygons, one
from each input map. (In mathematical
terms, t h i s overlay polygon i s t h e i n t e r s e c t i o n of t h e s e t s o f p o i n t s i n s i d e t h e
two input polygons.) The l a b e l of t h i s new
polygon i s a combination of t h e two cons t i t u e n t l a b e l s . A l l such p a i r s of overlapping input polygons a r e processed.
I f both i n p u t maps completely cover a
given a r e a of land with polygons, s o w i l l
t h e r e s u l t i n g map. But " s l i v e r s , " o r
polygons o f i n s i g n i f i c a n t s i z e a r e d i s regarded. By " i n s i g n i f i c a n t " we mean
those whose a r e a i s l e s s than 0.0125 square
inch o r whose area-to-perimeter r a t i o
i s l e s s than 1/100 (map c o o r d i n a t e s ) .
The composite map can be w r i t t e n on
t a p e f o r l a t e r use i f d e s i r e d . This i s
n o t necessary i f a l l you want i s a t a b l e of
acreages showing t h e t o t a l a r e a f o r each
l a b e l p a i r . This acreage t a b l e i s p r i n t e d
and a l s o punched. The punched cards a r e
f o r i n p u t t o TALLY.
MOSAIC w i l l run a batch of jobs f o r
a s e r i e s of c o n t r o l card s e t s following
t h e XQT c a r d . I f one of t h e two input
maps i s from a l a y e r named "TIMBER" we
assume i t s l a b e l s a r e f o r e s t - t y p e desc r i p t i o n s (See Appendix A) and we condense them i n t o major types (Appendix B)
b e f o r e processing.
Limitations:
1. Maximum number of x-y p o i n t s i n any
p a i r of input polygons and t h e i r i n t e r s e c t i o n ,
a l l combined: 3000
2. Maximum number of items i n both
input f i l e s p l u s output f i l e : 2000 ( e f f e c t i v e l y , t h i s means a l i m i t of about 500
polygons i n each input f i l e )
.
3. Maximum number of times a polygon
p a i r (one from each input f i l e ) can
c r o s s each o t h e r : 800
4. Timing: MOSAIC r e q u i r e s about 1
minute of Univac 1108 computer time when
each input f i l e has 50 polygons, and about
4 minutes f o r 400 polygons.
5.2
T a l l y adds up t h e card decks punched
by MgSAIC, which contain t h e acreages of
t h e overlay combination, and p r i n t s t h e
t o t a l acreages. The t o t a l s a r e a l s o
punched, i n t h e same format, s o t h e job can
be divided i n t o s u b t o t a l s t e p s i f d e s i r e d .
Input Cards:
1.
3. Header record ( f o r e s t , map, layer)
and i n p u t u n i t of t h e second input map.
4. Header record and output u n i t f o r
output f i l e . Include only those p o r t i o n s
of t h e header record t h a t a r e d i f f e r e n t
from t h e input f i l e s , namely, Map and Layer.
I f you do n o t wish t o w r i t e t h e output f i l e ,
a l l you punch i s "0UTPUT UNIT=N@NE$."
Example of Input Deck
RUN J@E,123456,4,50
CTL CLS=N
CTL MEM=60M, MAXCARDS=100, SYS=A
ASG A=1234
ASG B=5678
@W ASG 0 4 3 2 1
@ N CUR
IN X
TRI X
@ N XQT M@SAIC
INPUT UNIT=A; F@REST=ELDORAD@;
MAP=216; LAYER=MANAGEMENT$
INPUT UNIT=B; F@REST-ELDORADO;
MAP=16; LAYER=TIMBER$
OUTPUT UNIT=C; MAP=1016;
LAYER=@VERLAY$
@
@
@
@
@
Input Cards:
System cards
2. Header record ( f o r e s t , map, layer)
and input u n i t of t h e f i r s t input map.
Aggregating Overlay Acreages (TALLY)
1.
System cards.
2.
Forest name, followed by a d o l l a r
3.
Location, followed by a d o l l a r
This i s used f o r v i s u a l i d e n t i f i c a t i o n
sign.
sign.
only.
4. Master l a b e l l i s t f o r each l a y e r .
The l a y e r s come i n a l p h a b e t i c a l o r d e r . A
master l a b e l l i s t i s a complete l i s t of
a l l l a b e l s i n t h e l a y e r , separated by
commas and followed by a d o l l a r s i g n .
5 . Packets of cards punched by MOSAIC,
i n any o r d e r . A packet s t a r t s with t h e
f o r e s t name and ends with a d o l l a r s i g n .
Discard t h e job i . d . cards t h a t a r e u s u a l l y
found a t top and bottom o f t h e punched
deck. The f o r e s t name must match t h e name
i n Step 2, above. I f packets f o r t h e same
map p a i r appear more than once, TALLY uses
t h e f i r s t and ignores t h e o t h e r s .
Example of Input Deck:
@ RUN JACK,583301,1,30
@ CTL CLS=N, MAXCARDS=100
@ ASG X=5093
@N CUR
IN X
TRI X
@ XQT TALLY
MCCLOUD $
T41N $
a . PLOT TAPE = t a p e l a b e l
r e q u i r e d ) . This tape w i l l d r i v e t h e
plotter.
PERI~TER,RL,ST,VP,WS$PERIMETER,FB, WF2 (1) *P,WF3(2) ,WF3(3) ,P4(1) $
MCCLgUD $ T41N R2W $ 11 SEP 73 $11,
1$4,5$
b. MAGNIFICATION = f a c t o r .
This i s t h e amount of blow-up. O m i t t i n g i t i s equivalent t o a f a c t o r o f 1 . 0
PERI~TER,RL,ST,VP$PERI~TER,FB,WF~(~)*P, 6.1
WF3(3),P4(1) $44,129,147,69,18,25,
7(0), 73,6(0)$
MCCLOUD$ T41N R3W $ 12 SEP 73 $ 12,2$2,4$
PERIMETER,WS$PERIMETER,FB,WF3(2) ,P4 (1) $
7,l93(O) ,13,1,29 $
c . RECTANGLE = min x, max x,
min y , max y. These four numbers d e f i n e
a r e c t a n g l e i n map coordinates within which
t h e p l o t i s t o be confined. The numbers
a r e i n t e g e r s , i n u n i t s of 0.01 inch.
Omitting t h i s and ltITEMS't means you want
t h e e n t i r e map.
P l o t t i n g a Map (CHART)
d. ITEMS = l i s t of item numbers.
This i s another way t o s p e c i f y a subset
of t h e map t o be p l o t t e d .
CHART p l o t s t h e polygons on an automatic
d i g i t a l p l o t t e r , allowing a map t o be
checked v i s u a l l y . The program w r i t e s pen
movement i n s t r u c t i o n s on a t a p e , and t h e
t a p e runs t h e p l o t t e r o f f - l i n e . CHART
comes i n two d i f f e r e n t v e r s i o n s : one f o r
t h e Cal Comp 1136 p l o t t e r and t h e o t h e r
f o r t h e EAI 430. We w i l l d e s c r i b e t h e
Cal Comp version f i r s t and then t e l l how
t h e EAI version d i f f e r s from i t .
e.
Choose one. I t t e l l s t h e computer what
t o p l o t a s i d e n t i f i c a t i o n on each polygon.
Example of Input Deck:
SMITH,l23456,2,50
CLS=N
A=9701
@W ASG B=8728
k? ASG X=3703
@ N CUR
IN x
TRI X
@ N XQT CHART
FQREST=ELDQW~;
MAP=33; LAYER=TIMBER;
INPUT uNIT=A$
P L ~ TTAPE=B;
RECTANGLE=1500,2000,1700,2400; MAGNIFICATION=Z; PL9T LABELS $
@ RUN
@ CTL
@ ASG
The map i s drawn i n two colors--the
polygons i n one c o l o r and t h e i r l a b e l s
i n another. Also p l o t t e d a r e t h e c o n t r o l
p o i n t s , t h e x and y s c a l e s i n map coordinates,
and a t i t l e , which i s an e x t r a c t of t h e header
record.
Several options a r e a v a i l a b l e , such
a s p l o t t i n g only a p o r t i o n o f t h e map
defined by giving a l i s t of item numbers,
o r blowing up t h e p l o t by including a
magnification f a c t o r . And t o i d e n t i f y t h e
polygons t h e r e i s a choice of p l o t t i n g
l a b e l s , l a b e l numbers, o r item numbers.
@umbering i s t h e same a s on t h e p r i n t o u t . )
I f a Cal Comp p l o t t e r i s used, s e v e r a l
maps can be p l o t t e d i n a s i n g l e run by
r e p e a t i n g input card Sections 2 and 3
(below) f o r each map t o be p l o t t e d . The
same output t a p e must be used f o r a l l of
them.
P l o t t i n g on t h e E A l 430:
The ASG card f o r t h e p l o t t a p e must
have t h e H option and t h e r e i s a d i f f e r e n t
program t a p e . In our example, t h e ASG
cards f o r B and X become:
@WH ASG B=8728
k? ASG X=3952
Input Cards:
1.
System cards
2. Header record of t h e map t o be
p l o t t e d . The f o r e s t , map number, and l a y e r
a r e required. Also include t h e input u n i t .
3. Control c a r d s . A semicolon
s e p a r a t e s c o n t r o l c a r d s . Punch a d o l l a r
s i g n a t t h e end.
PLGT ITEM NUMBERS ( d e f a u l t )
PLOT LABELS
PLOT LABEL NUMBERS
6.2
S t o r i n g Several Maps on One Tape (FLEET)
The purpose of FLEET i s t o copy f i l e s
(maps) from s e v e r a l tapes onto one tape
f o r more compact s t o r a g e . I t can a l s o be
used j u s t t o copy a t a p e .
Copying i s c o n t r o l l e d by a sequence of
header records, each containing an I 0 u n i t
name, punched on i n p u t c a r d s . As with
t h e o t h e r programs, only t h e minimum ident i f i c a t i o n i s r e q u i r e d on t h e header
c a r d s , namely F o r e s t , Map Number, and
Layer. Any o t h e r information i s f o r
c o r r e c t i o n o r expansion of t h e e x i s t i n g
header r e c o r d on t a p e . With t a p e i n p u t ,
omission of F o r e s t , Map, and Layer i n p u t s
whatever f i l e i s next on t h e t a p e ; s p e c i f y i n g F o r e s t , Map, and Layer causes a search
through t h e t a p e u n t i l t h a t f i l e i s found.
t a p e 4000.
@ RUN JIM,583301,2,150
@ CTL CLS=N
@ ASG E=7000
@ ASG F=4000
ASG X=3951
@ N CUR
IN X
TRI X
@ N XQT GgSSIP
INPUT UNIT=E; FPREST=ELD~RAD~;
MAP=51; LAYER=TIMBER $
INPUT UNIT=F $
@
Example of Input Deck:
This deck copies two f i l e s from t a p e
1000 and one f i l e from t a p e 2000, w r i t i n g
them onto t a p e 3000.
RUN MAC,583301,3,50
CTL CLS=N
ASG A=1000
ASG B=2000
@W ASG C=3000
@ ASG X=3950
@ N CUR
IN X
TRI X
@ N XQT FLEET
INPUT UNIT=A; F ~ R E S T = E L D ~ RMAP=10;
AD~;
LAYER=TIMBER$
OUTPUT UNIT=C$
INPUT UNIT=A; FgREST-ELDPRADP; MAP=11;
LAYER=TIMBER$
~ U T P U TUNIT=C$
INPUT UNIT=B; FOREST=ELDORADg; MAP=55;
LAYER=TIMBER$
gUTPUT UNIT=C$
@
@
@
@
6.3
P r i n t i n g Diagnostic Summary of a Map
(GgSSIP)
GgSSIP p r i n t s a d e t a i l e d summary of
a l l polygons on a map so t h a t e d i t i n g can
be done and e r r o r s d e t e c t e d . The map t o
be p r i n t e d and t h e u n i t it i s on a r e
i d e n t i f i e d by a header r e c o r d punched on
c a r d s . Any number of maps can be p r i n t e d
by punching a s e r i e s of header r e c o r d s .
6.4
P r i n t i n g General Summary o f a Map (RUMgR)
The RUMPR program i s s i m i l a r t o GgSSIP,
but p r i n t s l e s s d e t a i l e d information about
t h e polygons. I t i s intended more f o r
t h e worker i n t h e f i e l d . In p r a c t i c a l
usage, such a s i n keypunching, it i s
i d e n t i c a l t o GOSSIP i n a l l r e s p e c t s except
f o r two c a r d s : t h e ASG X c a r d , which i s
@ ASG X=3955
and t h e XQT c a r d , which i s
@ N XQT RUMOR
6.5
Housekeeping Program (SIGNAL).
I f WRIS i s used f o r a l a r g e d a t a b a s e ,
( f o r example, 100 maps having 1000 d i s t i n c t
l a b e l s ) , keeping t r a c k of t h e maps a s they
a r e processed becomes i t s e l f a c o n s i d e r a b l e
d a t a handling problem. A record must be
kept of what s t a g e of processing each map
i s i n , what t a p e it i s on, and so f o r t h .
Each o f t h e thousands of polygons has a
l a b e l , and it must be checked a g a i n s t a
master l i s t of v a l i d l a b e l s .
When i n p u t i s from t a p e some s h o r t c u t s a r e p o s s i b l e . A s with t h e o t h e r
programs, t h e f i l e s p e c i f i e d on c a r d s i s
searched f o r on t h e t a p e . Therefore, any
i n t e r v e n i n g unwanted f i l e s can be d i s regarded. But i f more than one f i l e i s
wanted from a t a p e each must be processed
i n o r d e r because a t a p e i s n o t backed up.
Another s h o r t c u t allows p r i n t i n g all f i l e s
on a t a p e by punching j u s t "INPUT UNIT =
something $ ."
SIGNAL i s designed t o a s s i s t i n t h e s e
housekeeping chores. I t enables t h e u s e r t o
e s t a b l i s h and maintain a f i l e of information
about h i s maps on a drum o r d i s k u n i t . A
" f i l e " c o n s i s t s of a c o l l e c t i o n of "records,"
and each record c o n t a i n s a "keyw by which
it i s i d e n t i f i e d . Two d i f f e r e n t kinds of
f i l e s a r e p o s s i b l e , a "catalogue f i l e v
o r a "master l a b e l f i l e . " In a catalogue
f i l e t h e r e i s one record f o r each map,
c o n s i s t i n g of a p o r t i o n of i t s header r e c o r d
p l u s a few o t h e r p i e c e s o f information.
A l l e n t r i e s i n a catalogue f i l e p e r t a i n t o
one f o r e s t . In a master l a b e l f i l e t h e r e
i s one record f o r each l a y e r i n a f o r e s t , and
s e v e r a l f o r e s t s may be intermingled i n one
f i l e , i f desired.
Example. This job p r i n t s out one
f i l e from t a p e 7000 and a l l f i l e s on
Catalogue f i l e : The permissable items
i n a record a r e : MAP, LAYER, L ~ C A T I ~DA
, TE
OF ORIGIN, GEOGRAPHIC C0NTR0L POINTS,
MAP CONTROL POINTS, PROJECTION, ZONE,
ENVELOPE, P~LYG~N
REEL, BACKUP REEL, GRID
REEL. Most of t h e s e can be copied d i r e c t l y
from a header r e c o r d p r i n t o u t , u s i n g t h e
same format. A s f o r t h e o t h e r s , an example
is t h e best description:
DATE Q ~ FORIGIN = 06 JAN 74;
PROJECTION = STATE PLANE;
ZdNE = 13; POLYGON REEL = 9117,4;
BACKUP REEL = 5093,9; GRID REEL=7195,2$
I n t h e l a s t t h r e e i t e m s , you have t h e t a p e
r e e l number followed by t h e p o s i t i o n on t h e
r e e l (assuming more t h a n onemap p e r r e e l ) .
The r e t r i e v a l key f o r a r e c o r d i n t h i s kind
o f f i l e i s t h e map number. For keypunching
r u l e s f o r header r e c o r d s , s e e S e c t i o n 7 . 3 . 2 .
START FILE. ( f i l e name)
FILE. ( f i l e name)
Use one of t h e s e c a r d s t o name t h e
f i l e t h a t subsequent c o n t r o l c a r d s w i l l
o p e r a t e on. This f i l e name remains i n
e f f e c t u n t i l a n o t h e r START FILE o r FILE
c a r d i s encountered. The f i l e name
must be a l r e a d y known t o t h e o p e r a t i n g
system. FILE assumes t h a t a previous
SIGNAL run h a s s t o r e d something i n t o t h e
f i l e and t h a t you a r e now updating it.
But t h e f i r s t time, use START FILE t o
i n i t i a l i z e . The START FILE c a r d r e q u i r e s
an a d d i t i o n a l c o n t r o l c a r d c o n t a i n i n g
two items. For a c a t a l o g u e f i l e :
ID = f o r e s t ; TYPE = CATALYGUE$
For a master l a b e l f i l e :
Master l a b e l f i l e : A r e c o r d i s a
l i s t of a l l p e r m i s s i b l e l a b e l s f o r one
f o r e s t / l a y e r combination. The key i s a
s t r i n g o f c h a r a c t e r s composed o f t h e f o r e s t
name, a s l a s h , and t h e l a y e r name. Do
n o t have b l a n k s b e f o r e o r a f t e r t h e s l a s h .
When e n t e r i n g a l i s t o f l a b e l s , punch them
on c a r d s i n t h e s t a n d a r d format f o r a
l a b e l l i s t (See S e c t i o n 4.2)
Using SIGNAL: Acquire a Fastrand f i l e
u s i n g any name you want. Also choose a f i l e
i d e n t i f i c a t i o n , such a s t h e f o r e s t name f o r
a c a t a l o g u e f i l e . Twenty f o u r c h a r a c t e r s
a r e t h e maximum. Operate on a f i l e by a
s e r i e s o f SIGNAL c o n t r o l c a r d s . The f i r s t
c a r d i d e n t i f i e s a f i l e by g i v i n g i t s Fast r a n d name. A l l f u r t h e r c a r d s o p e r a t e on
t h i s f i l e u n t i l a n o t h e r such s e r i e s i s
s t a r t e d , i f any. Some c o n t r o l c a r d s a l s o
r e f e r t o a t a p e , u s i n g i t s e x t e r n a l name
(A,B,C,etc.) a s given on t h e ASG c a r d .
Some o t h e r c o n t r o l c a r d s r e q u i r e a key, which
i s t h e map number, i n t h e c a s e o f a c a t a l o g u e
f i l e o r the forest/layer, i f it is a'master
label f i l e . In a l l cases, t h i s variable
p o r t i o n o f a c o n t r o l c a r d ( f i l e name, t a p e
name, o r key) i s e n c l o s e d i n p a r e n t h e s e s .
I n some c a s e s , though, t h i s i s a b s e n t and
a l l you have i s t h e c o n t r o l word i t s e l f ,
which i s always ended with a p e r i o d . Thus
a c o n t r o l c a r d c o n s i s t s o f a c o n t r o l word
o r p h r a s e s p e c i f y i n g an a c t i o n t o be done
on t h e c u r r e n t f i l e , and u s u a l l y t h e name o f
a f i l e , t a p e , o r key. For most c o n t r o l
c a r d s , t h i s i s enough. But f o r a few, some
d a t a o r f u r t h e r c o n t r o l information must
follow.
Control Cards: Here i s a l i s t o f a l l
p o s s i b l e c o n t r o l c a r d s and an e x p l a n a t i o n
o f what t h e y do. Lower case i n d i c a t e s a
symbol generated by t h e u s e r .
ID = anything; TYPE = MASTER LABEL
FILE$
On l a t e r r u n s , when t h e FILE c a r d i s used,
t h e above c o n t r o l c a r d i s not used
because t h e information i s i n t h e f i l e .
CHECKPOINT 0UT. ( t a p e name)
Saves t h e f i l e on t a p e . A t a l a t e r
d a t e you can r e s t o r e it by a CHECKPOINT
I N . This f e a t u r e i s designed f o r f i l e
s e c u r i t y o r f o r simply s a v i n g r e n t a l
on f i l e s . The t a p e name i s t h e same a s
on t h e ASG c a r d .
CHECKPOINT IN. ( t a p e name)
This i s t h e r e v e r s e o f CHECKPOINT
OUT. Precede t h i s card by a START FILE
card.
PRINT FILE.
Prints t h e f i l e contents i n f u l l ,
i n c l u d i n g t h e index.
PACK FILE
When t h e DELETE ITEM c o n t r o l c a r d i s
used a "gap" i s c r e a t e d i n t h e f i l e . I f
a number o f such gaps a r e p r e s e n t i n a
f i l e it may be economical t o squeeze them
o u t with a PACK FILE c a r d . However,
a f i l e i s a u t o m a t i c a l l y packed whenever
i t i s copied onto any o t h e r medium ( i . . e . ,
with CHECKPOINT OUT o r COPY FILE).
CgPY FILE. ( f i l e name)
This produces a copy o f t h e f i l e which
i s c u r r e n t ( t h e one named on t h e most r e c e n t
FILE o r START FILE c a r d i n t h e r u n ) by
w r i t i n g it o n t o a n o t h e r f i l e , t h e one
given by " f i l e name" on t h e c o n t r o l c a r d .
l a b e l s , s t o r e s a l a b e l l i s t i n it, s o r t s
i t , and p r i n t s it.
@ RUN FRED,583301,1,20
@ CTL CLS=N
@ ASG X=5103
DELETE ITEM. ( k e y ) .
D e l e t e s an i t e m from t h e f i l e , t h e
i t e m h a v i n g t h e key g i v e n .
@ N CUR
IN X
TRI X
@ N XQT FMAPS
AQR BIG/F@JT,l
@ N XQT SIGNAL
START FILE. (BIG/FO@T)
ID=SIERRA; TYPE=MASTER LABEL FILE $
ADD ITEM. (SIERRAITIMBER)
PP,D,WF,W,SP$
SgRT ITEM. (SIERRAITIMBER)
PRINT ITEM. (SIERRAITIMBER)
ADD ITEM. ( k e y ) .
T h i s adds an e n t i r e l y new i t e m t o t h e
f i l e o r augments an e x i s t i n g i t e m , dependi n g on whether t h e given key e x i s t s i n t h e
f i l e . The new m a t e r i a l must immediately
f o l l o w t h e ADD ITEM c a r d . When a c a t a logue f i l e i t e m i s augmented, t h e new
m a t e r i a l i s f a v o r e d whenever t h e r e a r e
c o n f l i c t s . When a m a s t e r l a b e l f i l e i s
augmented, new l a b e l s i n t h e punched l i s t
a r e added t o t h e f i l e and d u p l i c a t e s
a r e ignored.
PRINT ITEM. (key)
P r i n t s t h e given item i n f u l l .
PUNCH ITEM. (key)
Punches t h e g i v e n i t e m .
CHECK LABELS. (key)
Used t o check a g i v e n l i s t o f l a b e l s
a g a i n s t a m a s t e r l i s t ( w i t h t h e key g i v e n )
t h a t i s i n t h e f i l e . The l i s t t o b e
checked must immediately f o l l o w t h e CHECK
LABELS c a r d . And it must, a s u s u a l , end
w i t h a d o l l a r s i g n . Any l a b e l i n t h i s l i s t
t h a t does n o t match a l a b e l i n t h e f i l e i s
f l a g g e d i n t h e p r i n t o u t , on t h e assumption
t h a t it i s e r r o n e o u s . No change i s made
i n the f i l e .
DELETE LABELS. (key)
With t h i s c o n t r o l c a r d you can d e l e t e
any o f t h e l a b e l s i n a m a s t e r l a b e l l i s t
( t h e g i v e n key t e l l s which l i s t ) . Punch
t h e l a b e l s t o be d e l e t e d i n l a b e l l i s t
format and p u t them a f t e r t h e DELETE LABELS
card.
S ~ R TLABELS. (key)
S o r t s a m a s t e r l a b e l l i s t ( d e n o t e d by
key) i n t o a l p h a b e t i c a l o r d e r and w r i t e s it
back i n t o t h e f i l e , r e p l a c i n g t h e o l d
list.
Deck s e t u p
T h i s job e s t a b l i s h e s a f i l e f o r m a s t e r
7.
PROGRAM NOTES
Miscellaneous information t h a t a p p l i e s
t o more t h a n one o f t h e programs i s l o c a t e d
i n t h i s section.
7.1
Computer System
The computer we u s e i s a Univac 1108
computer (Exec 2 o p e r a t i n g system). The
s c a n n e r i s a PDS m i c r o d e n s i t o m e t e r , and
t h e p l o t t e r can be e i t h e r a Cal Comp 1136
o r an E A I 430. The programs a r e w r i t t e n
i n F o r t r a n and a r e v e r y c l o s e t o t h e ANSI
standard.
7.2 F i l e s
The d a t a p r o c e s s e d by t h e WRIS programs
i s k e p t permanently on magnetic t a p e s o r on
F a s t r a n d drums. These two media a r e i n t e r changeable t o t h e programs. For s i m p l i c i t y
and t o c o r r e s p o n d t o p r e s e n t p r a c t i c e , we
u s u a l l y r e f e r t o a f i l e a s b e i n g on t a p e .
A "file" i n t h i s context i s e s s e n t i a l l y
one map. However, s e v e r a l f i l e s can b e
s t o r e d on one t a p e , b u t o n l y one on F a s t r a n d .
The t a u e o r F a s t r a n d U n i t o n t o which a
f i l e i s t o be w r i t t e n h a s a name. I t i s
a l e t t e r (A, B , C , . . . ) f o r t a p e s and two
1-6 c h a r a c t e r names s e p a r a t e d by a s l a s h
f o r F a s t r a n d . Each program r e q u i r e s t h i s
u n i t name t o be punched on c a r d s , u s u a l l y
i n c l u d e d i n t h e h e a d e r r e c o r d . Sometimes
you may want t o s p e c i f y no u n i t , p e r h a p s
t o i n d i c a t e t h a t no o u t p u t f i l e i s t o b e
w r i t t e n . I n t h i s c a s e use t h e word "NONE"
a s u n i t name. Some examples s h o u l d i l l u s t r a t e t h e s e r u l e s . "INPUT UNIT=AII i n c l u d e d
i n t h e h e a d e r r e c o r d s p e c i f y i n g an i n p u t
f i l e s a y s it i s on t h e t a p e u n i t a s s i g n e d
t o "A" on t h e ASK c a r d . I f it were an
o u t p u t f i l e you would punch "0UTPUT UNIT=A."
O r , "OUTPUT UNIT=N@NE7'i s p o s s i b l e .
F i l e s have a MODE a t t r i b u t e appearing
i n header r e c o r d s . I t i s a u t o m a t i c a l l y
g e n e r a t e d by t h e computer. MODE=1 i n d i c a t e s
a map i n scanner ( g r i d ) form. MODE=?
i n d i c a t e s a map c o n s i s t i n g o f a c o l l e c t i o n
o f non-overlapping polygons.
7.3
Card Formats
C e r t a i n forms r e c u r i n t h e card i n p u t
t o t h e v a r i o u s WRIS programs. Header r e c o r d s
and polygon l a b e l s a r e examples p r e v i o u s l y
d e s c r i b e d . Others a r e d e s c r i b e d i n t h e
f o l l o w i n g s e c t i o n s . Card i n p u t t o a program
i s o f two k i n d s : system c a r d s and program
input cards.
s p e l l i n g recognized by WRIS (and only one
blank between words p l e a s e ) .
FOREST: The name o f t h e f o r e s t . ( c h a r a c t e r s )
MAP: Map number. ( i n t e g e r )
LAYER: Layer name. ( c h a r a c t e r s )
LflCATIflN: Location. ( c h a r a c t e r s )
SCALE: Representative f r a c t i o n denominator,
defined a s t h e number o f i n c h e s
on t h e ground r e p r e s e n t e d by one
inch on t h e map. A 4-inch-per-mile
map h a s , f o r example, a r e p r e s e n t a t i v e f r a c t i o n o f 1/15840. ( i n t e g e r )
GEOGRAPHIC C^SNTR^SLP ~ I N T S : L a t i t u d e and
7.3.1
System Cards
Rules f o r t h e s e c a r d s a r e determined
by t h e computer i n s t a l l a t i o n and a r e t h u s
o u t o f t h e programmer's c o n t r o l . These few
c a r d s a r e a t t h e beginning o f a job deck.
On t h e Univac 1108, Exec 2, an "an c h a r a c t e r
i n column 1 i d e n t i f i e s most of them. They
c o n s i s t o f a l l c a r d s up t o and i n c l u d i n g
t h e c a r d with "XQT" on i t .
In each program w r i t e u p , an example
shows what should be punched. Observe t h e
placement o f spaces c a r e f u l l y . Most of
t h e c a r d s a r e t h e same f o r each run. Mainly
what v a r i e s a r e ( a ) t h e time and page
e s t i m a t e s on t h e RUN c a r d , and (b) t h e
u n i t assignments and t a p e r e e l numbers on
t h e ASG c a r d s , o t h e r t h a n t h e one naming
t h e program f i l e .
l o n g i t u d e o f each c o n t r o l p o i n t ,
l a t i t u d e preceding l o n g i t u d e f o r
each p o i n t . Use d e g r e e s , minutes
and seconds, s e p a r a t e d by c o l o n s .
Do n o t omit z e r o e s . I n t h e seconds
p o s i t i o n , you can r e c o r d t o t h e
n e a r e s t hundredth second u s i n g a
decimal p o i n t . An accuracy o f a t
l e a s t 0.5 second i s e s s e n t i a l . The
maximum meaningful accuracy i s
0.01 second.
MAP CgNTRgL POINTS: x and y c o o r d i n a t e s
o f t h e c o n t r o l p o i n t s , i n u n i t s of
0.01 i n c h on t h e map. ( i n t e g e r s )
GRID CONTROL POINTS: Row and column
coordinates of the control points.
(integers)
SCAN ROWS: Number o f rows scanned. ( i n t e g e r )
7.3.2
Header Records
Items: A header r e c o r d i s a small
c o l l e c t i o n o f information about one map
f i l e . This information p e r t a i n s t o t h e
e n t i r e map, r a t h e r than t o s p e c i f i c polygons.
P a r t o f it i d e n t i f i e s t h e map. Most programs
i n WRIS r e q u i r e t h e s e i d e n t i f i e r s i n o r d e r
t o use an e x i s t i n g f i l e . The o t h e r s a r e
g e n e r a t e d and maintained i n t e r n a l l y . Each
time a f i l e i s processed, i t s c u r r e n t header
r e c o r d i s p r i n t e d i n f u l l . The u s e r can
o v e r r i d e an i n t e r n a l l y generated v a l u e , b u t
n o t t h e t h r e e b a s i c identifiers--FOREST, MAP,
LAYER. To o v e r r i d e one o f t h e o t h e r s , punch
t h e d e s i r e d value along with t h e r e q u i r e d
i d e n t i f i e r s . The header r e c o r d i s s t o r e d
on t a p e along with t h e f i l e a t a l l times.
Here i s a complete l i s t o f p o s s i b l e
items i n a header r e c o r d . C a p i t a l l e t t e r s
g i v e t h e " o f f i c i a l " names, i n t h e only
SCAN C0LUMNS: Number o f columns scanned.
(integer)
MODE: I n d i c a t e s a scan g r i d (MODE=l)
o r a polygon map (MODE=2). ( i n t e g e r )
ENVELOPE
: Overall envelope o f a l l polygons
on t h e map, i . e . , t h e s m a l l e s t x,
s m a l l e s t y, l a r g e s t x, and l a r g e s t y .
Same u n i t s a s map c o n t r o l p o i n t s .
(integers).
DATE WRITTEN: The d a t e t h e f i l e was w r i t t e n .
(characters)
TIME WRITTEN: The time t h e f i l e was w r i t t e n .
(characters)
REEL NUMBER: T e l l s which t a p e r e e l t h e f i l e
i s on. ( c h a r a c t e r s )
P~SITIONON REEL: I n d i c a t e s one o f perhaps
s e v e r a l f i l e s on t h e r e e l . ( i n t e g e r )
C o n t r o l p o i n t s : Township c o r n e r s
a r e usually selected a s control points,
a l t h o u g h any o t h e r s h a r p l y d e f i n e d l o c a t i o n s
w i l l do. These a r e r e c o r d e d i n a clockwise manner s t a r t i n g i n t h e lower l e f t
c o r n e r . Four c o m e r s a r e t h e most d e s i r a b l e
b u t t h r e e ( o r even two) may be s u f f i c i e n t .
The c o r n e r must be a r e c o g n i z a b l e p o i n t on
o r w i t h i n t h e map boundary, n o t some
a r b i t r a r y p o i n t on t h e map s h e e t . Control
p o i n t s must be i d e n t i c a l f o r a l l l a y e r s of a
township a s w e l l f o r a l l systems o f measurement; i n o t h e r words, t h e y r e p r e s e n t t h e
same ground l o c a t i o n s on a l l l a y e r s , and
a r e r e c o r d e d i n t h e same o r d e r .
Format o f a h e a d e r r e c o r d : A f r e e - f i e l d
format i s used. Items do n o t have t o appear
i n s p e c i f i e d c a r d columns. The computer
knows what each i t e m i s because it i s
l a b e l e d ; f o r example, 11MAP=51ttmeans 51 i s
t h e map number. The e q u a l s s i g n a t t a c h e s
t h e name "MAP" t o t h e v a l u e 51. The computer
program h a s a l i s t o f t h e s e names; t h e r e f o r e , names must be s p e l l e d c o r r e c t l y .
Sometimes a name r e q u i r e s more t h a n one
number a s i t s v a l u e . Punch commas between
t h e numbers t o s e p a r a t e them. Sometimes a
v a l u e i s n o t a number b u t a s t r i n g of
c h a r a c t e r s . I n "F0REST=ELD0RAD0" t h e
v a l u e i s "ELD0RAD0 . I 1
Thus. we have t h e b a s i c b u i l d i n g
b l o c k of a h e a d e r r e c o r d , namely an
o f t h e form name=value, where t h e name on
t h e l e f t i s from a s t a n d a r d l i s t o f names
and t h e v a l u e on t h e r i g h t can be a number,
s e v e r a l numbers s e p a r a t e d by commas, o r
a s t r i n g of characters. It is a l l r i g h t t o
p u t i n e x t r a s p a c e s (blank columns) j u s t
s o t h e y a r e n ' t i n t h e middle o f a number
o r word. Thus, "MAP = 51" and "MAP=51tt
a r e b o t h p e r m i s s i b l e . But b l a n k s i n a
s t r i n g value
s i g n i f i c a n t . l'ELDORADOqt
i s n o t t h e same a s "EL DORADO."
I n key
punching, when you r e a c h column 80,
c o n t i n u e d i r e c t l y t o column 1 o f t h e n e x t
c a r d , a s i f you had one long continuous
card.
To form a complete h e a d e r r e c o r d ,
punch one i t e m a f t e r a n o t h e r , s e p a r a t e d
by semicolons, and punch a d o l l a r s i g n a t
t h e end t o s i g n a l t h e end o f t h e h e a d e r
r e c o r d . Again, b l a n k s may be f r e e l y
i n s e r t e d b e f o r e and a f t e r t h e s e p u n c t u a t i o n
c h a r a c t e r s . Here i s an example o f a complete
header record:
F@REST=ELD@RAD@;
MAP=51;
L@CATI@N=T14NRISE; LAYER=TIMBER$
7.3.3
Integer Lists
Many programs w i l l r e q u i r e a l i s t
o f i n t e g e r s (whole numbers without decimal
p o i n t s ) a s i n p u t from c a r d s a t some p o i n t ,
and some header r e c o r d items a r e i n t h i s
form. Rather t h a n r e q u i r e a f i x e d f i e l d
s i z e and c a r d l o c a t i o n f o r each number, we
use a f r e e format. The i n t e g e r s a r e
punched i n a s many columns a s a r e needed.
Successive i n t e g e r s a r e s e p a r a t e d by
commas. The l i s t i s t e r m i n a t e d by e i t h e r a
semi-colon o r a d o l l a r s i g n , depending on
c o n t e x t . When you r e a c h column 80,
c o n t i n u e on t o t h e n e x t c a r d a s i f it were
one long c a r d . Blanks (skipped columns)
can be i n s e r t e d anywhere except between
t h e d i g i t s o f a number.
Three a b b r e v i a t i o n s a r e p o s s i b l e :
(a)
A sequence o f i n c r e a s i n g o r d e c r e a s i n g
numbers such a s "6, 7, 8 , 9" can be s h o r (b) A r e p e t i t i o n o f t h e
t e n e d t o "6A9".
same number, such a s "4,4,4,4,4" can be
a b b r e v i a t e d "5 (4) ". A combination i s
p o s s i b l e , such a s "2(5,7A9)", which i s
t h e same a s "5,7,8,9,5,7,8,9".
In o t h e r
words, whatever i s i n s i d e t h e p a r e n t h e s e s
i s r e p e a t e d a s many t i m e s a s t h e number
i n f r o n t i n d i c a t e s . (c) For e a s e i n
r e c o r d i n g sequences of c o o r d i n a t e p a i r s , we
a l l o w t h e s p e c i a l forms [x.aAb] and [ a ~ b , y ] .
The l e t t e r s s t a n d f o r i n t e g e r s . For example,
[31,617A653IT1 i s t h e same a s "31,617,31,618,
.. ,31,653".
.
7 . 3 . 4 Comments
Comments can be i n c l u d e d anywhere i n t h e
program i n p u t c a r d s by e n c l o s i n g t h e comment
m a t e r i a l i n quote marks. A comment i s a n o t e
t o y o u r s e l f t h a t you do n o t want t h e computer
t o r e a d . Whenever t h e computer comes t o a q u o t e
mark i n t h e i n p u t s t r e a m , it s c a n s forward
u n t i l t h e matching quote mark i s found and
resumes p r o c e s s i n g a t t h a t p o i n t .
7.4
Printout
Some items show up on n e a r l y e v e r y
p r i n t o u t and may need some e x p l a n a t i o n .
F i r s t , e v e r y c a r d i n t h e i n p u t deck i s
p r i n t e d . Those a f t e r t h e XQT c a r d a r e
T h i s h e l p s you
l a b e l l e d "INPUT CARD:"
check your work i n c a s e an e r r o r develops.
Every page p r i n t e d by t h e program i t s e l f
( i . e . , a f t e r XQT) i s headed by t h e program
name, t h e d a t e , and a page number. The
d a t e and time o f day i s p r i n t e d a t
beginning and end o f t h e program p r i n t o u t .
The message "END OF R U N W i s p r i n t e d
a t t h e end. Most o f t h e i n p u t i n f o r m a t i o n
i s p r i n t e d back a t you i n a somewhat
d i f f e r e n t form t h a n what was punched
on t h e c a r d s , showing you what t h e
computer t h i n k s it i s . T h i s h e l p s you
s p o t e r r o r s . Whenever t h e r e i s an
o u t p u t f i l e , t h e message "OUTPUT FILE
WRITTEN" w i l l be p r i n t e d a f t e r t h e
w r i t i n g i s complete. You need t h i s
message t o be s u r e t h e f i l e can be
read a s i n p u t i n a f u t u r e run.
8.
l a b e l f o l l o w s , i n s e r t a comma. I f
n o t , use a d o l l a r s i g n t o s i g n a l
t h e end o f t h e l i s t o f l a b e l s .
Keypunch
Symbol
APPENDIXES
Region 5 , U.S. F o r e s t
S e r v i c e , S e c t i o n 2441
(2441.1 - 2441.5)
F o r e s t Types and
C l a s s i f i c a t i o n System
Encoding Rules:
1.
Species symbols ( c a p i t a l l e t t e r s )
a r e copied unchanged. Species
symbols which a r e lower case
l e t t e r s a r e discussed l a t e r , i n
item 4.
2.
u , s , and o become c a p i t a l s ;
i . e . , U , S, and 8.
3.
Numerals do n o t change.
4.
The a s t e r i s k (*) marks t h e
beginning o f lower c a s e s p e c i e s
l e t t e r s . I f t h e r e i s no lower
c a s e t h e n t h e r e i s no a s t e r i s k .
5.
The dash (-) s e p a r a t e s two
s p e c i e s . I t i s n o t needed
between a s p e c i e s i n upper case
and one i n lower c a s e because t h e
a s t e r i s k s e r v e s t h e same purpose
i n t h i s instance.
6.
(1) r e p l a c e s (3) r e p l a c e s
7.
Each l a b e l i s followed by i t s x
and y c o o r d i n a t e s ( i n hundredths
o f an i n c h , a s i n t e g e r s ) by u s i n g
one o r more blanks a s s e p a r a t o r s
between them. Then, i f a n o t h e r
, (2) r e p l a c e s
,
Replaces t h e " f r a c t i o n
bar"
Precedes lower case
letters
Separates species
Replaces 5
The
numeral i s t h e number
o f dashes.
Replaces colon ( : )
Replaces U - B r
Replaces W (water)
Replaces B r (brush)
I n d i c a t e s N@ LABEL
Experimental F o r e s t
P r i v a t e land i n s i d e N.F.
Any land ownership
o u t s i d e N.F.
Reserved land (wilderness)
.
A--Rules f o r T r a n s c r i b i n g F o r e s t
Type D e s c r i p t i o n s t o Computerr e a d a b l e Format
Reference:
Function
=
,
RL
Examples :
Map Symbol
Characters recorded on
d a t a form f o r keypunching
SPwfrf5=
WFrf 3~
SP*WF-RF5 (2) / W F * R F
(3)
~
SPwfrf5 ( s )
WFrf 3 (0)
SP*WF-RF5 (S) /WF*RF3 (0)
PL:Pl (u)
PL+P1(U)
B--Major F o r e s t Type Assignments
MAJOR
FOREST
TYPE
VEGETATIVE TYPE
A
A
------
---------------
MAJOR
FOREST
TYPE
D.5A
D.58
D.6
KP.6
MC. 1
VEGETATIVE TYPE
MAJOR
FOREST
TYPE
-----MC. 5 B
P. 4B
P.5A
P.56
PP. 1
PP.2
PP. 3A
MAJOR
FOREST
TYPE
------
RF. 2
RF. 3 A
RF. 3 B
RF. 4A
RF . 4 B
MAJOR
FOREST
TYPE
RF.
5B
RF.6
SA. 1
SA. 2
SA. 3 A
SA. 3 B
SA.4B
SA. 5 A
SA. 5 B
SA. 6
C--Scanning Map N e g a t i v e s on t h e PDS-1010
Microdensitometer
Turn on t h e s c a n n e r power, lamp,
v o l t a g e , x-motor, and y-motor. Make s u r e
t h e Manual Automatic s w i t c h i s i n t h e
Manual mode b e f o r e t u r n i n g on t h e d a t a
a c q u i s i t i o n s y s t e m (DAS) power and t h e n
t h e t a p e u n i t power. Allow a 30-minute
warm-up p e r i o d . During t h i s w a i t c l e a n
t h e s c a n n e r and t a p e u n i t .
P o s i t i o n t h e s c a n n e r upper and lower
o p t i c s t o t h e a p e r t u r e ( s l i t ) and magnificat i o n s e l e c t e d f o r t h e m a t e r i a l t o be
s c a n n e d . Turn s c a n n e r x and y s t e p p i n g
motors t o p r o p e r gearbox p o s i t i o n s f o r
d e s i r e d pm/step.
(Do n o t use 2 . 4 ) .
S e t t h e thumbwheel s w i t c h e s f o r t h e
DAS program l o c a t i o n a t 400 and t h e r e c o r d
l e n g t h a t 999. The x-, y-, and manual-datai n c l u d e s w i t c h e s must be o f f . S e t t h e x and
y um/step thumbwheel s w i t c h e s t o same
v a l u e s a s t h e s t e p p i n g motor g e a r b o x e s .
S e t t h e x and y s t e p s / r e a d i n g t o o b t a i n
t h e s e l e c t e d s p a c i n g of d e n s i t y r e a d i n g s .
P r e s e t / R e s e t t o g g l e s w i t c h e s must be a t
R e s e t (down) f o r b o t h x and y . S e t s t a g e
t r a v e l d i r e c t i o n s , using right-arrow f o r
x and up jrrow f o r y. S e t t h e 1 2 t h ( r i g h t
hand) thumbwheel manual d a t a s w i t c h t o
one, t o c o r r e s p o n d w i t h t h e y s t a g e
d i r e c t i o n . The f i r s t t e n manual d a t a
s w i t c h e s c o n t a i n t h e map number, r i g h t j u s t i f i e d . The 1 1 t h manual d a t a s w i t c h
i s n o t used f o r t h e hlRIS programs and i s
b e s t l e f t a t z e r o . The t a p e d i s a b l e
switch should be o f f unless a t e s t i s t o
be made w i t h o u t r e c o r d i n g .
When u n i t s have warmed up, mount and
l o a d a t a p e . With t h e C l e a r / P r e s l i t knob
on C l e a r s o t h a t t h e e n t i r e viewing s c r e e n
i s i l l u m i n a t e d , f o c u s t h e u p p e r o p t i c s on
an empty s t a g e . Then t u r n t h e knob
( c o u n t e r - c l o c k w i s e always) t o P r e s l i t and
f o c u s t h e lower o p t i c s , making s u r e t h e
crosshairs are centered i n t h e illuminated
c i r c l e . C a l i b r a t e t h e d e n s i t o m e t e r on
P r e s l i t a s d i r e c t e d on p a g e s 68-70 o f
t h e PDS M i c r o d e n s i t o m e t e r T e c h n i c a l Manual.
P l a c e t h e n e g a t i v e on t h e c l e a n
s t a g e , w i t h t h e n o r t h edge away from t h e
o p e r a t o r and west edge toward h i s r i g h t .
Tape f i l m a t c o r n e r s , making s u r e it i s
f l a t and t i g h t . Refocus u p p e r and lower
o p t i c s on a l i n e i n t h e a r e a t o b e s c a n n e d .
Scan t h e west edge t o f i n d z e r o - x , k e e p i n g
t h e map edge t o t h e l e f t o f t h e c r o s s h a i r s i n t h e viewing screen. Press t h e
" E n t e r x" b u t t o n s o t h a t z e r o e s show
i n t h e x - p o s i t i o n d i s p l a y . Scan t h e n o r t h
edge t o f i n d zero-y, keeping t h e map edge
above t h e c r o s s h a i r s i n t h e viewing s c r e e n .
P r e s s t h e "Enter y" button s o zeroes show
i n t h e y - p o s i t i o n d i s p l a y . To minimize
t h e scan a r e a (thus scan time and p r o c e s s i n g
t i m e a l s o ) , t h e s t a g e may be r o t a t e d by
hand t o l i n e up t h e map edges with t h e x
and y zero-axes. Scan t h e e a s t edge t o
f i n d t h e maximum x value i n pm, keeping
map edge t o t h e r i g h t of t h e c r o s s h a i r s .
E n t e r t h e maximum x value i n t h e "Final
x" thumbwheel switches. I f t h i s number
i s n o t a m u l t i p l e of t h e pmlreading f o r
x , each scan l i n e w i l l be ended a t t h e
n e x t such m u l t i p l e . Scan t h e s o u t h edge
t o f i n d t h e maximum y value. Divide t h i s
v a l u e by t h e pm/reading f o r y. I f t h e
number d i v i d e s evenly, add one t o t h e
q u o t i e n t . Otherwise, add two t o t h e
q u o t i e n t . Enter t h e r e s u l t i n g v a l u e i n
t h e "Number of Scans" thumbwheel s w i t c h e s .
Drive t h e s t a g e back t o t h e o r i g i n
Press t h e DAS Reset
b u t t o n , l o c a t e d below t h e "Final x"
s w i t c h e s s o t h e value of t h e f u n c t i o n c o u n t e r
shows zero. This w i l l a l s o i n i t i a l i z e t h e
d a t a a c q u i s i t i o n system. The Program
Address l i g h t s must show 4008 and t h e Cont e n t s l i g h t s must show 2400. Turn t h e
C l e a r / P r e s l i t knob t o P r e s l i t . S e l e c t
Auto on t h e Manual/Auto b u t t o n . P r e s s
t h e Program I n i t i a t e b u t t o n t o s t a r t
scanner.
(NW c o r n e r of map).
When scan i s f i n i s h e d , f i r s t s e l e c t
Manual on t h e ManualIAuto b u t t o n and C l e a r
on t h e C l e a r / P r e s l i t knob. Check f o r
r e a s o n a b l e p o s i t i o n of NW map c o r n e r i n
r e l a t i o n t o c r o s s h a i r s on viewer. Check
f o r z e r o v a l u e s i n p r e s e n t x and y p o s i t i o n
d i s p l a y s and f o r t h e c o r r e c t number o f
scans i n the function counter display.
I f t h i s was t h e l a s t scan f o r t h i s t a p e ,
add two manual f i l e marks b e f o r e rewinding.
Otherwise, do n o t add any f i l e marks.
Change t h e n e g a t i v e and proceed w i t h t h e
n e x t scan job.