A rapid algorithm for topology construction from a set of line segments

Authors:
Sebastian Krivograd;Mladen Trlep;Borut Žalik
Affiliations:
Faculty of Electrical Engineering and Computer Science, University of Maribor, Maribor, Slovenia;Faculty of Electrical Engineering and Computer Science, University of Maribor, Maribor, Slovenia;Faculty of Electrical Engineering and Computer Science, University of Maribor, Maribor, Slovenia
Venue:
TELE-INFO'06 Proceedings of the 5th WSEAS international conference on Telecommunications and informatics
Year:
2006

Citing 3
Cited 1

On the complexity of point-in-polygon algorithms

Computers & Geosciences
Computational geometry: algorithms and applications

Computational geometry: algorithms and applications
Optimal Expected-Time Algorithms for Closest Point Problems

ACM Transactions on Mathematical Software (TOMS)

Constructing and modeling parcel boundaries from a set of lines for querying adjacent spatial relationships

ICCSA'13 Proceedings of the 13th international conference on Computational Science and Its Applications - Volume 1

Quantified Score

Hi-index	0.00

Visualization

Abstract

An efficient algorithm for topology construction from a set of line segments is considered in the paper. The algorithm works in two steps: input analyzing, and topology construction. In the first step, inconsistencies in input are solved. The second step consists of two parts: the envelope construction, and determination of neighbouring relations between the obtained neighbouring The time complexity of the first part highly depends on the input data distribution, and the second part, which presents our original work, runs in O(n), what is confirmed by experiments using artificial input and real data from geographic database.