By Topic

An Extreme Algorithm for Network-Topology Construction Based on Constrained Delaunay Triangulation

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Nguyen Minh Nam ; GIS Dept., Dolsoft Co., Ho Chi Minh City, Vietnam ; Le Hoai Bac ; Nguyen Vinh Nam

This paper presents a fast algorithm for network topology construction. The algorithm works in two phases: input analyzing, and topology construction. In the first phase, inconsistencies in input are solved based on constrained Delaunay triangulation. The second phase consists of two parts:the sorting edges construction, and establish the topology relationship. The time of the first part highly depends on the input data distribution, and the second part, which presents our solution, runs in O(N log N), what is confirmed by experiments using real data from geographic database.

Published in:

Knowledge and Systems Engineering, 2009. KSE '09. International Conference on

Date of Conference:

13-17 Oct. 2009