Issue 1Regular Issuehttps://diglib.eg.org:443/handle/10.2312/192024-03-28T21:51:07Z2024-03-28T21:51:07ZPreserving the Area of RegionsWilliams, Richardhttps://diglib.eg.org:443/handle/10.2312/64542017-03-16T14:26:02Z1987-01-01T00:00:00ZPreserving the Area of Regions
Williams, Richard
When regions are represented by their boundary, the number of points ((x, y) coordinate pairs) used to define the boundary can vary. Many more points are required to satisfactorily display a region at a detailed scale than at a broad scale. The area of a region is an important property in geographic and other applications, and it can easily be computed from the sequence of points. However, reducing or increasing the number of points in the sequence will usually alter the area. This paper considers how the region s area could be preserved by approximation algorithms, which reduce the number of points, and by enhancement algorithms, which increase the number of points.
1987-01-01T00:00:00ZACM SIGGRAPH 86, Dallas, Texas, 18-22 AugustRobinson, K.https://diglib.eg.org:443/handle/10.2312/64562017-03-16T11:29:42Z1987-01-01T00:00:00ZACM SIGGRAPH 86, Dallas, Texas, 18-22 August
Robinson, K.
1987-01-01T00:00:00ZFilling Complex Polygons by Region-Fill Methods on Raster Graphics TerminalsRichards, J.E.https://diglib.eg.org:443/handle/10.2312/64552017-03-16T14:40:04Z1987-01-01T00:00:00ZFilling Complex Polygons by Region-Fill Methods on Raster Graphics Terminals
Richards, J.E.
A method is described for filling polygons according to the GKS Fill Area definition on terminals that provide only region-filling capabilities. The advantages and disadvantages of using this algorithm in GKS device drivers are considered.
1987-01-01T00:00:00ZCalendar of Eventshttps://diglib.eg.org:443/handle/10.2312/64572015-03-23T18:06:23Z1987-01-01T00:00:00ZCalendar of Events
1987-01-01T00:00:00Z