Geometric modeling
Computational geometry: an introduction
Computational geometry: an introduction
Computer graphics: principles and practice (2nd ed.)
Computer graphics: principles and practice (2nd ed.)
Computational Geometry: Theory and Applications
A generic solution to polygon clipping
Communications of the ACM
A new, fast method for 2D polygon clipping: analysis and software implementation
ACM Transactions on Graphics (TOG)
Computational geometry in C
Efficient clipping of arbitrary polygons
ACM Transactions on Graphics (TOG)
An analysis and algorithm for polygon clipping
Communications of the ACM
Communications of the ACM
Delaunay Triangulation Using a Uniform Grid
IEEE Computer Graphics and Applications
Polygon comparison using a graph representation
SIGGRAPH '80 Proceedings of the 7th annual conference on Computer graphics and interactive techniques
An algorithm for polygon clipping, and for determining polygon intersections and unions
Computers & Geosciences
A simple algorithm for Boolean operations on polygons
Advances in Engineering Software
| Hi-index | 0.00 |
This paper presents an efficient algorithm for clipping points, arcs and polygons, which is a common operation in geographic information system (GIS). By incorporating the sweep-line technique in the proposed algorithm, the involved polygons are decomposed into a collection of trapezoidal meshes. In this way, the clipping operation between the to-be-clipped point, arc, polygon features and the subject polygons is transformed into an operation between points, arcs and the decomposed trapezoidal meshes, which is much easier to implement. Experimental results demonstrate that the algorithm is computational efficient comparing to the existing methods, especially when the input data contain a large number of polygons. In addition, the amount of storage space required is moderate. Furthermore, this algorithm is very flexible and able to handle concave polygons and those with holes.