Computational Geometry: Algorithms and Applications
Computational Geometry: Algorithms and Applications
An Extreme Algorithm for Network-Topology Construction Based on Constrained Delaunay Triangulation
KSE '09 Proceedings of the 2009 International Conference on Knowledge and Systems Engineering
A rapid algorithm for topology construction from a set of line segments
TELE-INFO'06 Proceedings of the 5th WSEAS international conference on Telecommunications and informatics
Hi-index | 0.00 |
Geometrically, parcel boundaries are represented by polygons. Unfortunately, they are induced by a set of lines in some drawings (for example, CAD). In this article, we present an algorithm that polygonizes quickly and precisely a set of lines and stores the resulting polygons as well as adjacency relationships in a topological model. These pre-calculated topological relationships are efficient for basic functions, such as parcel division and parcel merge, in land parcel exploitation and management systems. Our algorithm is simple and easy to implement.