Wildland resource information system: user's guide

8/8/2019 Wildland resource information system: user's guide

1/40

Wildland Resource Information System:user's guide

Robert M. Russell David A. Sharpnack ElliotL. Amid

PACIFIC

SOUTHWESTForest and RangeExperiment Station

O R E S T S E RV I C ES . D E PA RT M E N T OF A G R I C U LT U R E0 . B O X 245, B E R K E L E Y, C A L J F O R N I A 94701

USDA FOREST SERVICEGENERAL TECHNICALR E P O RT P S W- 1 0 I 1 9 7 5


2/40

Russell, Ro bert M., David A. Sharpnack , and ElliotL. Amidon197 5. Wildland Resource Inform ation System: user's guide. USDA

Forest Serv. Gen. Tech. Rep. PSW-10, 36 p., illus. PacificSouthwest Forest and Range Exp. Stn., Berkeley, Calif.

This user's guide provides detailed inform ation abo ut how to use thecomputer programs of WRIS, a computer system for storing and manipu-lating data about land areas. Instructions explain how to prepare maps,digitize by automatic scanners or by hand, produce polygon maps, andcombine 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 managem ent; wildland management; resource useplanning; com puter programs; map compilation; WRIS; management infor-mation systems.

The Authors

are assigned to the Station's research unit investigating measurement andanalysis techniques for management planning, with headquartersin Berke-ley, Calif. ROBERT M. RUSSELL, the unit computer programmer, re-ceived a bachelor's degree in mathematics at the University of Michigan(1956), and worked as a programmer a t the University of California, Berke-ley, from 19 58 until 1966, when he joined the Station staff. DAVIDA.SHARPNACK, a research forester, was educated at the University of Idaho(bachelor's degree in forestry, 19 61 ) and th e University of California,Berkeley (master's degree in statistics, 1969), and has beenwith the Sta-tion since 1 962 . ELLIO T L. AMIDON is in charge of the measurem ent andanalysis techniques research unit. He earned a bachelor's degree in forestmanagement at C olorado State University (19 54) and a master's degreeinagricultural economics at the University of California, Berkeley (1961),and w as assigned to p roduction economics research at the Station until heassumed his present p ositionin 1971.


3/40

CONTENTS

Page

1. Preparing Maps ....................................... 1 2. Digitizing Maps With a Sc anning 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 (FREQ TB) . . . . . . . . . . . . . . . . . . 8

3 . Digitizing Maps by H and . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 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 Symb ol 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 Printou t . . . . . . . . . . . . . . . . . . . . . . . . . . . 12 4.5 Editing a Polygon File with a Line Plotter .............. 18 4.6 Work Flow . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 19

5 . Com bining Layers . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 19 5.1 Overlaying Maps from Two Laye rs (MOSAIC) . . . . . . . . . . 19 5.2 Aggregating Overlay Acreages (TALL Y) . . . . . . . . . . . . . . . 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 Summ ary of a Map (GOSSIP). . . . . . . . 22 6.4 Printing General Summary of a Ma p(RU M0 R) . . . . . . . . . 22 6.5 Housekeep ing Program (SIGNAL) .................... 22

7. Program Notes7.1 Computer System . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 24 7.2 Files . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 24 7.3 Card Form ats ................................... 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 Fore st-type Descriptionsto C omputer-Readable Format. . . . . . . . . . . . . . . . . . . . . . . . 27

B-Major For est- type Assignmen ts . . . . . . . . . . . . . . . . . . . . . . . 28 C-Operating the PDS Microdensitometer . . . . . . . . . . . . . . . . . 36


4/40

PREFACE

The Wildland Resource Information System(WRIS) is a computerized system for storing andmanipulating data about land areas. The resourcemanager defines a geographic area by drawing a

boundary around it on a map. In nature, such bound-aries are irregular in shap e. We retain their shapeswithin the system by representing them mathemati-cally as multiple-edged polygons. Polygons are thefundamental building blocks of WRIS. They canrepresent timber stands, soil types, alternative treat-ments, and many other categories. WRIS has so farbeen used mostly for timber management; thereforeexamples and terminology in this report are takenfrom that activity. But the system can be pu t to workin ot he r fields-even those outside of forestry.

A group of polygons forms amap. The mosaic of

polygons m ust e xhau st the surface area, bu t polygonsmust not overlap each other. All polygons on onemap must be from the same layer (sometimes calledan overlay by oth er workers). Th e layer can representone kind of attribute, such as timber type. Otherlayers may be constructed, defining different attrib-utes of the same ground area. To handle combina-tions of attributes, W RIS can overlay any two layers.

The attribute of a polygon is expressed as alabel,consisting of from 1 to 36 characters. Each polygonmust have a label attached to it. A label is no t unique-it may occur many times on a map, on ce fo r every

polygon containing the same attribute. The polygonson a map are assigned unique serial numbers, calleditem numbers, for identification purposes.

WRIS can be applied to an entire National Forestby dividing the Forest into townships (quadranglesheets would be better) and by processing the maps asseparate units. Each layer on a township m ap isdrawn separately with inked lines on 24- by 24-inch(610 m m by 610 mm) paper by using a scale of 4inches per mile. (Other scales and smaller m ap sheetsare possible.) Then we scan it on a microdensitometerwith a grid spacing of .024 inch (.61 mm). Our scan-

ner requires transparencies no larger than9 inches(229 mm) on a side, so the m ap needs to be reducedphotographically.

The scanning operation stores the map in digitalform on magnetic tape. This tape is condensed by acomputer program (FREQTB) which also prints outthe grid so it can be checked for errors. The grid

consists of zeroes and ones: zeroes for the areas be-tween lines, and ones for the points falling on poly-gon boundary lines.

The PO LLY program then converts this grid into afile of polygo ns an d attach es a label to each. Whenthis is done for each layer on each township, a com-plete d ata base becomes available fo r a Forest. Otherprograms are used t o combin e layers (MOSAIC), ac-cumulate acreage totals (TALLY), and draw the mapson a digital plotter (CHART).

If a map sheet is extremely simple, containing fewboundary lines, most of the scanned p oints are

zeroes. It is mor e efficient to han d digitize this kindof map and to process it through the HANDY pro-gram instead of using FREQTB.

WRIS was developed by the Station's research unitinvestigating measurement and analysis techniques formanagement planning. This User's Guide providesdetailed information abou t how to use the computerprograms of the system. For a fuller description ofthe development an d characteristics of WRIS and forproduction information, see the companion reportWRIS: A Resource Information System for WildlandManagement (USDA Forest Service Research Paper

PSW-107). Copies are available upon request to:

DirectorPacific Southwest Forest and Range Experiment

StationP.O. Box 245Berkeley, California 94 701Attention : P ublication Distribution

The WRIS computer programs are also availableupo n request. They will be copied on a magnetic tape,to be supplied by the requestor. Before sending the

tape, the requestor should contact this Station (At-tention: Computer Services Librarian), at the aboveaddress, and give the tape format desired.


5/40

1 . PREPARING MAPS

Prepar i ng maps cor re ct ly i s t h e s i n g l em ost i m po r ta n t s t e p i n t h e d i g i t i z i n g p r o-c e s s . E l im i na t in g e r r o r s a t t h i s s t e p h asa g re a t e r impac t on cos t t han do ing so a tany ot he r s t age . These two sources ofe r ro r s can be e l imina ted : poor i nk l i nequ a l i t y and log ic a l map e r ro r s .

Ink l in e s should be of uniform widthand uniform densi ty. Moving the pen toorap id ly a long a s t r a igh t edge when ink ings t r a ig h t bounda r i es p roduces a t h in , weakl i n e . A good qual i ty inking job can com-p l e t e l y e l imina te t he need t o make co r-r e c t io n s i n l a t e r s t a ge s .

The most common lo gi c al er ro rs t h a tc an b e e l i m i n a t e d a t t h i s s t a g e a r e p ol yg on sw i t h o u t l a b e l s a n d t w o d i f f e r e n t l a b e l s i none polygon. The la t t e r er ro r may occurbecause t he s i ze and shape obscure th ef a c t t h a t i t i s one polygon. I t may a l sooccur because the l i ne s epa ra t ing two po ly -gons was not inked.

Maps t o be d i g i t i ze d wi th a s canne rmust be sp ec ia l l y prepare d. Draw i n inkth e polygons t o be di gi t i ze d. They must benonove r l app ing and comple te ly f i l l t he a r eat o be d ig i t i ze d . Have on ly one l aye r o finfo rma tion p er map; f o r example, one mapf o r timb er- type , one f o r management con-s 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 ebounda r i e s . To have polygons f i l l t he a r e aa s s i gn a s p e c i a l l a b e l t o a l l a r e a s whicha r e n o t o f i n t e r e s t . T hi s s t e p i s c r i t i c a l

f o r f i nd i ng a l l e r r o r s d u ri ng t h e e d i t i n gpro ce ss . The map must al so be fr e e ofi s l a n d s ( f i g . 1) . Remove by connectingthem t o th e "mainland" i n two separa tep l a c e s ( f i g . 2 ) . E l im i na t in g i s l a n d s c r e a t e snew polygons. These must be lab el ed wi thth e same la be l a s th e polygon the y weres p l i t from. The new polygons should be a tl e a s t l a rg e enough f o r a l a b e l t o b e e a s i l yp r i n t e d i n s i d e .

A l l the maps on the Stanis laus andEldorado National Forests were drawn witha ft2 rapidograph pen. Wri te a l l o th erinfo rma tion on the map, such as polygon

la be l s , con t ro l po in t numbers, o r geograph iccoord ina t e s w i th a non-pho to b lue pe nc i l .

No s p e c i a l p r e p a r a t i o n o f m aps i s neededf o r t he hand d i g i t i z i ng p rocess . However,comments ab ou t l o g i c a l e r r o r s s t i l l a p p l y.

2. DIGITIZING A MAP WITH A SCANNINGDENSITOMETER

2.1 Equipment

I n d i g i t i z i n g w i th s c a nn i ng d e n s i t om e t e rthe o p t i ca l de ns i t y of a map i s measured a te v er y p o i n t . F or t h e i n v e n t o r i e s o f t h eEldorado and Sta nis la us Nat ional Fore s ts wused a Photometric Data Systems PDS-1010.1'R e l a t i v e l y sl ow bu t a c c u r a t e , t h i s f l a t - b e ddensi tom eter uses or thogonal le ad screwsand s t epp in g motor s t o prov ide a r a s t e rscan of t r a n s p a r e n t m a t e r i a l . O ut pu t i sa 1 0 - b i t d e n s i t y f o r e ac h s p o t i n t h e r a s t e r .These den s i t i e s a r e wr i t t en on magne t ic t apea t 55 6 bp i . The 10 -b i t dens i ty p rov idesa gray-sc ale of 1024 le ve ls . The scanne rbed has a 9-by 9-inch (229 mm) sca n ar ea .To accommodate th e bed s i z e and th e needfo r u s ing a t r anspa rency, a pho tographicreduc t ion nega t ive i s s c an ne d r a t h e r t h a nthe o r ig ina l map. The re fo re , t he use r haswide choice of map si z e and ma te ri al .

2 .2 Aper ture and Spacing Al ter na t iv es

The sc anne r can make a d en si ty re adin ga t any g r i d spac ing which i s a m u l t i p l e o f2 o r 3 micrometers. The scanne r can use oneof 20 aper ture s (s iz e of spot measured)ranging from 3 .5 t o 396 .67 micrometers ind i a m et e r. I n a d d i t i o n , t h e r e d u c t i o n f a c t o rused in making the negat ive can be var ied.Ink l i ne width on the o r i gi na l map can a l sob e v a r i e d .

The optimum combination of spacing,

a p e r t u r e , r e d u c t i o n , and l i n e w id th i si n f l u e n c e d b y f o u r m ajo r i n t e r r e l a t e d f a c -to r s : map s i ze , map de t a i l , s cann ing t ime ,and computer processing time. A l o s s i ne ff i c i e ncy due t o a change in one f ac to rc an be p a r t i a l l y o f f s e t by c ha ng es i n t h eo t h e r t h r e e .

1 . Map s i z e : The l a r ge r t he map th elonge r i t t akes to s can and p rocess t hed a t a f o r a g iv en l e v e l o f d e t a i l . S p ac i ng ,ape r tu re s , and l i ne wid th can be inc reas edt o speed up p rocess ing i f map de t a i l pe rmi t s .

2 . Map de ta i l : Spacing and ape r t ure

canno t be l a rg e r t han th e d i s t anc e be tweenthe c l os es t l in es which must be recognizeda s s e p a r a t e , t i m es t h e r e d u c t i o n f a c t o r.Line width t imes red uct ion fa ct or must a ls obe equa l t o o r l a r ge r t han spac ing and ape r-t u r e .

I/Trade names and commercial enterpriseso r p r o du c t s a r e m en ti on ed s o l e l y f o r i n f o r -mation. No endorsement by th e U.S. Depart-ment of Agricul ture i s imp l i ed .


6/40

3. Scanning t ime: Scanning t ime i sa f u nc t i on o f t he l eng th o f a row in mic ro-meters and t h e number of rows. Typ icalscanning t imes f o r 24- by 24- inch (610 mmby 610 mm) maps run from 10 t o 1 3 h o u r s .Ther efore , use t he maximum reduct ion fa c t orp o s s i b l e .

4. Computer pro ces sin g t ime : Proces s -

i ng t ime i s a lmos t who l ly a f unc t i on o f t het o t a l n umber o f d e n s i t y r e a d i n g s . There-f o r e , u s e t h e w i d e s t s p a c i n g p o s s i b l e c on -s i s t e n t w i th t h e r e q ui r e me n t s o f map d e t a i l .Spacing can be up t o 10 perc ent wider thant h e a p e r t u r e .

We found th a t a sp acin g of 60 ym, ana p e r t u r e o f 5 6 pm, a 10X reduct ion fac tor,and #2 rapidograph pen l i n e s provide goodr e su l t s . Th i s comb ina ti on i s for 1 :15840-sc a l e and 1 :31680-sca le maps and fo r photo-gr ap hi c equipment with a maximum re du ct io no 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 r e d uc -t ion might have changed the parameters .

Use d i f f e r e n t w e i g ht s i n a s s e s s i n goptimum combinat ions i f t he scanner hasd 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 . F orexample, many high-spee d sc an ner s haveo n l y t h r e e a p e r t u r e s a nd e q u i v a le n t s p a c i n g s .The scan ning time s, however, run from 2t o 10 minutes , so maximum redu ct ion i s notn eeded. Se l ec t a conven i en t ape r t u r e ands p a c i n g a nd va r y t h e r e d u c t i o n f a c t o r t os u i t map d e t a i l .

2 .3 Photograp hic 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

e x a c t r e d u c t i o n f a c t o r . S c a l e c o n t r o l i so b t a i n e d t h r o u g h c o n t r o l p o i n t s r a t h e r t h a nb y ca l cu l a t i on o f a s equence o f en l a rgemen tand redu ct io n fa c t or s . Almost any h ighc o n t r a s t c op y f i l m i n te n d e d f o r l i n edrawings can be used f o r making th er e d u c t i o n n e g a t i v e . A combination oft r a n s m i t t e d a nd r e f l e c t e d l i g h t p ro d uc e st h e b e s t r e s u l t s . The t r a n s m i tt e d l i g h ti n c r e a s e s t h e c o n t r a s t be tw ee n i nk l i n e sand backg round . The r e f l e c t e d l i gh t i sneeded t o wash ou t th e non-photo b luel a b e l s .

2 .4 Scanning Procedure

P l ace t h e nega t i ve on t he s canne rbed s o t h a t t h e s c a n s t a r t s i n t h e u p pe rl e f t h and c o r n e r o f t h e s c a n a r e a a ndt h e f i r s t s ca n l i n e i s l e f t t o r i g h t a cr os st h e t o p . I n s e t t i n g up t h e X and Y scanl i m i t s , b e s u r e t o i n c l u d e a s few e x t r a

r e a di n g s a s p o s s i b l e . The ex t r a r e ad i n gsinc r ea se t he volume o f da t a and t hus t hec o s t o f p r o c e s s i n g .

The machine s e tt in g s we used fo r theS t a n i s l au s and E ldo rado Na ti ona l Fo re s t smaps t o ge t a spac ing of 60 pm and ana p e r t u r e o f 5 6 pm were: s e t u p p e r a n dl ow er a p e rt u r e t u r r e t a t E , s e t u p pe r a nd

lower magn i f i c a t ion a t 2 , s e t mic romet e rsp e r s t e p a t 6 , s e t s t e p s p e r r e ad in g a t10, X-axis motor a t B , and Y-axis motor a tE . (See also Appendix C. )

2 .5 Se l e c t i on o f Dens i t y Th resho ld

To ext ra c t polygons f rom the s cannerd 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 c onv erted t o a bin ar y map, whichi s a g r i d w it h o ne s f o r l i n e s a nd z e r osfo r space s between l i ne s . To conve r t ,a l l d e n s i t i e s below a t h re s h o l d a r e s e tt o one a nd a l l d e n s i t i e s a b ov e t h a t t h r e s -ho ld t o z e ro . When a scanne r t ape i s r e a d ,

a l l o r a s am ple o f t h e d e n s i t i e s a r e u se dt o c o n s t r u c t a f r e qu e nc y 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 ede ns it y of most of t he background of a map.The mode i s u se d t o c a l i b r a t e t h e d e n s i t i e sfo r d i f f e r e nce s i n exposure and devel op me ntin making the negat ive .

The t h r e s h o l d i s s e t b y t h e d e n s i t yad ju stment f a c t o r r e ad i n to t he p rog ramFREQTB (fi g. 4) . The de ns it y adju stme ntf a c t o r i s t h e number o f den s i t y l ev e l s t h et h r e s h o l d i s be lo w t h e mode ( f i g s . 5 , 6 , 7 ) .The l a rg e r t he dens i t y ad ju s tmen t f a c t o rt he l ower t he t h r e sho ld and t hus t he

f e we r o ne s 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 ad ju s tm e nt f a c t o r s h o u ldbe con s tan t fo r one ba tch o f maps andn e g a t i v e s . A new batch may requirechang ing t he ad ju s tmen t f a c to r. Ty in gthe t h r e sh o ld t o t he mode t ake s c a r e o fminor d i f f e r enc es w i th in a ba t ch . Ed i tf i r s t FREQTB pr in to ut f o r a ba tch o fmaps be fo re making any more ru ns . (Seese c t i on 4 .1 on ed i t i n g a b ina ry map.) I fth e l in e s have too many gaps , (ADDS) t h et h r e s h o l d i s too low.

To r a i s e t he t h r e s ho ld , l ower t h edens i t y ad ju s tmen t . I f t h e r e a r e t o o

many pla ce s which sh ould be gaps and ar eno t (DELETES), th e thr es ho ld i s t o o h i g h .Lower t he t h r e sho ld by en l a r g ing t h eadjus tment fa c t or . The abs olu te numbero f ADDS an d DELETES i s used t o j udge t h eth re s h ol d . About tw ic e as many DELETESa s ADDS i s a good b al a n ce t o s t r i v e f o r( f i g s , 8 , 9 , 10 ) .


7/40

Figure 1--Polygons labeled A are considere d islan ds by WRIS. Figure 2--The islands in figur e 1 have been removed by adding

connecting l ines.

Figure 3--Densit ies of a two -digit scan of a port ion of a map


8/40


9/40

0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 1 1 1 1 1 0 0 0 0 0 0 0 0 0 0 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 0 0 0 0 0 from the densities of figure 3 with0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 1 1 0 0 0 0 1 1 0 1 1 0 0 0 1 1 1 0 0 0 0 0 0 1 1 0 0 0 0 0 0 0 0 0 0 0 0 0 01 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 1 1 0 0 0 0 0 0 1 1 1 1 1 1 1 1 1 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 the correct threshold used.1 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 1 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0

0 0 1 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 1 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 00 0 0 1 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 1 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 00 0 0 0 11 0 0 0 0 0 0 0 0 0 0 0 0 0 11 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 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 1 0 0 0 0 0 0 0 0 0 0 0 0 0 1 1 0 01 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 1 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 1 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1111 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 00 0 0 0 0 0 1 1 0 0 0 0 0 0 0 0 0 0 0 1 1 1 1 0 0 0 0 1 1 1 1 0 0 0 0 0 1 1 1 1 1 0 0 0 0 0 0 0 0 1 1 1 1 1 1 0 0 0 0 0 0 0 0 0 00 0 0 0 0 0 0 1 1 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 1 1 1 0 1 1 0 0 0 1 1 0 0 0 0 0 0 0 0 0 1 1 1 1 1 1 1 0 0 1 1 1 0 0 0 0 0 0 0 00 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 1 1 1 0 0 0 1 1 0 0 1 1 0 0 0 0 0 0 0 1 1 1 1 0 0 0 0 0 0 0 0 0 0 0 1 1 0 0 0 0 0 0 00 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 1 1 1 0 0 0 0 1 0 0 0 1 1 0 0 0 0 0 1 1 1 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 1 1 1 1 0 0 10 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 1 1 0 0 0 0 0 1 1 0 0 1 1 0 0 0 0 1 1 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 1 0 1 1 1 1 1 10 0 0 0 0 0 0 0 1 0 0 1 1 1 0 0 0 0 0 1 1 0 0 0 0 0 1 1 1 1 0 0 0 0 0 1 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 1 0 0 0 0 0 0 0 00 0 0 0 0 0 0 1 1 0 1 1 0 1 1 0 0 0 0 0 1 0 0 0 0 0 0 1 0 0 0 0 0 1 1 0 0 0 0 0 1 1 1 1 1 1 1 1 0 0 0 0 0 1 1 1 0 0 0 0 0 0 0 0 00 0 0 0 0 0 1 1 0 0 1 1 0 0 1 1 1 0 0 1 1 0 0 0 0 0 0 0 0 0 0 0 1 1 0 0 1 1 1 1 0 0 0 0 0 0 1 1 1 1 1 1 1 1 0 0 0 0 0 0 0 0 0 0 00 0 0 0 0 0 1 0 0 0 1 1 0 0 0 0 1 1 1 1 0 0 0 0 0 0 0 0 0 0 1 1 0 0 1 1 1 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 00 0 0 0 0 1 1 0 0 0 0 1 0 0 0 0 0 1 1 0 0 0 0 0 0 0 0 0 0 1 1 0 0 1 1 0 1 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 00 0 0 0 1 1 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 1 0 1 1 0 0 0 1 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 1 0 0 0 0 0 0 0 0 0 0 00 0 0 0 1 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 1 0 0 1 1 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 1 0 0 0 0 0 0 0 0 0 0 00 0 0 1 1 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 1 1 0 0 1 1 0 0 0 0 0 0 1 1 1 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 00 0 1 1 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 1 1 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 1 1 0 0 0 0 0 0 0 0 0 0 00 0 1 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 1 1 0 0 1 1 0 0 0 0 0 0 0 0 0 0 0 0 1 1 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0

0 1 1 0 0 0 0 0 0 0 0 1 1 0 0 0 0 0 0 0 0 1 1 0 0 1 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 00 1 0 0 0 0 0 0 0 0 0 0 1 1 1 0 0 0 0 1 1 1 0 0 1 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 1 0 0 0 0 0 0 0 0 0 1 1 0 0 0 0 0 0 0 0 0 0 01 0 0 0 0 0 0 0 0 0 0 0 0 0 1 1 1 1 1 1 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 1 0 0 0 0 0 0 0 1 1 0 0 0 0 0 0 0 0 0 0 0 0

0 0 0 0 1 1 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 1 1 0 1 1 0 0 0 0 1 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 1 0 0 0 0 0 0 0 0 0 0 00 0 0 1 1 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 1 1 0 1 1 1 0 0 0 0 0 0 1 1 1 1 0 0 0 0 0 0 0 0 0 0 0 1 1 0 0 0 0 0 0 0 0 0 0 00 0 1 1 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 1 1 1 0 1 1 1 0 0 0 0 0 0 0 0 0 1 1 1 0 0 0 0 0 0 0 0 0 0 1 1 0 0 0 0 0 0 0 0 0 0 0

Figure 7 - 4 b inary map wa s produced 0 0 1 1 0 0 0 0 0 0 0 1 1 0 0 0 0 0 0 0 0 0 1 1 1 0 1 1 0 0 0 0 0 0 0 0 0 0 0 0 1 1 0 0 0 0 0 0 0 0 0 0 1 1 0 0 0 0 0 0 0 0 0 0 0from the densities o f f igure 3 with a 0 1 1 0 0 0 0 0 0 0 0 1 1 0 0 0 0 0 0 0 0 1 1 0 0 1 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 1 1 0 0 0 0 0 0 0 0 0 0 0

1 1 0 0 0 0 0 0 0 0 0 1 1 1 1 1 0 0 0 1 1 1 0 0 1 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 1 0 0 0 0 0 0 0 0 0 1 1 0 0 0 0 0 0 0 0 0 0 0threshold that was too high. 1 1 0 0 0 0 0 0 0 0 0 0 0 1 1 1 1 1 1 1 0 0 1 1 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 1 1 0 0 0 0 0 0 1 1 0 0 0 0 0 0 0 0 0 0 0 0

1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 1 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 1 1 1 1 1 1 1 1 0 0 0 0 0 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 111 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 11111 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 1 0 0 0 0 0 0 1 1 1 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 00 0 0 0 0 0 0 0 0 0 1111111111 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 10 0 0 0 0 0 0 0 111 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 0 0 0 0 1o o o o o o o i i i o o o o o o o o o o o o o o o o o o o o r i n n o o n o o o o o o o o o o o o o o o o o o o o o o o o o o o o o


10/40

Figure 8-FREQTB printout of

binary map in figure 5.

Figure 9-FREQTB printout of

binary map in figure 6,


11/40

Figure 10--FREQTB printou t of binary m ap in fig ure7.


12/40

2.6 Co nv er ti ng Bi na ry Map (FREQTB)

FREQTB re a d s a mi cro de ns it ome te rt a p e a n d t a b u l a t e s t h e f r e q u e n c y o fe a c h d e n s i t y l e v e l f r o m 0 t o 6 3, u s i n gt h e s i x h i g h -o r d e r b i t s o f e ac h d e n s i t yr e a d i n g . Each s i x - b i t v a l u e i s conve r t edt o a on e, i f be lo w, o r a z e r o , i f ab ov ean es ta bl is he d th re sh ol d. FREQTB computest h i s t hr esh ol d by s ub tr ac t i ng the DENSITYADJUSTMENT FACTOR from t h e mode o f t h ed e n s i t y fr e qu e nc y t a b l e . The r e s u l t i n gm a t r ix o f b i n a r y v a l u e s d u p l i c a t e s t h es c an n ed n e g a t i v e , w i t h o n es r e p r e s e n t i n gl i n e s ( l o w d e n s i t y ) a n d z e r o s r e p r e s e n t i n gth e background (hig h de ns i t y) . The onelzer ova lues a r e wr i t t en compact ly on t ape fo ruse by POLLY. To allo w manual ed it in g,t h e b i n a r y v a l ue s a r e a l s o p r i n t e d .

FREQTB w i l l proc ess one or moref i l e s ( i - e . , m aps) f ro m o ne s ca n t a p e ,wi th o utpu t on one o r more tap es a ss p e c i f i e d by t h e u s e r .

Input Cards:

1 . System cards .

2 . I n p u t u n i t d e s c r i p t i o n , c o n t a i n i n gu n i t d e s i g n a t i o n , n u m b e r o f f i l e s ( g o o dand bad) on t he in pu t tap e (FILES=n) , andnumber o f f i l e s ( i f a ny ) t o b e sk i pp e d a tthe beginning (SKIPS=n) .

3. DENSITY ADJUSTMENT FACTOR f o rf i r s t map. (See Sec t ion 2 .5 . )

4 . Header rec ord ( f or es t , map, andl a y e r ) a nd o u t p ut u n i t f o r f i r s t map.

I f two o r more maps a re t o be p rocess -ed from the i npu t t ap e , i t ems 3 and 4 maybe re pe at ed f o r each map. They must be i nthe same order as the scanning was done, asFREQTB does no t rewind a nd th en se ar ch t h eta pe f o r subsequent maps. Five minutes ofUnivac 1108 computer time i s adequa te fo ra FREQTB job on a map o f 1 000 scan rows and1000 re adi ng s per row. Thi s si z e map wouldproduce abou t 180 pages o f ou tpu t ( l e s s i fmap has la rg e blank ar ea s) .

Sample input deck:

@ R U NJqEDgE, 123456,5,200@ CTL CLS=N

@FH ASG A=1234@ W ASG B=5678@ ASG X=9876@ C U RIN XTRI X@ XQT FREQTB

INPUT UNIT=A$FILES=4;SKIPS=O$DENSITY ADJUSTMENT FACT@R=22$FOREST=ELD@RADfe LAYER=TIMBER;MAP=17;OUTPUT UNIT=B$@ FIN

3. DIGITIZING MAPS BY HAND

The computer t ime requ ire d t o proce ssan automatically-scanned map does notdepend on i t s co mp le xi ty. The same numberof d en si ty readings must be taken on asi mp le map a s on a "busy" one . Buton a s imple map, nea r ly a l l r ead ings a r ezer oes. The refo re, such a map i s r e -l a t i v e l y e x pe n si v e t o p r oc e s s by t h escanne r me thod , cons ide r ing th e sma l lamount of informat ion col lected.

A b e t t e r m ethod i s t o d i g i t i z e o n l ythe l i nes - - and do so manua lly. Fo r t h i swe employ a hand-guided d i g i t i z e r and aprogram that processes i t s o u tp u t i n t o t h esame form produced by FREQTB. Because ofi t s l i m i t a t i o n s , we c o n si d e r t h i s an a l t e r -na t iv e r a th e r t han p r imary method. Use r ss h ou l d c ho os e t h e s c a l e a n d a r e a o f t h e i rmaps i n such a way t h a t most o f t h e workc an be e f f i c i e n t l y p r o c e ss e d by t h e s c a n -n ing method, l eav ing on ly a sma l l pa r t t ob e h a n d d i g i t i z e d .

3.1 Equipment

For hand di gi t i z i ng , we use a BendixD at ag ri d d i g i t i z e r . I t h as a r e s o l u t i o nof 0 .01 inch ( . 25 mm) . Move the "cursor"over the map by fol lowing the inked l i n es .The cur so r s enses i t s c o o r di n a t e p o s i t i o n sa s i t moves, and the se x-y coo rdin ate s ar erecorded on magnet ic tape .

3 .2 Dig i t i z ing P rocedure

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 o v e r a l l l i n e s t o be r e -corded. A l l boundar ies must be c losed.A boundary may be re cord ed i n a s manyp i e c e s ( r e c o rd s ) a s n e c es s a r y a s l o n g a sno gap i s l e f t b et we en p i e c e s . A sma l lo v e r la p i s d e s i r a b l e . So i s a s m al lo v er r un a t T-s ha pe d i n t e r s e c t i o n s . As 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 o n l y t h e e n d p o i n t s . (For our

purpose s , Point and Line Modes are i n t er -changeable . ) A s t r a i g h t l i n e done i n P o i n tMode looks be t t er when pl ot te d. Do notd i g i t i z e t h e c o n t r o l p o in t s .

3 . 3 Co nv er ti ng t o B in ar y Map (HANDY)

The HANDY program receives as inputt h e t a p e w r i t t e n b y t h e B e n d i x d i g i t i z e r -


13/40

Output i s a t a p e t h a t a p p e a r s t h e s a m ea s th e ou tp ut o f FREQTB: a map scan nedon a g r i d hav ing a spac ing o f . 02 i nc h( . 5 mm). H A N D Y c o n s t r u c t s a g r i d o f t h a ts pa ci ng , p r e s e t s a l l o f i t s p o i n t s t ot h e v a l u e 0 , a nd t h e n c h an g es t o 1 a l lp o i n t s t h a t a ny d i g i t i z e d l i n e pa s se sove r. Thus , over lapp ed segments ar e mere lyr e dund a n t . Any spu r- l i ke ove r runs a r e pa r edo f f d u r in g l a t e r pr o c e ss i n g.

Two c a rd s a r e r equ i r ed i n pu t . Thef i r s t i s a "heade r r e co rd" con t a in ingj 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 gt h e B e nd ix t a p e . The o t h e r i s a l s o ah e a d er r e c o rd , f o r o u r o u t pu t t a p e . I tmus t c on t a in t h e un i t name, and Fo re s t ,Map, and Laye r.

Here i s a t y p i c a l i n p u t d e c k :

@ RU N RUSS,583301,1,300@ CTL CLS=N@ ASG A=1234@W H ASG B=5678@ N C U R

IN XTRI X@ N XQT HANDYINPUT UNIT=A $OUTPUT UNIT=B; F0REST=ELD@RAD0;M A P = 1 ; LAYER=TIMBER $

'4 . PRODUCING A POLYGON MAP

Once a map has been d ig i t iz e d andcond ens ed t o b in a ry fo rm , i t i s n e c e s s a r yt o g e n e r a t e a f i l e o f p ol yg on s f rom i t

a nd t o a t t a c h l a b e l s t o t h e p o ly go ns .A co n s ide r ab l e amount o f ed i t i n g i sn e c e s sa 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 Ed i t i ng t h e B ina ry Map

The g e n e r a l p ro ce du re i s t o f l a g a l le r r o r s on t h e c om pu te r p r i n t o u t . Thenr e c o r d a l l c o r r e c t i o n s o n d a t a f orm sf o r k eyp u nch ing . The p r i n to u t i s a s e r i e so f v e r t i c a l s t r i p s , c ommencing w i t h t h el e f t -m o s t edge o f t h e map.

4 . 1 . 1 E d i t i n g G u i d e l i n e s

Vi s u a l l y s c a n e a c h s t r i p , c o m p a r i n g itw i t h t h e map o r a p h o t o o f t h e map f o r e r r o r s .C ar ef ul e d i t i n g o f t h e p r i n to u t a t t h i s s t a g ew i l l s a ve c o n s i d e r a b l e t im e a nd c o s t l a t e r .C o r r e c t e ac h e r r o r by c i r c l i n g e ac h "0" t o bed e l e t e d w i t h a r e d p e n c i l a n d c i r c l i n g w i t ha b lu e o r g r een pe nc i l e ach space whe re an"9" i s t o b e ad de d. P u t a ch ec k i n t h e r i g h tm argi n i f o n e o r more c o r r e c t i o n s o c c u r i na row. These checks w i l l h e l p t o a v oi d

o m is s io n s a t t h e d a t a r e c o r d i n g s t a g e .B lo ck s 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 ya r e b l a n k.

F ol lo w t h e s e r u l e s f o r a d di ng o rd e l e t i n g "0 's " :

1 . F i l l i n ga ps i n l i n e s w i t h a s fewp o i n t s a s p o s s i b l e ( f i g . 1 1 ) .

2 . Open th e gaps be tween c lo se ly ingl i n e s ( f i g . 1 2 ).

H i nt s 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 U o n s i s t i n g o ft h e column h ea ds f o r e a ch s t r i p . I n s e r tr u l e r s i n t h e p r i n t o u t a t t h e b e gi nn in go f e a c h s t r i p . T h i s h e l p s t o m i ni mi zet h e e r r o r o f f o r g e t t i n g t o c ha ng e r u l e r sa t t h e b e g in ni ng o f e ac h s t r i p . Columnn um be rs a r e p r i n t e d a t t h e b e g i n n in g o feach s t r i p . Row numbers a r e p r i n t e d a longt 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 pnumber i s p r i n t e d i n a column t o t h e r i g h tof the row number.

2. Vi s u a l l y f o l lo w e ac h s t r i n g o f0 ' s l o ok i ng f o r g ap s i n l i n e s , s m al lp o ly g on s , a nd a r e a s w i t h a h i g h d e n s i t y o f0 ' s . T he se g ap s a r e p o t e n t i a l a r e a s f o rco r r e c t i ons . Two 0's a r e c o n s id e r e dc on ne ct ed i f t h e y a r e i n a d j a c e n t s p a c e se 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 di ag on -a l l y . Look p a r t i c u l a r l y f o r po l yg o ns w i t ho n l y a few i n t e r i o r c e l l s . Such p o ly g on sa r e ha rd t o sp o t when t he y a r e f ormed byd i agona l connec t i ons . Two k inds o f f e a tu r e s

which can cause ex t r a sma l l po lygons a r e0sharp 180 turns of a boundary and twop a r a l l e l b o u n d a ri e s which a r e c l o s e t o -ge the r on t he map bu t no t s ep a ra t e on t h ep r i n t o u t .

3 . S ince each add i t i on and de l e t i onmust l a t e r be recorded and keypunched,t r y t o k e ep c o r r e c t i o n s t o a minimum.

4. Two poly gon s conne cted by a narrowneck on th e map may have two d i f f e re n tl 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 g a p.

5 . The f i r s t two columns on each s t r i pa r e r e p e a t s o f t h e l a s t two c olu mn s o f t h ep r e v i o u s s t r i p . These columns almost elim-i n a t e t h e n eed t o r e f e r t o p r ev io us s t r i p swh i l e mak ing co r r e c t i on s . Any co r r e c t i on st o a repe ated column need o nly be madeonce .

6 . Ignore s t r a y 0 ' s which may occurd ue t o p o r t i o n s o f l a b e l s o r s p e c ks o f


14/40

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 00 0

0 00 Figure 11--Examples of lines needing ADDS.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

0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0

0 00 0

0 0

0 0 0 0

0 0 0 0

0 0 0

0 00 0

0 0 0

0 0 0

Figure 12-Examples of lines needing DELETES.


15/40

d i r t t ha t were pho tog raphed . A computerprogram w i l l "d i s so lve" them. I t a l s od i s s o l v e s a ny p i e c e o f a l i n e t h a t i s n o tpa r t o f a l oop . Th i s i s a l l r i gh t i f t hel i n e came from a smudge bu t w i l l be ane r r or i f it i s due t o a gap i n an i nkedl i n e .

7. I t i s h i g h l y d e s i r a b l e t h a t t h e

p r in tou t shou ld be ed i t ed tw ice , e acht ime by a d i f f e r en t pe r son . Usual lyomiss ions w i l l be found and the l i s tw i l l lengthen.

4 .1 .2 Recording Erro r Correct ions

Record t h e row and column numberswhere t he con t ro l po in t s appea r on t hebinary map. Th es e a r e t h e GRID CONTROLPOINTS i n t h e PgLLY i npu t d eck. Recordthem i n c lockwise o rde r s t a r t i ng w i tht h e l ow er l e f t c o r n er.

Next recor d th e "add" and "del ete"

co rr ec ti on s marked on th e FREQTB pr in to ut .For convenience i n handl ing the cardd ec ks l a t e r , s t a r t t h e r e c or d in g w it h aca rd wh ich i den t i f i ed t he adds and de l e t e s ;example s: 'ADDS MAP 30 ' o r 'DELETES MAPNUMBER 2 6 ' . I t i s he lp fu l t o s t a r tr e c o rd i n g d e l e t e s a t t h e t o p o f a s e p a r a t es h e e t . Each s t r i p h a s a r u l e r f o r r e c o rd -in g column numbers. Look f o r check marksi n the r ig ht margin opposi te rows needingco rre ct i on . Record adds and de le te s byrow and column on data forms; examples,5 , 62, 10,453. For convenience i n sub-s eq ue nt e d i t i n g , s t a r t ea ch l i n e w it h arow e n t ry and end with a column en tr y

fo ll ow ed by a comma. Leave unused columnsb lank . In t h i s way an i tem w i l l no t bes p l i t be tw ee n l i n e s , and no e r r o r w i l lo c c u r i f t h e o r d e r o f t h e c a r d s i s c ha ng ed .Long consecu t ive l i s t s o f i t ems in onerow o r one column may be added o r de le te dby the fo l lowing shor t -cut method: [ R , c ~ A C ~ ] ,o r [ R ~ A R ~ , c ] . (See a l so Sect ion 7 .33.)

4.2 Recording Polygon Labels

4 .2 .1 Setup

To record th e x-y posi t io n of thel ab e l s , e s t a b l i s h axes . The l eng th o f each

ax i s s l i g h t ly exceeds t he l a rge s t map d imen-s ion expec t ed . The ve r t i c a l o r "no r th - southvd i r e c t i o n i s d e s i g n a t e d a s t h e y a x i s .The map i s p o s i t i o n e d w i th i n t h e r i g h t a n g l eformed by th e x-y axes so t h at th e co ntro lp o i n t s (and a l l p o i n t s ) w i l l b e p o s i t i v e ,non-zero in teg er s . The x and y d is t ance sf rom the o r i g in i n hundred ths o f an i ncha r e r e c o rd e d a s e x p l ai n e d i n t h e s e c t i o n onmap co ntr ol po int s . (7 .3 .2)

4.2.2 Symbol Tr an scr ipt ion

If both upper and lower case le t tersa r e u sed i n a map, a t r an s l a t i o n i n t o aformat acceptable as computer input i sreq ui red . Rules and examples ar e des-crib ed i n Appendix A .

The Mylar maps supplied by the con-t r a c t o r f o r t h e S t a n i s l a u s and E ld or ad oNationa l F or est s had stan dard Region 5f 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 erequ ire t r an sc r i p t io n of some symbols.

4. 2.3 Label Recording

S t a r t r e c o r d i n g l a b e l s a n d t h e i r x - ypo si t io n on a new l in e of th e da ta form.S e l e c t a c o o r d i na t e p o s i t i o n t h a t i srough ly c en t r a l l y l oca t ed i n t he polygon .Use a non-photo blue pe nc il t o check of feach l abe l a s it i s r ec or de d. An e n t i t ycon s i s t s o f a l a be l f o ll owed 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 s e p a r a t e d by acomma. The l a s t e n t i t y i s followed bya d o l l a r s i g n . Wit hi n t h e e n t i t y , t h eth r ee p a r t s a r e s epa ra t e d by one o r moreblanks . The x and the y coordin ates ar ei n un i t s of 0 .01 inch . Thus , 24 inchesfrom t h e o r i g i n i s w r i t t e n a s 2400.

The data i s wr i t t en a s one long "st ream;"th a t i s , t he end o f a l i ne on a da t a formh a s no s i g n i f i c a n c e . I f a n e n t i t y i s n o tcomplete when th e l a s t column i s reached ,s imply con t inue on t he nex t l i n e . Ju s ton e c a u t i o n , ho we ve r. I t i s ea s y t ofo rge t t ha t a b l ank i s a s i g n i f i c a n t c h a r -

a c t e r ( s e p a r a t o r ) . T he re i s a tendency t oforg et recordin g th e b lank when i t f a l l sj u s t a f t e r t h e l a s t c olumn and t h u s i ncolumn 1 o f t h e n e xt l i n e .

4.2 .4 Master Label Accumulation

When complex la be ls such as th e timb erlabels shown in Appendix A a re u sed , c a r emust be taken t o e l imin ate typogra phicaland log i ca l e r ro r s f rom the l abe l i npu tdeck. PgLLY, th e polygon ex tr ac ti ng program,checks each l a be l a ga ins t a mas t er l a be ll i s t . A message i s p r i n te d i f t h e l a b e l i snot on the master l i s t . For some layers an

e x ha u st i ve l i s t o f l a b e l s i s easy t o make.I t i s n o t d i f f i c u l t t o c om pl et el y l i s tc o u n t i e s , r a n g er d i s t r i c t s , o r e v en manage-ment co ns t ra in t c l as se s . However, the remay be over 1,000 codes used out of apos s ib l e mi l l i on o r more codes i n t hesyst em used f o r t h e t imbe r l a ye r on t heSt an is l au s and Eldorado Nat ional Fo res t s .In t h i s s i tu a t io n WRIS uses la be l decks and


16/40

t h e program SIGNAL desc ri be d i n a f oll owi ngs e c t i o n t o c o n s t r u c t a c om p le te m a s te r l a b e ll i s t .

The p ro c e s s i s s t a r t e d by u s i n g t h eA D D ITEM con t r o l ca rd t o pu t t he l a be li n p u t d ec k o f t h e f i r s t map i n t o t h e m a s t e rl a b e l f i l e . The l a b e l s ca n t h en b e s o r t e dan d p r i n t e d . T h is s o r t e d l i s t o f l a b e l ss h o u l d t h e n b e v e r y c a r e f u l l y e d i t e d t omake s u r e t h a t t h e l a b e l s f o ll o w a l l t h er u l e s o f t h e c o di ng s y s te m . Any incorrectl a b e l s c a n b e d e l e t e d f r o m t h e l i s t by usingt h e DELETE LABELS c o n t r o l ca rd . The c o r -r e c t e d l a b e l s a r e t h en a dd ed t o t h e l i s t .The nex t deck of l ab el s can then be checkeda g a i n s t t h e m as t er l a b e l l i s t by us ing theCHECK LABELS c o n t r o l c ar d. A l l l abe l s whichw ere n o t i n t h e o r i g i n a l d ec k w i l l b e f l a g -g ed i n t h e p r i n t o u t . T he se sh o ul d a l l b ec he ck ed c a r e f u l l y an d a ny e r r o r s c o r r e c t e di n the ca rd deck. Th i s deck can then bea d d e d t o t h e m a s t e r l i s t w i t h t h e ADD ITEM

c o n t r o l c a r d . D u p l i c a te s o f l a b e l s a l r e a d yon the mas te r l i s t w i l l be ignored . Eachl a b e l i n p u t d e c k i s p ro c es se d i n t h i sway; that i s , by ca re fu l l y check ing anynew l a b e l s b e f o r e a d d in g t h a t d ec k t o t h em a s t e r l a b e l l i s t .

When a l l decks have been process ed t hem as te r l a b e l f i l e w i l l c o n t a i n a completel i s t o f a l l l a b e l s which o c cu r a t l e a s t o nc eon a s e t of maps. Any new o r changed la b el sw hich a r e p u t i n t h e l a b e l d e ck d u r i n ge d i t i n g w i l l be fl a gg e d by POLLY. Th isp r o ce d u re p r o v i d e s a n a d d i t i o n a l c ha nc e t oc he ck t h e l a b e l a g a i n s t t h e c o di ng 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 c o n s t r u c t e d itc a n b e a d de d t o t h e m a s t e r l a b e l l i s t .

4 . 3 Ex tr ac ti ng Polygons from Binary Map(POLLY)

POLLY co r r e c t s a bi na ry map by usi ngt h e ADDS and DELETES. I t then ex t r a c t spolygons from th e bin ar y map by using th el 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 ( se eS e c t i o n 4 . 2 . 3 ) . A l l t h e p ol yg o ns e x t r a c t e dar e wr i t te n on th e out put tap e. POLLYw i l l run a batch of jobs when there i s ase r i e s o f con t ro l ca rds fo l lowing the XQTc a r d .

Input Cards

1 . System ca r ds .

2 . Header r ecor d ( f o r es t , map, l a ye r,geograph ic con t ro l po in t s , map con t ro lp o i n t s , g r i d c o n t r ol p o i n t s , l o c a t io n ,s c a l e ) an d i n p u t u n i t f o r t h e b i n a r y m ap.

3. Header r ecord co n ta in i ng on ly theo u t p u t u n i t .

4 . c o r r e c t i o n c a r d s f o r b i n a r y mapfrom e di ti ng of FREQTB pr in to ut .

5 . M a st er l a b e l f i l e n am e.

6. Label deck.

Example Input Deck

@ R U N J@E,123456,3,100@ CTL CLS=N@ CTL SYS=A@ ASG A=1234@W ASG B=5678@ ASG X=3477@ N CUR

IN XTRI X@ N XQT POLLYINPUT UNIT=A; F$JREST=ELD@RAD@; AP=236;

L AY E R = M A N A G E ~ N T ;@ C A T I @ N = T ~ ~ N

16E;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, R L 600 700$

Limi ta t ions

Maximum number of x-y p o i n t s i n anypolygon: 1991Maximum number o f po ly go ns i n onemap: 500Maximum number o f ADDS and DELETEScombined: 5000

4. 4 E d i t i n g POLLY P r i n t o u t

Pr in to ut of a normally term inate d PgLLYrun w i l l c o n s i s t o f t h e s e s e c t i o n s :

1. Header record inp ut from car ds .

2 . Header r ecord resu l t ing f rom tapeheader record merged with card input record.

3 . Output unit number.


17/40

4. L i s t o f c o r r e c t i o n s f o r b i n a r y map.

a . A d d i ti o n s i n p u t c a r d sb . So r t ed l i s t o f a d d i t i o n sc . D e l e t i o n s i n p u t c a r d sd . So r t ed l i s t o f d e l e t i o n s

5 . L i s t o f l a b e l s .

a . Label i npu t ca rdsb . S o r t e d l i s t o f l a b e l s

6 . Output header record .

7 . Local la be l l i s t .

8 . D e t a i l e d l i s t of ex t r ac t ed po lygons .

9. Summary record of number and areaof polygons .

10. Conf i rma tion o f w r i t i ng o f ou tpu tf i l e .

F or t h e p u rp o se o f e d i t i n g , t h i s o u t p u t c anbe considere d i n two groups: Items 1-5dea l w i th i npu t ; i t ems 6 -10 dea l w i th ou t -p u t .

The p r in tou t i s o rg a n i z e d f o r u s e i ne d i t i n g r a t h e r t h a n a s a re c or d o f d a t a .E r r o r s d u r i n g i n p u t a r e u s u a l l y r e c o r d i n g ,format , o r key punch er ro rs . There ar etwo g roups o f e r ro r s : t hose wh ich s to pthe program and those that do not . I t i sb e s t t o s t a r t l o o ki ng a t t h e b ack o f t h ep r i n t o u t t o s e e i f a ny i n pu t e r r o r s haves topped the program. A l i s t o f f a t a l e r r o rmessages fo l lows:

INPUT/OUTPUT FILE SPECIFICATION ERROR i

An i n p u t o r o u t p u t u n i t number i s g i v enin t he wrong p l ace i n t he i npu t ca rd deck .I f i = O an in pu t u n i t number was given wherean outp ut un i t number was expected. I fi = l an output unit number was given wherean input unit number was expected. (SeeS e c t i o n 4 . 3 f o r p ro p e r d ec k s e t u p . )

INPUT TAPE SHOULD BE MODE 1 BUT IS i

A f i l e w ith t h e co r r e c t Fo re s t , Map and

Layer, b ut w itho ut a bin ary map was rea d.Mode of t he f i l e i s i . (A bi n a r y map i smode 1 , a polygon map i s mode 2. )

CANNOT RECOGNIZE THE LABEL nnn

The l e f t -ha nd s i de o f a heade r r eco rde n t i t y (n nn ) i s m i s s p e l l e d . (S ee S e c t io n7 .3 .2 . )

INPUT CARD ERROR

The header record card has a formate r ro r. (See Sec t ion 7 .3 .2. )

TOO MUCH DATA ON INPUT CARDS

The to t a l amount o f d a t a i n t h e heade rr e c o r d i s more than the program canhandle . See th e programmer resp onsi blef o r WRIS mai nten anc e.

READ E R R O R WHILE READING ADDITIONS DECK

R E A D ERROR WHILE READING DELETIONS D E C K

Both o f t he s e e r r o r s r e su l t f rom fo rmate r ro r s such a s mi s s ing o r e x t r a commas,e x t r a b r a c k e t s , o r l a ck o f a r e c o r dt e r m i n a t o r. S ee t h e s e c t i o n s on E d i t i n gt h e Bi nary Map and on Card Format s f o ra comple te de s c r ip t i on o f fo rma t .

ADDITION OUT OF RANGE ROW i COLUMN j

DELETION OUT OF RANGE ROW i COLUMN j

A row o r column ex ce ed s t h e maximum numberof rows or columns i n th e map. Themaximums a r e found i n t he hea der r ec ordl a b e l l e d "SCAN ROWS1 and SCAN COLUMNS."

C A R D INPUT ERROR

Thi s message i n d i c a t e s a fo rmat e r ro rwh i l e r ead ing l ab e l s . (See Sec t ion 4 .2f o r l a b e l f o r m a t . )

ERROR READING LABEL DECK i

I f i equa l s 4 , an end -o f - f i l e wasencoun te r ed wh i l e r ead ing t he l abe l deck .The u sua l cause i s a mi s s ing r eco rdt e r m i n a t o r. I f i i s g r e a te r t h an 4 t h e r ear e more l ab el s than t he program canhandle . See th e programmer resp onsi blef o r WRIS mai nten ance .

I f t he POLLY p r in t ou t i s no t t e rmina t e dby one o f t he p reced ing e r r o r messages,one of th e foll owi ng messages may appe ari n t h e l i s t i n g o f l a b e l i n p u t c a r d s. ( Pr o-c e s s in g c o nt i nu e s a f t e r t h e s e e r r o r s . )

N MASTER LABEL FOUND nnn

The l ab el nnn i s n o t i n t h e m a st e r l a b e ll i s t . I f nnn i s no t a v a l i d l a b e l i t shouldbe co r r ec t ed , o the rwi se it should be addedt o t h e m as te r l a b e l l i s t . The l a b e l i sused by the program as i f i t were a correc tl a b e l .


18/40

N0 C00RDINATES FOUND F0R THIS LABEL nnn

A r ecord ing o r key-punch ing e r ro r hasr e s u l t e d i n n o c o o r d i n a t e s b e in g a s s o c i a t e dw i t h t h e l a b e l n nn . T h i s l a b e l i s ignoredf o r f u r t h e r p r o c e ss i n g.

The remaining error messages resul t froml o g ic a l e f r o r s i n t h e d a t a. They are foundd u r in g t h e p r o c e s s o f e x t r a c t i n g p ol yg on s.The messages w i l l b e i n t e r s p e r s e d w i t h t h ed e t a i l e d l i s t of polygo ns. To be ab let 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 someunders tanding of the thinning and polygone x t r a c t i n g a l g o r it h m s i s n ee de d.

The t h i n n i n g a l g o r i t h m s t a r t s w i t h ab in a ry map a s o u t p u t by FREQTB and en ds wi tha bi n ar y ma p wi th a l l l i n e s 1 b i t t h ic k . I ts t a r t s a t t h e t o p o f t h e map a nd l o ok sa t o ne row a t a t i m e . A row i s scannedu n t i l a s t r i n g o f one b i t s i s f ou nd . Ao ne b i t i s e l i mi n a t ed from t h e s t r i n g i fi t i s

n o t e s s e n t i a l f o r m a in t ai n in g aconnect ion between one -bi ts i n the rowabove or the row below. The b i t s i n as t r i n g a r e e xa min ed i n t h e f o l lo w i n g o rd e r :The b i t on t h e l e f t en d o f t h e s t r i n g i sel iminated unt i l a connect ion would bebroken; then the b i t on the r ig h t end o ft h e s t r i n g i s e l i m in a t e d u n t i l a c on ne ct io nwould be br ok en ; f i n a l l y, t h e i n t e r i o r b i t sa r e e xa min ed f ro m l e f t t o r i g h t . When a l ls t r ings in a row have been examined theprogram moves t o t h e row below. The mainconsequence o f the th inn ing p rocess fo r thePOLLY e d i t o r i s t h a t a g ap i n a l i n e c au s est h e l i n e t o b e e r a s e d down and t o t h e r i g h to r l e f t bu t no t up . The e ras u re s tops whent h e l i n e me ets o r i n t e r s e c t s a n o t h e r l i n e .

F igures 13 and 14 show the r e su l t s o ft h i n n i n g t h e ex am ple s i l l u s t r a t e d i nF igures 11 and 12. Fig ures 15 through 18d u p l i c a t e f i g u r e s 11 t h rough 14 , bu t theADD and DELETE c o r r e c t i o n s have bee n made.

The p ol yg on e x t r a c t o r s t a r t s w i t h a l a b e lloca t ion i n th e b ina ry map. The l abe ll o c a t i o n i s found by the program by trans-forming th e x-y la be l map coordinates in torow-column g r id coord ina te s . S t a r t i ng

a t t h e c olumn o f t h e l a b e l l o c a t i o n , t h erow i s s ca nn ed t o t h e r i g h t u n t i l a l i n e i sencountered. The l i n e i s fol lowed clock-wise around the polygon. A t a n y 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 c o u nt er -c l oc k wi se d i r e c t i o n i s t aken . The l i n e i sf ol lo we d 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 e nc ou nt er ed t h e l a s t b i ti n th e l i n e i s el im inat ed, and th e programa t t e m p t s t o c o n t i n u e f o l l ow i n g t h e l i n e .

I f t h e n e x t b i t b ack a l o ng t h e l i n e i s nowa deadend it i s e l imina ted . Th i s back ingup con t inues un t i l a b i t i s found whichc an c on ti nu e t h e l i n e o r u n t i l a f i f t h b i twould be eli min ate d. When a f i f t h deadendb i t i s encounte red in a s t r in g th e p rogramabandons the a t t empt t o ex t r ac t t he polygonI f t h e p ro gr am s u c c e s s f u l l y r e t u r n s t o t h es t a r t i n g p o in t i t c r ea t es an a r t i f i c i a ldeadend by f i l l i n g in the row o f the l a b e ll o c a t i o n f rom t h e s t a r t i n g p o i n t . t o t h el a b e l lo c a t i o n . T h is a r t i f i c i a l deaden di s u se d t o d e t e c t m u l t ip l e l a b e l s i n as in g le polygon .

With the operat ion of these two algor i thmsi n mind we can des cr ib e th e c or rec t io n oft h e d a t a e r r o r s s i g n a l e d by t h e f o l lo w i n gerror messages . S e v e ra l o f t h e e r r o rmessages a re fo l lowed by t h i s l ab e l p r i n to u t :

LABEL NUMBER =n , LABEL=m, X = i ,Y = j MAP LABEL=kkk

n i s t h e p o s i ti o n o f t h e l a b e l i n t h e i n p u tcard deck.

m i s t h e p o s it i o n o f t h e l a b e l i n t h e l o c a ll a b e l l i s t

i , j i s t he l abe l loca t ion i n map coord ina te s

kkk i s t h e l a b e l

Error messages which begin with 10 aster-i sk s t e rmina te p rocess ing o f t ha t polygon .

**********LABEL LOCATION OUT OF RANGE**********

When the x-y la be l l oc ati on i n map coo rdi nat esi s converted to row-column i n gr id c oord inat esone of the coordinates i s o u t s i d e o f t h erange 1 t o "SCAN ROWS" o r "SCAN COLUMNS."The l abe l p r i n to u t fo l lowing th i s messageloca te s th e l a be l in th e ca rd deck and onthe o r ig ina l map so tha t it can be co r rec ted .

*****THE FOLLOWING LABEL IS ON OR ADJACENTTO A LINE*****

The l a b e l l o c a t i o n g iv en i n t h e l a b e l p r i n t -out t h a t fol lows t h i s message may be i n er ro r

I t s l o c a t i o n n e a r a l i n e may a l s o ke ep o t h e re r ro r s f rom be ing de tec ted .

REACHED E D G E OF MAP n

The scan t o th e r i gh t has gone to column nand has not encountered any l ine . Thel a b e l l o c a t i o n i n t h e f o l lo w in g l a b e l p r i n t -ou t may have been misread o r recor ded wrong.I f t h e l a b el i s for a smal l polygon along


19/40

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 14-Results o f thinning the examples

in f igure 12 wi thout makingDELETtS.

Figure 13--Results of thinn ing the examples

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


20/40

Figure 15-Results of making ADDS in

the examples in figure 11.

Figure 16-Results of making DELETES 0 00 0ooooo 0000 00 00 00000 00 0

in the examples in figure 12. o oooooo 00 000 000 0 0


21/40

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 00 0

0 0 0Figure 17-Re sults of thinning the examples in figure 15 .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

0 0 0 0 0 0 0 0 0 0 0 0 0 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 0 0

0 0 0

0 0 0

0 0 0

0 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 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

000 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

Figure 18--Results o f thinning the examples in figure 16.


22/40

t h e t o p , r i g h t , o r bo tt om e dg e a s m al l e r r o ri 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 c ou ldp u t t h e l a b e l o u t s i d e o f t h e map p e r i m e t e r.

POLYGON TOO L O N G . STOPPED AT ROW i ,COLUMN j LABEL AT ROW k COLUMN n

The polygon has more than the maximumnumber of points a l lowed in i t s borde r ( seel i m i t a t i o n s i n S e c t io n 4 . 3 ) . The followingl a b e l p r i n t o u t w i l l l oca t e t he po lygon onth e or i gi n a l map. The polygon must be cu ti n t o a t l e a s t two s m a l l e r p ol yg on s bya d d i ng on e b i t s t o t h e b i n a r y map u s i n gc o r r e c t i o n c a r d s . A new l a b e l must beadded t o t he la be l deck f o r each new polygonc r e a t e d .

**********SCAN INTERRUPTED BY ISLAND**********

LABEL AT ROW i , COLUMN j

The polygon boundary does not enclose the

l a b e l a n di s

t h e r e f o r e a n i s l a n d i n s i d e t h epolygon f o r which th e l ab el was in t ended.F in d t h e i s l a n d u s i n g t h e l a b e l p r i n t o u twhich fo l lows th e e r r o r message. E l imina tet h e i s l a n d w i th a d d i t i o n s c a r ds ( s e e a l s oS e c t i o n 1 on prepar ing maps) .

D E A D E N D AT ROW i COLUMN j X = x , Y=y,

POLYGON LABEL AT ROW i , COLUMN j

Th i s i s fo l lowed by a l a be l p r in tou t andone o f t h e th r ee fo l lowing messages . I f

the deadend i s a r t i f i c i a l t h e l e f t end i sn e a r a p r e v i o u s l y us ed l a b e l l o c a t i o n . T ha tl a b e l i s f ou nd a nd t h i s m es sa ge i s p r i n t e d :

**********THE FOf!,L@WING ABEL IS WITHIN 5HUNDREDTHS OF THE DEADEND**********

T h is i s f ol l ow e d by a l a b e l p r i n t o u t . Thetwo lab el s ar e in the same polygon. Theyc an be f o un d i n t h e s o r t e d l a b e l l i s t a ndon t h e o r i g i n a l map s o t h a t t h e c o n f l i c tc a n b e r e s o l v e d . I f t h e two l a b e l s a pp e a rt o be i n adj ace nt polygons on th e map andt h e i r l a b e l l o c a t io n s a r e c o r r e c t l y r e co rd ed ,a gap i n a l i n e may have caused th e th i nni nga lgo r i thm to e ra se the bounda ry be tween thetwo polygons.

I f n o l a b e l i s f ou nd w i t h i n 0. 05 i n c h( 1 . 2 7 m) o f t h e d ea de nd i t i s assumedt o be a r e a l , no t a r t i f i c i a l , d eadend. Int h i s ca se two 20-row by 20-column pi ec eso f t h e b i n a r y map a r e p r i n t e d . T h e f i r s tp 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 w it h

th e co r rec t io ns inco rp ora t ed . The secondp i e c e i s th e th inned map. Both pie ces a recente red on th e deadend. For sh or t deadendst h e s e two p r i n t o u t s s h o ul d b e s u f f i c i e n tfo r co r r ec t in g th e e r ro r. For more complexc as e s, t h e FREQTB p r i nt o u t w i l l have t o beconsu l t ed . Deadends l e s s t han 5 b i t s l ongw i l l be e l im inated f rom th e boundary by th eprogram and need not be corrected withd e l e t e c a r d s .

This message i s p r i n t e d a n d p r o c e s s i n g o ft h i s polygon term inated when t he deadendi s more t h an 4 b i t s l o ng .

**********DEADEND AT B E G I N N I N G A N DE N D OFPOLYGON**********

When a second l ab el i n a polygon i s on th esame 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 ldeadend i s no t s een a s a deadend i n t he

us ua l way. Thi s messagei s

followed by al 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 a nda l a b e l p r i n t o u t f o r t h e l a b e l w i t h i n 0. 05inch (1 .27 mm) of the deadend.

A t t h e e n d o f t h e d e t a i l e d l i s t of polygonsare four numbers which help determine whethera l l e r r o r s ha ve b ee n e l i m i n at e d . F i r s tN U M B E R OF LABELS READ1 should equal ' N U M B E ROF POLYGONS WRITTEN'. Any d i f f e r e n c e comesfrom not comple ting some polygon due t oan e r ro r. The second pa i r o f i t ems 'AREAOF ENCLOSING POLYGON and 'AREA OF ENCLOSEDP@LYGONS1 sh oul d ag re e wi th in ab out onep a r t i n 4 00 0. While one pa r t i n 4000 i susua l ly much g r ea t e r accu racy than t hed a t a w a r r a n ts , it makes it v e r y u n l i k e l ytha t compensa t ing e r ro r s w i l l g i v e t h eappearance of an error- f ree map.

O c c a s i on a l l y, d ue t o po o r q u a l i t y i n p u t o rc a r e l e s s e d i t i n g , a map w i l l have manyi n t e r r e l a t e d e r r o r s. I t i s sometimesd i f f i c u l t i n t he s e c as es t o t r a c e t h ec au se o f a l l t h e e r r o r s . I t i s b e s t t h e nt o re ru n POLLY wit h a s many c or r ec ti on sa s can be made. Many of t h e remaininge r r o r s w i l l d i s a p p e a r a n d t h e r e s t w i l lb e e a s i e r t o c o r r e c t .

4. 5 Edi t ing Polygon Fi le With Line Pl ot te r

E d i t i n g a p ol yg on f i l e wi t h a l i n ep l o t t e r he lp s de t ec t e r ro r s t ha t POLLY can-no t f i nd . F ive k inds o f e r ro r s can show upon t h e l i n e p l o t . A lack of agreementbetween th e two a rea s p r in t ed a t t h e endof POLLY i s a n i n d i c at i o n t h a t a t l e a s tone o f t h e s e e r r o r s i s p r e s e n t :


23/40

1. A l i n e t h a t d o es n o t c o i n c i d e onthe p lo t and the map . T h i s e r r o r i s u s u a l l yc a us e d by a m i s t a k e i n e d i t i n g t h e b i n a r ymap.

2 . A l i n e i s on th e map but n ot on thep l o t . I f l a b e l s a r e n o t r ec o rd e d f o r t woad ja ce nt polygo ns, t h e i r common boundary w i l ln o t b e p l o t t e d . I f o ne l a b e l i s n o t re c or d eda nd a n e r r o r i n e d i t i n g t h e b i n a r y map c a u s e sone s id e o f t he po lygon t o be e rased t hepolygon w i l l b e i n c l ud e d a s p a r t o f t h ead jac en t po lygon . An unrecorded l abe l fo ra polygon on the edge of the map w i l l causepa r t o f th e map pe r ime te r t o be miss ing fromt h e p l o t .

3 . A s t r a i g h t h o r iz o n t a l l i n e on t h ep l o t i s not on the map. A l a b e l i s cen te redo v er t h e l e f t end o f t h e l i n e . I t s lo c a t i o nf e l l ex ac t ly on a po lygon boundary ins t e adof withi n . PGLLY got lo s t t r yi ng t o con str uctth e polygon and ac c id en t a l l y p roduced t h i s

s p u r i o u s l i n e . Check t h e l a b e l ' s c o -o r d i n a t e s o r t h e c o n t r o l p o i n t s .

4 . Small polygons, usual ly about one-t e n t h i n c h on a s i d e a r e on t h e p l o t b u tno t on t h e map. These are caused by ane r r o r i n e d i t i n g t h e b i n a ry map.

5. Polygons a re miss ing f rom the pl o tSin ce adja cen t polygons have some p ar t oft h e i r boundary i n common with t he missingpolygon, it w i l l a p p ea r t o b e p l o t t e d . Theo n l y c l u e t h a t t h e p ol yg on i s a b s en t i st h e l a c k o f a l a b e l .

To e d i t t h e p l o t , t a p e i t on to the top o ft h e o r i g i n a l map wi t h t h e c o n t r o l p o i n t sa l i g n e d a s c l o s e l y a s p o s s i b l e .

C o nt ro l p o i n t s on t h e p l o t s h ou ld a l l b ewi th in 0 .05 inch o f the con t ro l po in t s ont h e o r i g i n a l m a p . I f t h e c o n t r o l p o i n t s d ono t ag ree , r e -measure the co n t ro l po i n t s onth e o r ig in a l map t o he lp f in d which coord ina tei s i n e r r o r. U s u al l y o n l y one of t h e e i g h ti s wrong. The most common e r r o r s a r e re ad -i n g s t h a t a r e o f f by 0 . 1 , 1 , o r 5 i n c h e s .I f a c o r n e r i s off by as much as 1 inchPOLLY shou ld be rer un wi th t he co rr ec t

corners and a new plot made.

Then, w it h t h e p l o t s t i l l on t o p o f t h emap, sys t e mat i c a l ly scan the p lo t l ookingf o r t h e f i v e k in d s of e r r o r s d e s ir e d e a r l i e r .When a l l of th e e rr or s have been found,use t he POLLY pr in to ut and th e o r i gi na lmap t o f i n d t h e c a u s e o f a l l t h e e r r o r s .Then co r r e c t t h e POLLY inp ut deck and rer unPOLLY.

4.6 Work Flow

Preceding sect ions have descr ibedeach s t ep i n p roducing a polygon f i l e f roma map sheet. The o rde r o f the sec t ions waschosen f o r expos i to ry purposes . The moste f f i c i e n t s e q u e n c e o f s t e p s , i n p r a c t i c e,may be somewhat di ff er e nt . The sequence o fst ep s give n below was found t o work wel lon maps of the Stanislaus and EldoradoNat iona l Fores t s . Experi ence wi th o t he rkind s of map pro je ct s may sugges t modifica-t i o n s t o t h e se s t e p s .

1 . Record th e lab el s (See Sect ion4.2) . Record ing l abe l s be fo re any o the rwork i s done p rov ides an add i t iona l c loselook a t t h e maps and may uncov er somer e m a i n i n g l o g i c a l e r r o r s .

2 . Make th e negat ive (see Sect ion 2 .3)

3 . Scan the nega t iv e ( see Sec t ion

2 .4 ) .

4 . Convert scan ta pe t o bi nary mapwi th FREQTB (See Se ct io n 2. 6 ).

5 . Ed it th e bin ary map (See Secti on4 . 1 ) .

6 . Extr act polygons f rom th e bin arymap wi th POLLY (See S ec ti o n 4.3 ) . POLLYou tp ut sho uld be ed i t e d and POLLY rer unu n t i l a l l e r r o r me ssa ge s a r e e l i m i na t e d.

7 . P lo t t h e map us in g CHART (SeeSec t ion 6 .1 ) .

8 . Edi t t h e p lo t (See Sec t ion 4 .5 ) .9 . Rerun POLLY making co r r e c t i o n s

found from plot. Area of en clo sin g polygonand enclosed polygons should agree t oabout one pa r t i n 4000.

A t t h i s p o i n t t h e map i s r eady fo ruse and can be p ro ce ss ed by any WRISprogram th a t ope ra te s on a f i l e o f po lygons .

5 . COMBINING LAYERS

5 .1 Ov er la yi ng Maps from Two La ye rs (MOSAIC)

MOSAIC comb ines two maps re p r e s e n t i n gthe same area on the ground but f rom differ-e n t l a y e r s . The r e s u l t i s a polygon mapin which each polygon re pre sen ts t he a re ai n common between a pa i r o f polygons , onefrom each input map. (In mathematicalt e rm s, t h i s o v e r l a y po lyg on i s t h e i n t e r -s e c ti o n o f t h e s e t s o f p o i n t s i n s i d e t h etwo input polygons.) The lab el of t h i s new


24/40

polygon i s a combination of the two con-s t i t u e n t l a b e l s . A l l s u c h p a i r s o f o v e r -lapping in put polygons are processed.I f both inp ut maps complete ly cover agiven area of land with polygons, so w i l lt h e r e s u l t i n g map. But " s l i v e r s , " o rp o l y g o n s 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 -reg ard ed. By "i ns ig ni fi ca nt " we meanthose whose a rea i s l e s s than 0 .0125 squa re

inch o r whose a rea - to -pe r ime te r r a t i oi s le ss than 1/100 (map coo rdi nat es) .

The composite map can be written ont a p e f o r l a t e r u se i f de s i re d . T hi s i sn o t n e c es s a ry i f a l l you want i s a t a b l e o fa c r e a g e s s h o w i n g t h e t o t a l a r e a f o r e a c hl a b e l p a i r . T h is a c re a ge t a b l e i s p r i n t e dand al so punched. The punched card s ar ef o r in pu t t o TALLY.

MOSAIC w i l l run a batc h of jobs fo ra s e r i e s o f c o n t r o l c a r d s e t s f o l lo w i n gth e XQT card . I f one o f the two inpu tmaps i s fro m a l a y e r named "TIMBER" weassume i t s l a b e l s a r e f o r e s t - t y p e d e s-cr ip ti o ns (See Appendix A) and we con-dense them i n t o major typ es (Appendix B)b e f o r e p r o c e s s i n g.

Input Cards:

1 . System cards

2. Header record ( f or es t , map, layer)a nd i n p u t u n i t o f t h e f i r s t i n p u t map.

3. Header recor d ( f or es t , map, layer)and input uni t of the second input map.

4 . Header r eco rd and ou tpu t un i t f o ro u t p u t f i l e . I n c lu d e o n l y t h o s e p o r t i o n so f t h e h e ad e r re c o rd t h a t a r e d i f f e r e n tfrom th e in put f i l e s , namely, Map and Layer.I f you do n o t w is h t o w r i t e t h e o u t p u t f i l e ,a l l you punch i s "0UTPUT UNIT=N@NE$."

Example of Input Deck

@ R U N 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 XTRI X@ N XQT M@SAICINPUT 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$

L i m i t a t i o n s :

1 . Maximum number of x-y po in ts i n anyp a i r o f i n p u t p ol yg on s an d 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 o f it em s i n bo thi n p ut f i l e s p l u s o u tp u t 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

po lygons in each inpu t f i l e ) .3. Maximum number of times a polygon

pa i r (one from each inpu t f i l e ) canc ross each o the r : 800

4. Timing: MOSAIC re q u ir es abo ut 1minute of Univac 1108 computer time whene ac h i np u t f i l e h as 50 polygons, and about4 minutes for 400 polygons.

5.2 Agg rega ting Overl ay Acreages (TALLY)

Tally adds up the card decks punchedby MgSAIC, which contain the acreages ofthe ove r l ay combina t ion , and p r in t s thet o t a l a c r ea g e s. The t o t a l s a r e a l s opunched, in t he same format , so the job canb e di v id e d 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 . System cards.

2. Fore st name, followed by a do ll a rs i g n .

3 . Locat ion, fol lowed by a d ol l ars i g n . This i s u se d f o r v i s u a l i d e n t i f i c a t i o non ly.

4 . Master lab el l i s t f o r e a ch l a y e r.The lay ers come in a lp hab et i cal o rde r. Amas te r l abe l l i s t i s a c om ple te l i s t o fa l l l a b e l s i n t h e l a y e r , s e p ar a t ed bycommas and follo wed by a do l l a r si gn .

5 . Packets of cards punched by MOSAIC,i n a n y o r d e r. A p a ck e t s t a r t s w i th t h efo re st name and ends with a d ol la r s ig n.D i sc a rd t h e jo b i . d . c a r d s t h a t a r e u s u a l l yfound a t to p and bot tom of th e puncheddeck . The fo r e s t name must match t he namei n S tep 2 , above . I f packe t s fo r the samemap pa i r a pp ea r more tha n onc e, TALLY use st h e f i r s t a nd i gn o r es t h e o t h e r s .

Example of Input Deck:

@ R U N JACK,583301,1,30@ CTL CLS=N, MAXCARDS=100@ ASG X=5093@ N CUR

IN XTRI X


25/40

@ XQT TALLYMCCLOUD $T41N $PERI~TER,RL,ST,VP,WS$PERIMETER,FB, WF2 (1) *P,WF3(2) ,WF3(3) ,P 4( 1) $MCCLgUD $ T41N R2W $ 11 SEP 73 $11,1$4,5$P E R I ~ T E R , R L , S T , V P $ P E R I ~ T E R , F B , W F ~ ( ~ ) * P,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 $

6 . 1 P l o t t i n g a Map (CHART)

CHART p l o t s t h e polygons on an autom aticd i g i t a l p l o t t e r , a l lo w in g a map t o b echecked v i sua l ly. The program writes penmovement instruct ions on a tape, and theta pe runs the p lo t t e r o ff - l i ne . CHARTcomes i n two d i ff e r en t ve rs ions : one fo rth e Cal Comp 1136 p l o t t e r and th e ot he rf o r t h e EAI 430. We w i l l d e s c r i b e t h eCal Comp versi on f i r s t and then t e l l howth e EAI vers ion d i ff e r s f rom i t .

The map i s drawn i n two col ors --t hep ol yg on s i n one c o l o r an d t h e i r l a b e l si n a n o t h e r. A l s o p l o t t e d a r e t h e c o n t r o lp o i n t s , t h e x and y sc a l es i n map coord in a tes ,and a t i t l e , which i s a n e x t r a c t o f t h e he a d errecord .

S e v e r a l o p t i o n s a r e a v a i l a b l e , s uc ha s p l o t t i n g o n l y a p o r t i o n o f t h e mapdef ined by g iv i ng a l i s t of i te m numbers ,o r b lowing up the p lo t by inc lud in g am a g n i f i c a t i o n f a c t o r. And t o i d e n t i f y t h epo lygons the re i s a c h o i c e o f p l o t t i n gla be l s , l a be l numbers, o r i t em numbers .@umbering i s the same as on the p r in tou t . )I f a Cal Comp p l o t t e r i s u s e d , s e v e r a lmaps can be p l o t t e d i n a s i ng l e run byrepea t ing inpu t ca rd Sec t ions 2 and 3(below) f o r each map t o be pl ot te d. Thesame ou tpu t t ape must be used fo r a l l o fthem.

Input Cards:

1 . System cards

2. Header recor d of the map t o bepl ot te d. The fo re st , map number, and la ye ra r e r e q u i r e d . A ls o i n c l u d e t h e i n p ut u n i t .

3 . Cont ro l ca rds . A semicolons 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 rs i g n a t t h e e nd.

a . PLOT TAPE = t a p e l a b e lr e q u i r e d ) . T h i s t a p e w i l l d r i v e t h ep l o t t e r .

b . MAGNIFICATION = f a c t o r .Th is i s t h e amount of blow-up. O m i t -t i n g i t i s e q ui v al e nt t o a f a c t o r o f 1 . 0

c . RECTANGLE = min x , max x,

min y, max y. These fo ur numbers d ef i n ea rec tan gl e i n map coordi nate s withi n whicht h e p l o t i s t o be confi ned. The numbersa r e i n t e g e r s , i n u n i t s o f 0. 0 1 in c h .Om it ti ng t h i s and ltITEMS't means you wantt h e e n t i r e m ap.

d . ITEMS = l i s t o f i t e m n um be rs .T h i s i s a n o t h e r way t o s p e c i f y a s u b s e to f th e map t o be p lo t t ed .

e . PLGT ITEM NUMBERS ( d e f a u l t )PLOT LABELSPLOT LABEL NUMBERS

Choose one. I t t e l l s t he computer whatt o p l o t a s i d e n t i f i c a t i o n on e ac h p ol yg on .


@ RU N SMITH,l23456,2,50@ CTL CLS=N@ ASG A=9701@ W ASG B=8728k? ASG X=3703@ N C U R

IN xTRI X@ N XQT CHART

F Q R E S T = E L D Q W ~ ; AP=33; LAYER=TIMBER;INPUT uNIT=A$P L ~ TTAPE=B;RECTANGLE=1500,2000,1700,2400; MAGNIFICATION=Z; PL9T LABELS $

P l o t t i n g o n t h e E A l 430:

The ASG card f o r t he p lo t t ape musthave the H opt ion and the re i s a d i f f e r e n tprogram ta pe . In ou r example, t h e ASGc a r d s f o r B and X become:

@WH ASG B=8728k? ASG X=3952

6. 2 S t o r i n g S ev er al Maps on One Tape (FLEET)

The purpose of FLEET i s t o copy f i l e s(maps) from se ve ra l ta pes o nto one tap efo r more compac t s to r age . I t can a l so beused ju s t t o copy a t ape .

Copying i s con tro l l ed by a sequence ofheader records , each con ta in in g an I0 un i t


26/40

name, punched on input cards. As withthe other programs, only the minimum iden-t i f i c a t i o n i s r e q ui r e d on t h e h ea de rca rd s , namely For es t , Map Number, andLayer. Any ot he r infor mation i s f o rco r rec t ion o r expans ion o f t he ex i s t i ngheader record on tape. With tape input ,omission of Forest, Map, and Layer inputsw ha te ve r f i l e i s ne x t on t h e t a p e ; s p e c i f y -in g Fore st , Map, and Layer causes a sea rcht hr ou gh t h e t ap e u n t i l t h a t f i l e i s found.


This deck copies two f i l e s f rom tape1000 and one f i l e from tap e 2000, wr it in gthem onto tape 3000.

@ RU N MAC,583301,3,50@ CTL CLS=N@ ASG A=1000@ ASG B=2000@ W ASG C=3000@ ASG X=3950@ N CU RIN XTRI X@ N XQT FLEETINPUT UNIT=A; F ~ R E S T = E L D ~ R A D ~ ; AP=10;LAYER=TIMBER$OUTPUT UNIT=C$INPUT UNIT=A; FgREST-ELDPRADP; MAP=11;LAYER=TIMBER$~ U T P U T NIT=C$INPUT UNIT=B; FOREST=ELDORADg; MAP=55;LAYER=TIMBER$gUTPUT UNIT=C$

6 .3 Pr in ti ng D iag nos tic Summary of a Map(GgSSIP)

GgSSIP prints a detailed summary ofa l l polygons on a map so th a t e di t i ng canbe done and errors detected. The map t obe p r in t ed and the un i t i t i s on areid en t i f i ed by a header reco rd punched onca rds . Any number of maps can be printedby punching a ser ies of header records .

When in pu t i s from tape some short-c u t s a r e p o s s i b l e. A s w i t h t h e o t h e rp rograms , t he f i l e spec i f i e d on ca rds i s

sea rched fo r on the t ape . Therefore, anyinter venin g unwanted f i l e s can be dis -regarded. But i f more than one f i l e i swanted from a tape each must be processedin o rde r because a t ape i s not backed up.Ano ther s ho r t c u t a l l ows p r in t ing all i l e son a t a p e by punc hin g j u s t "INPUT UNIT =something $ ."

Example. Th is j ob p r in t s ou t onef i l e f rom t a p e 7000 and a l l f i l e s on

tape 4000.

@ RU N JIM,583301,2,150@ CTL CLS=N@ ASG E=7000@ ASG F=4000@ ASG X=3951@ N CU RIN XTRI X@ N XQT GgSSIPINPUT UNIT=E; FPREST=ELD~RAD~;MAP=51; LAYER=TIMBER $INPUT UNIT=F $

6.4 P r i n t i n g Gener al Summary o f a Map (RUMgR)

The RUMPR program i s s i mi la r t o GgSSIP,b u t p r i n t s l e s s d e t a i l e d i n f o r m a t i o n a b o u tthe po lygons . I t i s in t ended more fo rt h e w or ke r i n t h e f i e l d . I n p r a c t i c a lusage, such as in keypunching, i t i side n t i ca l t o GOSSIP i n a l l r e spec t s excep tfo r two cards : t h e ASG X card, which i s

@ ASG X=3955

and th e XQT ca rd , which i s

@ N XQT RUMOR

6. 5 Housekeeping Program (SIGNAL).

I f WRIS i s used fo r a l a rge da t a base ,(for example, 100 maps having 1000 distinctla be ls ) , keeping t ra ck of t he maps as theyare processed becomes i t s e l f a consider able

dat a handl ing problem. A record must bekept of what st ag e of process ing each mapi s in , what tape i t i s on, and so forth.Each of the thousands of polygons has al abe l , and i t must be checked against am as te r l i s t o f v a l i d l a b e l s .

SIGNAL i s d es ig ne d t o a s s i s t i n t h e s ehousekeeping chores. I t e n ab l es t h e u s e r t oes t ab l i sh and ma in ta in a f i l e of i n fo rma t ionabout hi s maps on a drum o r dis k u ni t . A" f i l e " c o n s i s t s o f a c o l l e c t i o n o f " r e c o r d s , "and each re cor d c on ta in s a "keyw by whichi t i s i d e n t i f i e d . Two d i f f e r e n t k i n ds off i l e s a r e p o ss i bl e, a "cat a logue f i l e vo r a "master l abe l f i l e . " In a ca t a loguef i l e t h e r e i s o ne r e c o rd f o r e ac h map,c o n s i s t i n g o f a p o r t i o n o f i t s heade r r eco rdplu s a few oth er p ieces of informat ion.A l l e n t r i e s i n a c a ta lo gu e f i l e p e rt a i n t oone f o r e s t . I n a m as t er l a b e l f i l e t h e r ei s one r e c o rd f o r e ac h l a y e r i n a f o r e s t , andsev era l f or es ts may be in termingled i n onef i l e , i f d es ir ed .

Cata logue f i l e : The permissable itemsi n a recor d ar e: MAP, L AY E R , L ~ C A T I ~ , ATE


27/40

OF ORIGIN, GEOGRAPHIC C0NTR0L POINTS,MAP CONTROL POINTS, PROJECTION, Z O N E ,ENVELOPE, P~LYG ~NEEL, BACKUP REEL, GRIDREEL. Most o f these can be cop ied d i re c t lyf ro m a h e a d er r e c o r d p r i n t o u t , u s i n g t h esame format. A s fo r th e o th e r s , an examplei s t h e b e s t d e s c ri p t i on :

DATE Q ~ FO R I G I N=

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 ha ve t h e t a p er e e l number fo l lowed by th e pos i t i on on there e l ( a ssuming more than onemap pe r r e e l ) .The r e t r i e v a l k ey f o r a re

Wildland resource information system: user's guide

Documents

Transcript of Wildland resource information system: user's guide