Topic
Sutherland–Hodgman algorithm
About: Sutherland–Hodgman algorithm is a research topic. Over the lifetime, 2 publications have been published within this topic receiving 1 citations.
Papers
Journal Article•
TL;DR: The correctness and the advantage of the advanced algorithm is proved in theory and simulation results show that theAdvanced algorithm can achieve the purpose of reducing the number of operations and avoiding the repetitive primitives.
Abstract: The Classic Sutherland-Hodgman clipping algorithm has redundancy and may output repetitive primitives which can cause unnecessary scanning.By adding the necessary judgments and the exports in the round-robins,an advanced algorithm is proposed to improve the classical algorithm.In this paper the correctness and the advantage of the advanced algorithm is proved in theory.Simulation results show that the advanced algorithm can achieve the purpose of reducing the number of operations and avoiding the repetitive primitives.
2 citations
IBM1
TL;DR: New techniques that detect such constellations and simplify the input polygon such that the Sutherland-Hodgman algorithm runs more efficiently are presented.
Abstract: Polygon clipping is a central part of image generation and image visualization systems. In spite of its algorithmic simplicity it consumes a considerable amount of hardware or software resources. Polygon clipping performance is dominated by two processes: intersection calculations and data transfers.
The paper analyzes the prevalent Sutherland-Hodgman algorithm for polygon clipping and identifies cases for which this algorithm performs inefficiently. Such cases are characterized by subsequent vertices in the input polygon that share a common region, e.g. a common halfspace.
The paper will present new techniques that detect such constellations and simplify the input polygon such that the Sutherland-Hodgman algorithm runs more efficiently. Block diagrams and pseudo-code demonstrate that the new techniques are well suited for both hardware and software implementations.
Finally, the paper discusses the results of a prototype implementation of the presented techniques. The analysis compares the performance of the new techniques to the traditional Sutherland-Hodgman algorithm for different test scenes. The new techniques reduce the number data transfers by up to 90% and the number of intersection calculations by up to 60%.
Performance Metrics
| Year | Papers |
|---|---|
| 2013 | 1 |
| 1992 | 1 |