| | |
| | |
Stat |
Members: 3643 Articles: 2'487'895 Articles rated: 2609
28 March 2024 |
|
| | | |
|
Article overview
| |
|
Clipping of Arbitrary Polygons with Degeneracies | Erich L Foster
; James R Overfelt
; | Date: |
12 Nov 2012 | Abstract: | Polygon clipping is a frequent operation in Arbitrary Lagrangian-Eulerian
methods, Computer Graphics, GIS, and CAD. In fact, clipping algorithms are said
to be one of the most important operations in computer graphics. Thus,
efficient and general polygon clipping algorithms are of great importance.
Greiner et al. developed a time efficient algorithm which could clip arbitrary
polygons, including concave and self intersecting polygons. However, the
Greiner-Hormann algorithm does not properly handle degenerate cases, without
the undesirable need for perturbing vertices. We present an extension to the
Greiner-Hormann polygon clipping algorithm which properly deals with degenerate
cases. We combine the method proposed by Kim et al. and the method mentioned by
Liu et al. to remove or properly label degenerate cases. Additionally, the
algorithm presented avoids the need for calculating midpoints, doesn’t require
additional entry/exit flags, and avoids changing the vertex data structure used
in the original Greiner-Hormann algorithm, which was required by the extension
presented by Kim et al. | Source: | arXiv, 1211.3376 | Services: | Forum | Review | PDF | Favorites |
|
|
No review found.
Did you like this article?
Note: answers to reviews or questions about the article must be posted in the forum section.
Authors are not allowed to review their own article. They can use the forum section.
browser claudebot
|
| |
|
|
|
| News, job offers and information for researchers and scientists:
| |