๋ณธ๋ฌธ ๋ฐ”๋กœ๊ฐ€๊ธฐ
๐ŸŽ“ ๊ฒฝํฌ๋Œ€ํ•™๊ต Archive/๐Ÿ“– ํ•™๊ต์ƒํ™œ

Spatial Data Models - Vector

by Young's Th!nkTech 2024. 9. 8.

What are spaital data models?

๊ณต๊ฐ„ ๋ฐ์ดํ„ฐ๋ž€ ๋ฌด์—‡์ธ๊ฐ€?


Two method are used to represent geographic features in computer databases:

Vector data model and raster data model

๋ฒกํ„ฐ ๋ฐ์ดํ„ฐ ๋ชจ๋ธ ๋ฐ ๋ ˆ์Šคํ„ฐ ๋ฐ์ดํ„ฐ ๋ชจ๋ธ ๋‘๊ฐ€์ง€๊ฐ€ ์‚ฌ์šฉ๋œ๋‹ค.

Vector, Raster

Vector

Vector data model 

The vector data structure uses points, lines, and polygons to represent spatial features. 

๋ฒกํ„ฐ ๋ฐ์ดํ„ฐ๋Š” ์ , ์„ , ๋ฉด์„ ์‚ฌ์šฉํ•˜์—ฌ ๊ณต๊ฐ„ ์‚ฌ์ƒ์„ ๋‚˜ํƒ€๋‚ธ๋‹ค. 

 - each geometric object becomes an individual reference unit. 

 1) point ์ 

 - Projected points are adressed using simple coordinates. 

  ์ ์€ ๋‹จ์ˆœ ์ขŒํ‘œ๋ฅผ ์‚ฌ์šฉํ•˜์—ฌ ๋‚˜ํƒ€๋‚ธ๋‹ค.

 2) lines ์„ 

 - One dimensinonal features that have both location and length properties

  ์œ„์น˜์™€ ๊ธธ์ด ์†์„ฑ์„ ๊ฐ€์ง„ 1์ฐจ์› ๊ฐ์ฒด

 - All lines have a minimum of two points, a beginning and an ending point, often referred to as nodes.

  ๋ชจ๋“  ์„ ์—๋Š” ์ตœ์†Œ 2๊ฐœ์˜ ์ , ์ฆ‰ ์‹œ์ž‘์ ๊ณผ ๋์ ์ด ์žˆ์œผ๋ฉฐ, ์ด๋ฅผ ๋…ธ๋“œ๋ผ๊ณ  ํ•จ. 

 - More nodes may be placed between the beginning and ending nodes to give shape to the line. 

  3) polygons(or areas) ๋ฉด

 - Two dimensional objects bounded by a continous line

  ์„ ์ด ์—ฐ์†์ ์œผ๋กœ ๋‘˜๋Ÿฌ์Œ“์ธ 2์ฐจ์› ๊ฐ์ฒด

 - Have both size and perimeter properties 

  ํฌ๊ธฐ์™€ ๋‘˜๋ ˆ ์†์„ฑ์„ ๋ชจ๋‘ ๊ฐ€์ง€๊ณ  ์žˆ์Œ. 

 

์ , ์„ , ๋ฉด ๋ฐ์ดํ„ฐ

Spaghetti Data Model 

Simplest vector data structure that represents each point, line, or polygon feature as a string of (x, y) coordinate pairs with no inherent structure.

๊ฐ ์ , ์„ , ๋ฉด ๊ฐ์ฒด๋ฅผ ๊ณ ์œ ํ•œ ๊ตฌ์กฐ๊ฐ€ ์—†๋Š” ์ขŒํ‘œ ๋ฌธ์ž์—ด๋กœ ๋‚˜ํƒ€๋‚ด๋Š” ๊ฐ€์žฅ ๊ฐ„๋‹จํ•œ ๋ฒกํ„ฐ ๋ฐ์ดํ„ฐ ๊ตฌ์กฐ์ž„.

Vector data composed of simple lines with no topology and usually no attributes.

์œ„์ƒ์ด ์—†๊ณ , ์ผ๋ฐ˜์ ์œผ๋กœ ์†์„ฑ์ด ์—†๋Š” ๋‹จ์ˆœํ•œ ์„ ์œผ๋กœ ๊ตฌ์„ฑ๋œ ๋ฒกํ„ฐ ๋ฐ์ดํ„ฐ

Spaghetti lines may cross, but no intersections are created at those crossings. 

์ŠคํŒŒ๊ฒŒํ‹ฐ ์„ ์€ ๊ต์ฐจ ํ•  ์ˆ˜ ์žˆ์ง€๋งŒ, ํ•ด๋‹น ๊ต์ฐจ์ ์—์„œ ๊ต์ฐจ์ ์€ ์ƒ์„ฑ๋˜์ง€ ์•Š์Œ.

 

์„ ํ˜• ๋ฐ์ดํ„ฐ๋ฅผ ์ƒ์„ฑํ•˜๊ณ  ๊ด€๋ฆฌํ•˜๊ธฐ ์œ„ํ•ด ์ดˆ๊ธฐ์— ์ ์šฉ๋˜์—ˆ๋˜ ๋ฒกํ„ฐ ๋ฐ์ดํ„ฐ ๋ชจ๋ธ์ด๋‹ค.

์ŠคํŒŒ๊ฒŒํ‹ฐ ๋ชจ๋ธ์—์„œ๋Š” ๊ฐ๊ฐ์˜ ๋ฒกํ„ฐ ๋ผ์ธ๋“ค์„ ๋ณ„๋„๋กœ ์ €์žฅ, ๊ด€๋ฆฌ 

๋ผ์ธ์ด ํ•œ ์ ์—์„œ ๊ต์ฐจํ•˜๊ฑฐ๋‚˜ ๋ ์ ์œผ๋กœ ๋งŒ๋‚œ๋‹คํ•ด๋„ ๊ฐ ์„ ๋ถ„๋“ค๊ฐ„์˜ ์—ฐ๊ฒฐ์„ ๊ธฐ๋กํ•˜๊ฑฐ๋‚˜ ๊ด€๊ณ„๋ฅผ ์„ค์ •ํ•˜์ง€ ์•Š์Œ.

ํด๋ฆฌ๊ณค์˜ ๊ฒฝ๊ณ„์„ ์ด ๊ณต์œ ๋˜๋Š” ๊ฒฝ์šฐ์—๋„ ๋‘ ๋ฒˆ์”ฉ ๋ฐ˜๋ณตํ•ด์„œ ์ €์žฅ

ํ† ํด๋กœ์ง€์— ๋Œ€ํ•œ ๊ด€๊ณ„๋Š” ํ˜•์„ฑ๋˜์ง€ ์•Š๋Š” ๋ชจ๋ธ์ž„

๋ผ์ธ์ด ๊ต์ฐจํ•ด๋„ ์—ฐ๊ฒฐ๋˜๋Š” ์ ‘์ ์ด๋‚˜ ๊ต์ฐจ์ ์ด ์ƒ์„ฑ๋˜์ง€ ์•Š์Œ.

No topological information; polygons that lie adjacent to each other must be made up of their lines.

No explicit encoding of spatial relationships

Requires complex calculations for advanced analytical techniques

๊ณ ๊ธ‰ ๋ถ„์„๊ธฐ์ˆ ์„ ์œ„ํ•ด์„œ๋Š” ๋ณต์žกํ•œ ๊ณ„์‚ฐ์ด ํ•„์š”ํ•จ

Can be efficient for managing and reproducing maps as it is unnecessary to use topological information for this purpose

์ด ๋ชฉ์ ์„ ์œ„ํ•ด ํ† ํด๋กœ์ง€ ์ •๋ณด๋ฅผ ์‚ฌ์šฉํ•  ํ•„์š”๊ฐ€ ์—†์œผ๋ฏ€๋กœ ์ง€๋„๋ฅผ ๊ด€๋ฆฌํ•˜๊ณ  ์žฌ์ƒ์‚ฐํ•˜๋Š”๋ฐ ๋” ํšจ์œจ์ ์ผ ์ˆ˜ ์žˆ์Œ

 

Topological Data Model 

์œ„์ƒ | ไฝ็›ธ | topology

๊ณต๊ฐ„ ์ƒ์—์„œ ๊ฐ์ฒด๋“ค๊ฐ„์˜ ๊ด€๊ณ„๋ฅผ ์„ค๋ช…ํ•˜๋Š” ๊ฒƒ

๊ณต๊ฐ„์  ๊ด€๊ณ„๋ž€, ๊ฐ ๊ฐ์ฒด์˜ ์œ„์น˜๋ฅผ ์ขŒํ‘œ๊ฐ’์œผ๋กœ ์ธ์‹ํ•˜๊ณ , ๋Œ€์ƒ ๊ฐ์ฒด์˜ ๊ด€๊ณ„๋ฅผ ์ƒ๋Œ€์  ์œ„์น˜์— ๋”ฐ๋ผ ์ธ์ ‘์„ฑ(adjacency), ์—ฐ๊ฒฐ์„ฑ(connectivity) ๋ฐ ํฌํ•จ(containment)์˜ ๊ด€๊ณ„ ๋“ฑ์„ ์ •์˜

 

ํ† ํด๋กœ์ง€๋Š” ๊ฐ ์‚ฌ์ƒ์ด ์–ด๋–ป๊ฒŒ ์—ฐ๊ฒฐ๋˜์–ด ์žˆ๋Š”์ง€, ๊ทธ ๊ตฌ์กฐ๋ฅผ ๋งํ•จ.

 

Topology information is often used to detect errors in spatial data.

ํ† ํด๋กœ์ง€ ์ •๋ณด๋Š” ๊ณต๊ฐ„ ๋ฐ์ดํ„ฐ์˜ ์˜ค๋ฅ˜๋ฅผ ๊ฐ์ง€ํ•˜๋Š”๋ฐ ์ž์ฃผ ์‚ฌ์šฉ