I/O-efficient map overlay and point location in low-density subdivisions

M. Berg, de, H.J. Haverkort, S. Thite, L. Toma

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademic

103 Downloads (Pure)

Abstract

We present improved and simplified i/o-efficient algorithms for two problems on planar low-density subdivisions, namely map overlay and point location. More precisely, we show how to preprocess a lowdensity subdivision with n edges in O(sort(n)) i/o’s into a compressed linear quadtree such that one can: (i) compute the overlay of two such preprocessed subdivisions in O(scan(n)) i/o’s, where n is the total number of edges in the two subdivisions, (ii) answer a single point location query in O(logB n) i/o’s and k batched point location queries in O(scan(n) + sort(k)) i/o’s. For the special case where the subdivision is a fat triangulation, we show how to obtain the same bounds with an ordinary (uncompressed) quadtree, and we show how to make the structure fully dynamic using O(logB n) i/o’s per update. Our algorithms and data structures improve on the previous best known bounds for general subdivisions both in the number of i/o’s and storage usage, they are significantly simpler, and several of our algorithms are cache-oblivious.
Original languageEnglish
Title of host publicationCollection of Abstracts of the 23rd European Workshop on Computational Geometry (EWCG 2007) 19-21 March 2007, Graz, Austria
EditorsO. Aichholzer, T. Hackl
Place of PublicationGraz, Austria
PublisherVerlag der Technischen Universität Graz
Pages73-76
ISBN (Print)978-3-902465-62-7
Publication statusPublished - 2007
Eventconference; EWCG 2007, Graz, Austria; 2007-03-19; 2007-03-21 -
Duration: 19 Mar 200721 Mar 2007

Conference

Conferenceconference; EWCG 2007, Graz, Austria; 2007-03-19; 2007-03-21
Period19/03/0721/03/07
OtherEWCG 2007, Graz, Austria

Fingerprint Dive into the research topics of 'I/O-efficient map overlay and point location in low-density subdivisions'. Together they form a unique fingerprint.

Cite this