Skip to main content

Visualization of Environment Protection Data

  • Conference paper
Visualisierung von Umweltdaten 1991

Part of the book series: Informatik aktuell ((INFORMAT))

  • 18 Accesses

Abstract

Interpolation and approximation of a large amount of unstructured data is a central issue in many applications. The purpose of this paper is to present an algorithm for this problem, consisting of two parts: in a first step we reduce data by creating a representation set based upon a generalized Voronoi diagram. Then we apply a scattered data algorithm on the reduced set. As a practical application of this method we visualize a SO 2 distribution.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 54.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 69.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Referenees

  1. A. Bowyer:Computing Dirichlet tesselations, Comp. Journal, Vol. 24, No. 2, 1981, 162–166.

    Article  Google Scholar 

  2. H. Hagen, R. Lengen, Th. Schreiber:Visualisierung von Umweltdaten, 5. Symp. Informatik für den Umweltschutz, Proc. Inf. Fachb. 256, Springer (1990), 799–807.

    Google Scholar 

  3. H. Hagen, Th. Schreiber:Scattered Data Algorithmen zur Umweltdatenvisualisierung, in: Denzer, Hagen, Kutschke: Visualisierung von Umweltdaten, Workshop Rostock, Nov. 1990, Infomatik Fachberichte 274 (1991), 22–28.

    Google Scholar 

  4. O. Palacios-Velez, B. C. Renaud:A Dynamic Hierarchical Subdivision Algorithm for Computing Delaunay Triangulations and Other Closest-Point Problems, ACM Trans, on Math. Soft., Vol. 16, No. 3, Sept. 1990, 275–292.

    Article  Google Scholar 

  5. F. P. Preparata, M. I. Shamos:Computational Geometry, Springer, 1985.

    Google Scholar 

  6. S. Z. Selim, M. A. Ismail:K-means-type algoritkms: A generalized convergence theorem and characterization oflocal optimality, IEEE Trans. Pattern Anal. Mach. Intell. PAMI-6,1 (1986), 81–87.

    Google Scholar 

  7. Th. Schreiber:A Voronoi Diagram Based Adaptive K-Means-Type Clustering Algorithm for Multidimensional Weighted Data, 7. Workshop of Computational Geometry, Bern 1990, Lecture Notes, Springer.

    Google Scholar 

  8. D. F. Watson:Computing the n-dimensional Delaunay tesselation with application to Voronoi polytops, Comp. Journal, Vol. 24, No. 2, 1981, 162–166.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1992 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hagen, H., van Lengen, R., Schreiber, T. (1992). Visualization of Environment Protection Data. In: Denzer, R., Güttler, R., Grützner, R. (eds) Visualisierung von Umweltdaten 1991. Informatik aktuell. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-77612-0_9

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-77612-0_9

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-55624-4

  • Online ISBN: 978-3-642-77612-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics