DocumentCode
3534246
Title
Buffer generation using Spherical Geometry
Author
Dayal, Abhinav
Author_Institution
IDV Solutions Inc.
Volume
5
fYear
2009
fDate
12-17 July 2009
Abstract
Buffering is an important area of spatial analysis in GIS applications. The goal of buffering is to determine a neighborhood around a certain point, line or polygon feature based on some constant or variable distance measure. Major challenges for buffer computation are accuracy and computational complexity. Popular buffer generation algorithms use parallel lines for emulating fixed distance. While this may be true for small distances on surface of earth, but for large distances the lines curve along the spherical surface of the earth. We generate buffer with aid of spherical geometric computations. We reduce the set of line segments for intersection by using a conjoining line segment buffer approach and derive the final buffer by a linear point traversal over all the resulting points. We also use extended concavity tests to address the problem where large buffer size would cause buffer lines corresponding to successive concave input line segments to not intersect.
Keywords
computational complexity; computational geometry; geographic information systems; GIS; buffer generation algorithms; computational complexity; concave input line segments; conjoining line segment buffer approach; extended concavity tests; linear point traversal; parallel lines; spherical geometric computations; spherical geometry; variable distance measure; Computational complexity; Computational geometry; Concurrent computing; Earth; Filtering; Geographic Information Systems; Testing; Buffering; GIS; Spatial Filtering; Spherical Geometry;
fLanguage
English
Publisher
ieee
Conference_Titel
Geoscience and Remote Sensing Symposium,2009 IEEE International,IGARSS 2009
Conference_Location
Cape Town
Print_ISBN
978-1-4244-3394-0
Electronic_ISBN
978-1-4244-3395-7
Type
conf
DOI
10.1109/IGARSS.2009.5417695
Filename
5417695
Link To Document