Principles of interactive computer graphics (2nd ed.)
Principles of interactive computer graphics (2nd ed.)
The Art of Computer Programming Volumes 1-3 Boxed Set
The Art of Computer Programming Volumes 1-3 Boxed Set
An algorithm for shading of regions on vector display devices
SIGGRAPH '79 Proceedings of the 6th annual conference on Computer graphics and interactive techniques
Polygon triangulation in O(n log log n) time with simple data-structures
SCG '90 Proceedings of the sixth annual symposium on Computational geometry
A generic solution to polygon clipping
Communications of the ACM
Triangulating Simple Polygons and Equivalent Problems
ACM Transactions on Graphics (TOG)
A parallel scan conversion algorithm with anti-aliasing for a general-purpose ultracomputer
SIGGRAPH '83 Proceedings of the 10th annual conference on Computer graphics and interactive techniques
| Hi-index | 0.02 |
Given an arbitrary simple polygon with N vertices we present an algorithm for shading the interior of the polygon with a set of parallel lines where the slope and the distance between lines are prespecified. If the number of shading line segments is M, the algorithm described in the paper runs in 0(N log N + M) time. The algorithm is generalizable to shade any region or regions of an arbitrary planar subdivision.