3-D graphic display of discrete spatial data by prism maps
- 23 August 1978
- proceedings article
- Published by Association for Computing Machinery (ACM)
- Vol. 12 (3) , 70-75
- https://doi.org/10.1145/800248.807373
Abstract
An efficient algorithm for displaying 3-D scenes showing a discrete spatially varying surface is described. Given a 2-D map or planar graph composed of polygons where each polygon has a positive real number attribute, a prism is erected on each polygon with height proportional to that attribute. The resulting 3-D scene is plotted with shading and hidden lines removed. Thus the spatial variation of the attribute may be quickly and intuitively grasped by the nontechnical observer. This has applications to areas such as geography if the map is a cartographic map, or to physics if the map diagrams the periodic table. The algorithm takes time O(N*log(N)) where N is the number of edges in the map. Most of the calculations can be done without knowing the prism heights so extra plots with different attributes for the prisms can be produced quickly. This algorithm has been implemented and tested on maps of up to 12000 edges.Keywords
This publication has 2 references indexed in Scilit:
- The progression of realism in computer generated imagesPublished by Association for Computing Machinery (ACM) ,1977
- ALGORITHMS FOR THE REDUCTION OF THE NUMBER OF POINTS REQUIRED TO REPRESENT A DIGITIZED LINE OR ITS CARICATURECartographica: The International Journal for Geographic Information and Geovisualization, 1973