LECTURE 3
Chee Yap
TIGER DATA SET

TIGER DATA SET


[Previous] [This] [Next]            [Top] [Bot]
Introduction


[Previous] [This] [Next]            [Top] [Bot]
TIGER Overview


[Previous] [This] [Next]            [Top] [Bot]
County Files


[Previous] [This] [Next]            [Top] [Bot]
Coordinate System


[Previous] [This] [Next]            [Top] [Bot]
TIGER Geometry.


[Previous] [This] [Next]            [Top] [Bot]
TIGER Polygons


[Previous] [This] [Next]            [Top] [Bot]
TABLE of FIELDS in TIGER FILES

The following Table summarizes important fields in Tiger files.

Record Type Field Name Field Position Description
TLID 6-15 TIGER/Line ID
RT 1 SIDE1 16 Single side? (blank = both sides, 1 = single side)
FRLONG 191-200 Start (from) longtitude
FRLAT 201-209 Start (from) latitude
(Basic info TOLONG 210-219 End (to) longtitude
for Lines) TOLAT 220-228 End (to) latitude
TLID 16-25 TIGER/Line ID (not all lines have an entry here
RT 2 RTSQ 16-18 Record Sequence Number (1, 2, etc)
LONG1 19-28 Start (from) longtitude of point 1
LAT1 29-37 Start (from) latitude of point 1
(Detail points LONG2 28-37 Start (from) longtitude of point 2
for Lines) LAT2 etc etc
RT A
(Basic info POLYID 6-15 Polygon ID
for Polygons)
RT I TLID 6-15 TIGER/Line ID
(Line-Polygon POLYIDL 27-36 Polygon ID on the left side
info) POLYIDR 42-51 Polygon ID on the right side
RT P POLYID 16-25 Polygon ID
(More info POLYLONG 26-35 Internal Point Longtitude
on Polygons) POLYLAT 36-44 Internal Point Latitude


[Previous] [This] [Next]            [Top] [Bot]
Issues

Exercises

 
Exercise 3.1:
 Write a Java program to pull out all Tiger Lines and Polygons that lie within some longitude/latitute range.
 
Exercise 3.2:
 Derive formulae for the projections discussed above:
(a) stereographic projection with respect to a point p0,
(b) cylindrical projection.
 
Exercise 3.3:
 (a) Write a program which, given a computer file directory (storing all the Tiger files for a single county), will extract the minimum bounding box (in terms o longitude/latitude) for the county.
(b) Construct a data base for the entire USA storing a minimum bounding box for each county.
(c) Using this, write a program to construct a list of all the counties that (potentially) intersects a given longitude/latitute range.
 
Exercise 3.4:
 Write a program for checking the topological consistency of the data in (a) a single Tiger county, and (b) in several Tiger counties. Basically we need to check that the endpoints of Tiger Lines are consistent.
 
Exercise 3.5:
 Write a program which, given a directory storing the Tiger files for a single county, and a postal address, will compute and determine the longitude/latitude of a point near this address. Extra credit: also extract the zip code.
 


[Go To Top]




File translated from TEX by TTH, version 3.01.
On 27 Nov 2001, 13:57.