Please use this identifier to cite or link to this item: http://hdl.handle.net/1942/603
Title: Efficient on-line topological simplification of network-like data
Authors: GEERTS, Floris 
REVESZ, Peter
VAN DEN BUSSCHE, Jan 
Issue Date: 2000
Abstract: We describe an efficient on-line algorithm to simplify network-like data with the goal of speeding up path queries on these data. Our algorithm is on-line in that it reacts to updates on the data, keeping the simplification up-to-date. The supported updates are insertions of vertices and edges; hence, our algorithm is semi-dynamic. We provide both analytical and empirical evaluations of the efficiency of our approach. Specifically, we prove an 0(log m) upper bound on the amortized time complexity of our maintenance algorithm, with m the number of edges. We also show that the overhead due to maintenance is negligible using real data, and illustrate the improved performance on shortest path queries over the same data.
Document URI: http://hdl.handle.net/1942/603
Category: O
Type: Preprint
Appears in Collections:Research publications

Files in This Item:
File Description SizeFormat 
simplify.pdf323.22 kBAdobe PDFView/Open
Show full item record

Page view(s)

6
checked on May 24, 2022

Download(s)

6
checked on May 24, 2022

Google ScholarTM

Check


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.