Principles of GIS( UNSW Metternicht )

outline:data input---data management---data manipulation+data analysis---spatial modelling

Definition

1. GIS is a tool to digitally abstract the real world, information is connected to its physical location and organized into layers.

2. a GIS consists at least information database( with attribute ), map information, computer-based link between them.

GIS storement

1. people manage database information by layer or theme

2. a value can be a number or a text

type of data( vector矢量 raster栅格)

1. spatial data (空间数据): has location information, giving the information about where is it, can be mapped, spatial data models begin with conceptualization, how you will represent the real world phenomena or entities( road, river, etc.), which is the objects in a spatial database plus the relationships among them.

2. attribute data: giving the information about what is it.

3. topology(拓扑): what related to this feature

attribute data

1. nominal attributes: provide descriptive information about an object (for example, colors、city names or vegetation type), which can also be images, audios or other kinds of descriptive information.

2. ordinal attributes: imply rank order or scale by their values ( for example, small、medium、large, ranking from 1 to 10 ).

3. interval or ratio attributes: are used for numeric items where both order and difference in magnitudes( 量级 ) are reflected in number( real number in a linear scale, for example: height、weight, etc.)

data model concept

1. vector data model: discrete objects (point,lines)

2. raster data model: continuous phenomena (use grid cells)

vector data model

1. point: to represent the location

2. line: to represent linear features

3. polygon: represents entities which covers an area

raster data model (cells)

rasters are digital aerial photographs, imagery from satellites, digital pictures, or even scanned maps

TIN data model---tesselations (Triangulated Irregular Network)

1. TIN is a data model commonly used to represent terrain (地势) heights, which will be describes as x,y, and z locations.

2. TIN used for digital elevation models (DEM) or digital terrain models (DTM).

vector data

1. can be multipart

2. polygons can have holes

3. holes can contain islands

4. can overlap

vector model

the direction of a line is determined by the order of its vertices (制高点)

polygon exteriors  (外观) are stored in an anticlockwise(逆时针) order

顺时针方向为内孔方向(Internal holes)

total area of the polygon areas is the sum of the part areas

raster data

a cell’s coordinate is inferred from its file order, the cell size and corner coordinates (坐标)

nodata means the value is not known or is not relevant

Lecture 1的更多相关文章

  1. [C2P3] Andrew Ng - Machine Learning

    ##Advice for Applying Machine Learning Applying machine learning in practice is not always straightf ...

  2. note of introduction of Algorithms(Lecture 3 - Part1)

    Lecture 3(part 1) Divide and conquer 1. the general paradim of algrithm as bellow: 1. divide the pro ...

  3. codeforces 499B.Lecture 解题报告

    题目链接:http://codeforces.com/problemset/problem/499/B 题目意思:给出两种语言下 m 个单词表(word1, word2)的一一对应,以及 profes ...

  4. Nobel Lecture, December 12, 1929 Thermionic phenomena and the laws which govern them

    http://www.nobelprize.org/nobel_prizes/physics/laureates/1928/richardson-lecture.pdf OWEN W. RICHARD ...

  5. Jordan Lecture Note-1: Introduction

    Jordan Lecture Note-1: Introduction 第一部分要整理的是Jordan的讲义,这份讲义是我刚进实验室时我们老师给我的第一个任务,要求我把讲义上的知识扩充出去,然后每周都 ...

  6. Jordan Lecture Note-3: 梯度投影法

    Jordan Lecture Note-3:梯度投影法 在这一节,我们介绍如何用梯度投影法来解如下的优化问题: \begin{align} \mathop{\min}&\quad f(x)\n ...

  7. Jordan Lecture Note-2: Maximal Margin Classifier

    Maximal Margin Classifier Logistic Regression 与 SVM 思路的不同点:logistic regression强调所有点尽可能远离中间的那条分割线,而SV ...

  8. [CF Round #294 div2] E. A and B and Lecture Rooms 【树上倍增】

    题目链接:E. A and B and Lecture Rooms 题目大意 给定一颗节点数10^5的树,有10^5个询问,每次询问树上到xi, yi这两个点距离相等的点有多少个. 题目分析 若 x= ...

  9. Codeforces Round #287 D.The Maths Lecture

    The Maths Lecture 题意:求存在后缀Si mod k =0,的n位数的数目.(n <=1000,k<=100); 用f[i][j]代表 长为i位,模k等于j的数的个数. 可 ...

  10. Lecture Halls

    Lecture Halls (会议安排)   时间限制(普通/Java):1000MS/10000MS     运行内存限制:65536KByte 总提交: 38            测试通过: 2 ...

随机推荐

  1. 045 Jump Game II 跳跃游戏 II

    给定一个非负整数数组,你最初位于数组的首位.数组中的每个元素表示你在该位置的最大跳跃长度.你的目标是用最小跳跃次数到达最后一个索引.例如: 给定一个数组 A = [2,3,1,1,4]跳到最后一个索引 ...

  2. 《springcloud 一》搭建注册中心,服务提供者,服务消费者

    注册中心环境搭建 Maven依赖信息 <parent> <groupId>org.springframework.boot</groupId> <artifa ...

  3. Web可用性设计的247条指导方针

    首页可用性设计 首页元素要清晰的关注用户的关键任务(避免“增加功能倾向(featuritis)”) 如果网站比较大,那么首页应包含搜索输入框 首页要十分清楚的提供产品(内容)分类 在首页或首页内一次点 ...

  4. 死磕 java并发包之LongAdder源码分析

    问题 (1)java8中为什么要新增LongAdder? (2)LongAdder的实现方式? (3)LongAdder与AtomicLong的对比? 简介 LongAdder是java8中新增的原子 ...

  5. JVM垃圾回收机制四

    GCRoots与可达性分析 Java中的四种引用 强引用.软引用.弱引用.虚引用.这四种引用的强度是逐渐减弱的,JVM垃圾回收的力度是逐渐增强的. 四种引用的作用 1.可以让程序员通过代码来控制对象的 ...

  6. 洛谷P2062 分队问题(dp)

    题意 题目链接 给定n个选手,将他们分成若干只队伍.其中第i个选手要求自己所属的队伍的人数大等于a[i]人. 在满足所有选手的要求的前提下,最大化队伍的总数. 注:每个选手属于且仅属于一支队伍. So ...

  7. java 使用uuid生成唯一字符串

    UUID(Universally Unique Identifier)全局唯一标识符,是指在一台机器上生成的数字,它保证对在同一时空中的所有机器都是唯一的.按照开放软件基金会(OSF)制定的标准计算, ...

  8. 枚举转List

    将枚举值转为list (name,value) 的形式 /// <summary> /// 获取口味 /// </summary> /// <returns>< ...

  9. uvm_reg_file——寄存器模型(十四)

    有了uvm_reg_field, uvm_reg, uvm_block, 也许我们需要跟大的uvm_file,这就是传说中的寄存器堆. // // CLASS: uvm_reg_file // Reg ...

  10. hadoop的shell总结

    ls命令(文件内容) 列出系统跟目录下的目录和文件 Hadoop fs -ls / 列出文件系统所有的目录和文件 Hadoop fs -ls -R / cat命令(列出文档内容) Hadoop fs ...