2.

Struktur Data

Format Data:
GL-4101 Sistim Informasi Geologi
 BIT (0/1)
 BYTE (kelompok 8 buah data BIT)
 Merepresentasikan nilai dari 0-255
STRUKTUR DATA  Biasa disimpan dalam bilangan Hexadesimal (00-FF)
 ASCII (American Standard Code for Information Interchange)
 Terdiri dari 00-FF yang Merepresentasikan karakter Text
 Data Numerik:
 Integer: 223
Asep HP Kesumajana  Real: 223.421
 Floating point: 2.23421000000+02 (16 digit)
 Umumnya data disimpan dalam format ASCII
GL-4101 Sistim Informasi Geologi 2

2. Struktur Data 2. Struktur Data

Contoh Grayscale format (BMP) Struktur Data

 2 MODEL DATA SPASIAL :

 RASTER Data Structures
 VECTOR Data Structures

GL-4101 Sistim Informasi Geologi 3 GL-4101 Sistim Informasi Geologi 4

2. Struktur Data

DIGITAL SPATIAL DATA Raster and Vector Data Models

• RASTER

Real World
600
1 2 3 4 5 6 7 8 9 10
• VECTOR 1
2
B
B
G
G G 500
Trees

3 B
400
4 BG G Trees
Y-AXIS
5 B G G 300
6 B G BK House
7 B 200

• Real World 8
9
B B
B
G
100
River

10 B 100 200 300 400 500 600

X-AXIS
Raster Representation Vector Representation
Source: Defense Mapping School Source: Defense Mapping School
GL-4101 Sistim Informasi Geologi 5
National Imagery and Mapping Agency National Imagery and Mapping Agency

2. Struktur Data 2. Struktur Data

Raster Data Sources Digital Orthophotograph

Air Photos
A scanned photograph that
has been mathematically
rectified to eliminate the
effects of displacement so
that its view always appears
as though it is perpendicular
to the ground.

Scanned Maps
Image
Copyright 1993 Nassau County, NY

GL-4101 Sistim Informasi Geologi 7 GL-4101 Sistim Informasi Geologi 8

Scanned Document

Data Raster

2. Struktur Data 2. Struktur Data

Raster Maps (images) RASTER DATA STRUCTURES

 Seri dari kolom dan baris (PIXEL= Picture
elements) dengan perbedaan tingkat
kecerahan dan intensitas (grey scale)
 Biasanya disimpan dalam Format
hexadecimal

 Kolom dan baris dari data raster membentuk

Citra (Gambar).

 Citra dapat memiliki nilai (atribut)

Source: Defense Mapping School
GL-4101 Sistim Informasi Geologi 11
National Imagery and Mapping Agency GL-4101 Sistim Informasi Geologi 12
2. Struktur Data 2. Struktur Data

SAR IMAGERY OF NE KALIMANTAN SAR IMAGERY OF NE KALIMANTAN

GL-4101 Sistim Informasi Geologi 13 GL-4101 Sistim Informasi Geologi 14

2. Struktur Data 2. Struktur Data

SAR IMAGERY OF NE KALIMANTAN SAR IMAGERY OF NE KALIMANTAN

GL-4101 Sistim Informasi Geologi 15 GL-4101 Sistim Informasi Geologi 16

2. Struktur Data 2. Struktur Data

The Appeal of Raster Simple Raster Arrays

 Looks like a paper map  Dimensi:
 Cheap and easy to produce (scan  E-W = jml kolom
existing paper chart)  N-S = jumlah baris
 Runs easily on PC  Setiap 1 kolom dan baris
 World-wide availability w/updates
(pixel) mewakili suatu
available jarak tertentu (minimum
mapping Unit/resolusi)
 Problems:
 Datum may or may not be WGS84
 Does not allow automated grounding
avoidance or any other computer-
aided analysis
 Storage not as efficient

Source: Defense Mapping School

GL-4101 Sistim Informasi Geologi 17
National Imagery and Mapping Agency GL-4101 Sistim Informasi Geologi 18

2. Struktur Data 2. Struktur Data

Batasan skala pada Raster Hubungan Spatial

 Data 1 1 1 1 1 1 1 1 4-connection 8-connection
1 2 2 1 1 2 2 1

1 1 1 1 1 1 1 1

3 3 1 1 3 3 1 1

1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1
1 1 1 2 2 2 1 1 1 1 1 1 2 2 2 1 1 1
1 1 1 1 2 2 1 1 1 1 1 1 1 2 2 1 1 1
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1
3 3 3 1 1 1 1 1 1 3 3 3 1 1 1 1 1 1
3 3 3 1 1 1 1 1 1 3 3 3 1 1 1 1 1 1
3 3 3 3 1 1 1 1 1 3 3 3 3 1 1 1 1 1
GL-4101 Sistim Informasi Geologi 19 GL-4101 Sistim Informasi Geologi 20
2. Struktur Data 2. Struktur Data

Tessellations Kompresi Data

 Gambaran geometri suatu bentuk dialam  Tuples
pada permukaan datar (Geometrical figures  Run Length encoded:
that completely cover a flat surface)  mengganti data dengan
pasangan data
 Regular Tesselations

 Chain Code
 merubah data menjadi
arah dgn jarak tertentu

GL-4101 Sistim Informasi Geologi 21 GL-4101 Sistim Informasi Geologi 22

2. Struktur Data 2. Struktur Data

Tuples (mengganti data dengan pasangan data) KODE RANGKAIAN (CHAIN CODES)
 Data pada baris ke 5: baris ke 7:  PEMBUATAN SATUAN PANJANG VEKTOR
 111122111 333111111 DENGAN ANGKA YANG MENCERMINKAN ARAH
 dirubah menjadi: (Model Freeman-Hoffman, Hoffman, 1974)
 (4 1) (2 2) (3 1) (3 3) (6 1)
 9 data menjadi 6 (66%) 9 data menjadi 4 (<50%)

1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1
1 1 1 2 2 2 1 1 1 1 1 1 2 2 2 1 1 1
1 1 1 1 2 2 1 1 1 1 1 1 1 2 2 1 1 1
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1
3 3 3 1 1 1 1 1 1 3 3 3 1 1 1 1 1 1
3 3 3 1 1 1 1 1 1 3 3 3 1 1 1 1 1 1
3 3 3 3 1 1 1 1 1 3 3 3 3 1 1 1 1 1

GL-4101 Sistim Informasi Geologi 23 GL-4101 Sistim Informasi Geologi 24

2. Struktur Data 2. Struktur Data

Chain Code MODEL HIRARKHI RASTER

 PEMBUATAN SATUAN PANJANG VEKTOR
DENGAN ANGKA YANG MENCERMINKAN ARAH
(Model Freeman-Hoffman, Hoffman, 1974)

3 2 1 0 0 0
2 6
4 0 42 6
4 4
5 6 7

GL-4101 Sistim Informasi Geologi 25 GL-4101 Sistim Informasi Geologi 26

2. Struktur Data 2. Struktur Data

Hierarchical Tesselation Irregular Tesselations

GL-4101 Sistim Informasi Geologi 27 GL-4101 Sistim Informasi Geologi 28

 2. Struktur Data

VECTOR
 Dibuat dari unsur (titik) yang berbeda:

 Dua titik mempunyai arti sebagai Garis

Data Vector
 Garis-garis dapat membentuk Rangkaian, Busur,
dan garis ganda.

 Rangkain garis dapat tertutup disebut Polygon

GL-4101 Sistim Informasi Geologi 30

2. Struktur Data

Structure of Vector Data Points

There is a certain amount of relationship between

vector data types. Sort of an inheritance, as each data
Points are zero dimensional objects which have
type is often dependent upon one another. When
representing geographic data in vector format, data is locations and attribute information but are too small
typically stored as:
 Points: points are zero dimensional objects, and
to be represented as areas.
represent geographic features such as wells, sample
locations, or trees. Point  Soil Samples  Spill Locations
Lines: lines represent one dimensional objects, or
Accident Number

linear features, such as road and stream centerlines.  Type 
Lines are made up of a series of interconnected points. Type of Spill
A line typically starts and end with a special point  PH 

called a node, and the points that make up the rest of  Extent
a line are called vertices. Line  Contaminants
Polygons/Area: polygons represent two dimensional  Parcel Centroids
Utility Poles

objects such as the boundaries of a field, or property, 
or the outline of a building or lake. Polygons are made  Section/Block/Lot No.
up of a series of connected lines where the starting  Owner  Address
point of a polygon is the same as the ending point.
 Height  Owner
Area  Attachments  Assessment Data

GL-4101 Sistim Informasi Geologi 31

 Trees Nodes

Nodes are zero dimensional objects, like

points, which have locations and attribute
information but are too small to be
represented as areas. They are a special
type of point in that they represent a
junction or end point of a line.

Lines or Arcs Lines or Arcs

 Street Centerline  Stream
 Street Name  Depth
 Address Ranges  Quality
 Water Main  Flow Rate
Lines are one dimensional objects  Pipe size
Pipe Material
which have length but no area. 

 Date Installed
Each line must begin and end at a
node.
Street Edge Areas

Areas are closed mathematical figures

of any shape or size. They are formed
by a series of connected lines.

Areas
Areas
 Parcel
 Parcel ID Number
 Dimensions and Area
 Soil Boundaries
 Type
 Permeability
 Flood Zones
Areas Vector Data
 An intelligent form of digital
geographic data where real world
objects are represented by points,
lines and polygons. An objects
representation is described by
attributes and coordinates.

 Examples include:
 Digitized Maps

 GIS Data

Source: Defense Mapping School

National Imagery and Mapping Agency

2. Struktur Data 2. Struktur Data

Paradigm Shift TRAVERSE MAP OF MENJELUTUNG AREA

510000 515000 520000 525000 530000

 May look “different” from a

paper map (software-
SESAYAP
415000 415000

SEMBAKUNG
SEM BAK UNG

dependent) S ES AY AP

 Underlying database allows

queries and layer selection SEMBAKUNG G .BATU

 Zooming reveals detail

410000 410000

0 1 2Km

 Complex, expensive, and

time-consuming to produce
405000 405000

515000 520000 525000 530000

GL-4101 Sistim Informasi Geologi Source: Defense Mapping School 43 GL-4101 Sistim Informasi Geologi 44
National Imagery and Mapping Agency
 2. Struktur Data 2. Struktur Data

TRAVERSE MAP OF MENJELUTUNG AREA TRAVERSE MAP OF MENJELUTUNG AREA

41000

40500

GL-4101 Sistim Informasi Geologi 45 GL-4101 Sistim Informasi Geologi 46

2. Struktur Data 2. Struktur Data

Linking Attributes and Graphics Linking Attributes with Graphics

In addition to Geography, GIS is  In this example, the

also about Information. A GIS user has issued a
marries the capabilities of query to select all the
computer mapping with database properties whose
management systems. So, a classification is single
geospatial analyst can “click” on family residential
a geographic feature and find out (210), and colored
information about it. Or, they the selection red.
can query the database to find
out information about all the
geographic objects that meet a
specific criteria.
Information about a geographic
object is called an attribute.

GL-4101 Sistim Informasi Geologi 47 GL-4101 Sistim Informasi Geologi 48

 2. Struktur Data

Vector Data is Layered Whole Polygon Structure

 Setiap Layer dibagi dalam set poligon
•• 2 •
Features:

setiap poligon mengacu pada lokasi batas

1
5 • Line
• Points: 
•
data dan tertutup (boundary loop)
4 Connected
•
Lake • Detached
7
• Area
6
••
setiap poligon disimpan tersendiri
Text

Spatial Data Analysis
 kadang kala sama dengan Chain Code (pada
raster)
30ø 30’ N 30ø 30’ N  setiap atribut poligon disimpan bersamaan
040ø 40’ E 040ø 50’ E dengan koordinatnya
Geographic data are separated
into themes, tiled for speed of  pengorganisasian menggunakan topology
access and placed on CD-ROM Network Analysis
Source: Defense Mapping School
National Imagery and Mapping Agency GL-4101 Sistim Informasi Geologi 50

2. Struktur Data 2. Struktur Data

TOPOLOGY
 RELASI SPASIAL ANTARA
OBYEK YANG BERHUBUNGAN
(CONNECTING) ATAU
BERDEKATAN (TITIK, GARIS,
SIMPUL/NODES, POLIGON)

GL-4101 Sistim Informasi Geologi 51 GL-4101 Sistim Informasi Geologi 52

 2. Struktur Data 2. Struktur Data

TOPOLOGY Cara kerja Topologi

 Topology represents the structuring of coordinate  every line starts and ends with a node, and has
intermittent shape points called vertices to
data which clearly describes adjacency, define the shape of the line or border.
containment, and connectivity.  lines don’t really exist. They simply represent a
relationship between two nodes and zero or
 GIS analysis answers many questions: 
more vertices.
When two lines cross, and form an intersection,
Node
 Where is it? they also have a node, since the intersection is
the start of one line and the end of the other
 What is it next to? line (remember the discussion of spaghetti and c
 Is it inside or outside discreet digitizing).
b
 How far is it from something else  Topology describes the connectivity of the lines a A B Line
and nodes. So for our example on the right,
lines A and B are connected by node b. So line
 The mathematical terms for these answers is: A goes from node a to node b. Line B goes
 Where is it? (location) from node b to node c.
Now, we can create a whole string of lines and
What is is next to (adjacency)

 put them together into an area too. Now, just
 Is it inside or outside (containment) like a line, polygons don’t really exist. They
simply represent the relationship among lines,
 How far is it (connectivity) which in turn represent the relationship among
points.
Polygon

GL-4101 Sistim Informasi Geologi 53 GL-4101 Sistim Informasi Geologi 54

2. Struktur Data 2. Struktur Data

How Topology Works Traversing Topology

 Without looking at the picture, you can
 Now we have described our location (with x,y answer these questions from the table:
coordinates), and our connectivity. What if we Where is node a.
had two polygons P1 and P2, could we define the
1 
1
P1
b  No problem. It has an x,y coordinate b
adjacency? Yes, here is how: P1
a  What polygon is P1 next to, and where are a
Line 1 goes from node a to node b. 2

they adjacent: 2
 Line 2 goes from node a to node b.
 P1 is next to P2 because Line 2 has polygon P1
 Line 3 goes from node b to node a. P2 to the left and P2 to the right. This is P2
 Polygon P1 is to the left of line 2, and to the right of adjacency.
line 1. 3 How do I traverse from node b, to node a,
 3
 Polygon P2 is to the right of line 2, and to the right and then back to node b:
of line 3.  Easy! Take line 3 to node a, and you have a
 So, we can create a table that “clearly describes choice to take either line 2 or 3 back to node b.
location, adjacency, connectivity and containment, Polygon Lines This is connectivity. Polygon Lines
or more specifically, a topology table. P1 1,2  What lines does polygon P1 fall inside of: P1 1,2
P2 2,3  Easy! Polygon P1 is contained by lines 1 and 2. P2 2,3
This is containment

Line FromNode ToNode LeftPolygon RightPolygon

1 a b 0 P1 Line FromNode ToNode LeftPolygon RightPolygon
2 a b P1 P2 1 a b 0 P1
3 b a 0 P2 2 a b P1 P2
3 b a 0 P2
GL-4101 Sistim Informasi Geologi 55 GL-4101 Sistim Informasi Geologi 56
 2. Struktur Data 2. Struktur Data

Topology – the big picture Contoh Topologi Polygon

i 1 ii 2 iii
 You probably want to know this has to do with digitizing.
When you are digitizing data for use in a GIS, you are
basically building a topological representation of the data 8
that we just talked about. vii 9 viii A 5 B 3
 Imagine if line 3 never connected to node a. Now we
don’t have a closed polygon. So, P2 cannot be created. 4 7
Or, what if line 2 was extended past node b (lets call it
1
 b iv 6 v 4 vi
line 4). Now, what is to the left and right of line 4? P1
Nothing. a 2 Line From Node To Node Lpoly Rpoly
 When you digitize, you need to be aware of these kinds
of errors. That’s why we talked earlier about letting the P2 1 i ii 0 A
software work for you. The software can either flag 2 ii iii 0 B
these errors, or perform some automatic snapping. 3 3 iii vi 0 B
These errors are called topological errors. 4 vi v 0 B
 To make your data work within a GIS, it should be 5 v ii A B
topologically clean, an free of errors.
6 v iv 0 B
7 iv vii 0 A
8 vii I 0 A
9 vii viii A A DANGLE ERROR
GL-4101 Sistim Informasi Geologi 57 GL-4101 Sistim Informasi Geologi 58

2. Struktur Data 2. Struktur Data

Contoh Topologi

Topology encoded in data

Polygon File ARC File

A Point File

Minimum of 3 Disk Accesses to Retrieve Object

GL-4101 Sistim Informasi Geologi 59 GL-4101 Sistim Informasi Geologi 60
2. Struktur Data 2. Struktur Data

MODEL HIRARKHI VEKTOR DIME Structure

 TINGKAT HUBUNGAN DARI FILE YANG  dibuat oleh U.S. Bureau of the Census
BERHUBUNGAN DENGAN FILE LAIN (Cooke dan Maxfield, 1967)
 informasi disusun berdasarkan topologi
 tidak langsung digunakan dalam GIS tapi
sebagai bentuk data untuk pertukaran data
pada sistim yang berbeda
 segmen garis dinyatakan sebagai dua titik
atau node
 setiap titik segmen garis digunakan
bersamaan dalam poligon
POLYgon conVERTer (Peucker & Chrisman, 1975)  busur disusun dari banyak segmen garis
GL-4101 Sistim Informasi Geologi 61 GL-4101 Sistim Informasi Geologi 62

2. Struktur Data 2. Struktur Data

DIME Structure
 tiap segmen garis memuat 3 komponen
utama:
 nama segmen
 identitas segmen
 identifikasi node "from" dan "to"
 Atribut tambahan dapat disertakan

 Kesulitan:
 melakukan manipulasi segmen yang kompleks

GL-4101 Sistim Informasi Geologi 63 GL-4101 Sistim Informasi Geologi 64

2. Struktur Data 2. Struktur Data

Arc-Node Structure Arc-Node Structure

 Database terstruktur secara hirarki  tidak terdapat redudancy (perulangan data)
 titik adalah komponen dasar dalam encoding geometri
 busur berupa individu segmen dengan satu  data titik disimpan satu kali saja
seri data xy  mudah menambahkan atribut data
 node adalah titik akhir dari busur atau
perpotongan 2 busur  atribut terlink ke geometri
 Bsnysk ketidak jelasan antara node pada titik
akhir garis dengan titik yang tidak
membentuk garis
 poligon adalah gabungan beberapa busur
 node dimiliki oleh busur dan poligon
GL-4101 Sistim Informasi Geologi 65 GL-4101 Sistim Informasi Geologi 66

2. Struktur Data 2. Struktur Data

Classes in ArcView)

GL-4101 Sistim Informasi Geologi 67 GL-4101 Sistim Informasi Geologi 68

2. Struktur Data 2. Struktur Data

Geodatabase Feature Model Relational Structure

 Represents geographic  topological data sama dengan Arc-node
information using standard
relational databases with
 perbedaan utama adalah: atribut disimpan
extensions. secara terpisah
Data is managed through

relational tables, and  atribut disimpan dalam database tersendiri
geographic objects can yang memiliki relasi terhadap topological
have integrity rules and
behavior datanya
 Example from unique
natural areas
 Feature datasets
 Feature classes
 Topology rules
 Relationships
GL-4101 Sistim Informasi Geologi 69 GL-4101 Sistim Informasi Geologi 70
© ESRI What is ArcGIS

2. Struktur Data 2. Struktur Data

Digital Line Graph Structure

 Didesign oleh U.S. Geological Survey
 dibagi dalam layer-layer tematik (Allder dan
Elasal, 1984)
 layer 1: informasi batas (termasuk politik dan
administratif)
 layer 2: hidrografik
 layer 3: jaringan transportasi
 layer 4: public land Survey System

GL-4101 Sistim Informasi Geologi 71 GL-4101 Sistim Informasi Geologi 72

2. Struktur Data 2. Struktur Data

Digital Line Graph Structure Digital Line Graph Structure

 Dalam DLG level 3 struktur sama dengan tiga  kode atribut didasarkan pada peta topografi USGS
struktur terakhir  kode atribut terstruktur secara spesifik dalam komponen
 node menunjukkan titik akhir garis atau perpotongan garis mayor maupun minor (Allder at. all, 1984)
 titik tambahan dapat ditambahkan dalam garis  kode mayor 3 digit, dua digit pertama katagori elemen
 garis memiliki node awal dan akhir secara general, digit ketiga elemen detail
 dapat diberikan arah khusus pada garis dan area di kiri dan  kode minor 4 digit, dengan digit pertama 0
kanan garis  DLG level 3 memiliki header record yang berisi
 degenerate line adalah garis dengan panjang 0 yang informasi:
digunakan untuk memberi atribut pada titik  tanggal pembuatan file
 degenerate line memiliki titik awal dan akhir sama  poyeksi peta dan sistim koordinat
 titik, garis dan area membutuhkan informasi topologi dan  jumlah titik, garis dan area dalam file
lokasi

GL-4101 Sistim Informasi Geologi 73 GL-4101 Sistim Informasi Geologi 74

2. Struktur Data 2. Struktur Data

Digital Line Graph Structure Digital Line Graph Structure

 data record untuk node berisi:  Major Code Category
 deskripsi (lokasi node), 020 Hypsography
 atribut mayor dan minor
 text string 050 Hydrography
 data record untuk area berisi: 070 Surface Cover
 deskripsi (lokasi koordinat titik),
 kode atribut  Minor Code Description
 text string
 data record untuk garis berisi: 001-099 nodes
 deskripsi (lokasi koordinat awal dan akhir node dan area 100-199 areas
dikir dan kanannya) 200-299 lines
 urutan koordinat xy sepanjang garis
 kode atribut 300-399 degenerate line
 text string 400-499 general-purpose code
600-699 descriptive code
GL-4101 Sistim Informasi Geologi 75 GL-4101 Sistim Informasi Geologi 76
2. Struktur Data 2. Struktur Data

Hydrography data Layer Hydrography data Layer

 nodes  Degenerate Lines
 050 0001 Upper end of stream  050 0300 Spring
 050 0004 Stream entering water body  050 0302 Flowing well
 050 0005 Stream leaving water body  General Purpose Attributes
 Areas  050 0400 Reservoir
 050 0101 Reservoir  050 0401 Falls
 050 0103 Glacier  050 0406 Dam or weir
 050 0106 Fish hatchery  General Descriptive Attributes
 Lines  050 0601 Underground
 050 0200 Shore line  050 0603 Elevated
 050 0201 Man-made shore line  050 0604 Tunnel

GL-4101 Sistim Informasi Geologi 77 GL-4101 Sistim Informasi Geologi 78

2. Struktur Data 2. Struktur Data

MODEL HIRARKHI VEKTOR Overlaying of photo interpretations (vector)

 TINGKAT HUBUNGAN DARI FILE YANG
BERHUBUNGAN DENGAN FILE LAIN

POLYgon conVERTer (Peucker & Chrisman, 1975)

GL-4101 Sistim Informasi Geologi 79 GL-4101 Sistim Informasi Geologi 80
2. Struktur Data 2. Struktur Data

Raster vs Vector RASTER vs VECTOR

Area easy not difficult

Location time consuming easy
Functional Entities difficult (particulary networks) easy
Data Volume large small
Editing easy (no many tools) easy
Spatial Operator easy difficult
Overlay easy (no concept of overlay) difficult (silver polygon)
Spatial Resolution constant variable (easy)
(difficult geographic features not constant)

Conversion to vector (complex) to raster (easy)

GL-4101 Sistim Informasi Geologi 81 GL-4101 Sistim Informasi Geologi 82

2. Struktur Data 2. Struktur Data

Raster vs Vector DATA LAYERS

 FORMAT UNTUK PENYIMPANAN DARI BERBAGAI DATA DALAM SIG

GL-4101 Sistim Informasi Geologi 83 GL-4101 Sistim Informasi Geologi 84

 2. Struktur Data

Vector Data is Layered DATA LAYERS

BERBAGAI SKALA &
1 •• 2 •
Features:
SUMBER DATA PERMUKAAN
5 • Line
• Points: & JUGA BAWAH PERMUKAAN
• 4 Connected
•
Lake • Detached
7
• Area
6
•• Text

Spatial Data Analysis

30ø 30’ N 30ø 30’ N

040ø 40’ E 040ø 50’ E
Geographic data are separated
into themes, tiled for speed of
access and placed on CD-ROM Network Analysis
Source: Defense Mapping School
National Imagery and Mapping Agency GL-4101 Sistim Informasi Geologi 86