dc.contributor.author | Arge, Lars | |
dc.contributor.author | Vengroff, Darren Erik | |
dc.contributor.author | Vitter, Jeffrey Scott | |
dc.date.accessioned | 2011-03-21T16:49:42Z | |
dc.date.available | 2011-03-21T16:49:42Z | |
dc.date.issued | 1996-09 | |
dc.identifier.citation | L. Arge, D. E. Vengroff, and J. S. Vitter. “External-Memory Algorithms for Processing Line Segments in Geographic Information Systems,” Algorithmica, 47(1), January 2007, 1–25. An extended abstract appears in Proceedings of the 3rd Annual European Symposium on Algorithms (ESA ’95), Corfu, Greece, September 1995, published in Lecture Notes in Computer Science, 979, Springer, Berlin, Germany, 295–310. http://dx.doi.org/10.1007/s00453-006-1208-z | |
dc.identifier.uri | http://hdl.handle.net/1808/7200 | |
dc.description | The original publication is available at www.springerlink.com | |
dc.description.abstract | In the design of algorithms for large-scale applications it is essential to consider the problem
of minimizing I/O communication. Geographical information systems (GIS) are good examples
of such large-scale applications as they frequently handle huge amounts of spatial data. In this
paper we develop e cient new external-memory algorithms for a number of important problems
involving line segments in the plane, including trapezoid decomposition, batched planar point
location, triangulation, red-blue line segment intersection reporting, and general line segment
intersection reporting. In GIS systems, the rst three problems are useful for rendering and
modeling, and the latter two are frequently used for overlaying maps and extracting information
from them. | |
dc.language.iso | en_US | |
dc.publisher | Springer Verlag | |
dc.title | External-Memory Algorithms for Processing Line Segments in Geographic Information Systems | |
dc.type | Article | |
kusw.kuauthor | Vitter, Jeffrey Scott | |
kusw.oastatus | fullparticipation | |
dc.identifier.doi | 10.1007/s00453-006-1208-z | |
kusw.oaversion | Scholarly/refereed, author accepted manuscript | |
kusw.oapolicy | This item meets KU Open Access policy criteria. | |
dc.rights.accessrights | openAccess | |