Synonyms
Constraint database visualization; Isometric color bands displays
Definition
In general, visualization is any technique for creating images, diagrams, or animations in order to present any message. Scientific visualization is an application of computer graphics which is concerned with the presentation of potentially huge quantities of laboratory, simulation or abstract data to aid cognition, hypotheses building and reasoning.
In a spatial database system, spatial information is usually stored in the format of raster data or vector data. To visualize raster data, the visualization application has to convert the geographical information associated with each pixel into a specific color and present each pixel individually. To visualize vector data, the visualization application has to identify the geometrical primitives such as points, lines, curves, and polygons, convert the original geospatial coordinate system to screen coordinate system, associate a particular color to each...
Recommended Reading
Brodsky, A., Segal, V., Chen, J., Exarkhopoulo, P.: The CCUBE constraint object-oriented database system. Constraints 2(3–4), 245–277 (1997)
Chazelle, B., Dobkin, D.: Decomposing a polygon into its convex parts. In: Proc. 11th Annual ACM Symposium on Theory of Computing, pp. 38–48., Atlanta, Georgia, 1979
Goldin, D., Kutlu, A., Song, M., Yang, F.: The Constraint Database Framework: Lessons Learned from CQA/CDB. In: Proc. International Conference on Data Engineering, pp. 735–737, Bangalore, India, 2003
Grumbach, S., Rigaux, P., Segoufin, L.: The {DEDALE} system for complex spatial queries. In: Proc. ACM SIGMOD International Conference on Management of Data, pp. 213–224, Seattle, Washington, 1998
Kanellakis, P.C., Kuper, G.M., Revesz, P.: Constraint Query Languages. In: Proc. ACM Symposium on Principles of Database Systems, pp. 299–313, Nashville, Tennessee, 1990
Kanellakis, P.C., Kuper, G.M., Revesz, P.: Constraint query languages. Journal of Computer and System Sciences 51(1), 26–52 (1995)
Keil, J.M.: Decomposing a Polygon into Simpler Components. SIAM Journal of Computing 14(4), 799–817 (1985)
O'Rourke, J., Supowit, K.J.: Some NP-hard polygon decomposition problems. IEEE Transactions on Information Theory 29(2), 181–190 (1983)
Revesz, P.: Introduction to Constraint Databases. Springer, New York (2002)
Revesz, P., Li, Y.: MLPQ: A linear constraint database system with aggregate operators. In: Proc. 1st International Database Engineering and Applications Symposium, pp. 132–137. IEEE Press, Washington, DC (1997)
Revesz, P., Wu, S.: Visualization of recursively defined concepts. In: Proceedings of the 8th International Conference on Information Visualization, pp. 613–621. IEEE Press, Washington, DC (2004)
Revesz, P., Wu, S.: Spatiotemporal Reasoning About Epidemiological Data. Artificial Intelligence in Medicine 38(2), 157–170 (2006)
Rigaux, P., Scholl, M., Segoufin, L., Grumbach, S.: Building a Constraint-Based Spatial Database System: Model, Languages, and Implementation. Information Systems 28(6), 563–595 (2003)
Schachter, I.: Decomposition of polygons into convex sets. IEEE Transactions on Computers 27(11), 1078–1082 (1978)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer-Verlag
About this entry
Cite this entry
Wu, S. (2008). Visualizing Constraint Data. In: Shekhar, S., Xiong, H. (eds) Encyclopedia of GIS. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-35973-1_1460
Download citation
DOI: https://doi.org/10.1007/978-0-387-35973-1_1460
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-30858-6
Online ISBN: 978-0-387-35973-1
eBook Packages: Computer ScienceReference Module Computer Science and Engineering