Skip to main content

Finitely representable spatial objects and efficient computation

  • Conference paper
  • First Online:
Algorithms and Computation (ISAAC 1994)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 834))

Included in the following conference series:

Abstract

This paper discusses issues that relate to the finite representation of database entities that may have an infinite size. A first issue concerns the construction of unique representations which support efficient implementations of various procedures. We discuss sorted and unsorted representations of various geometrical entities and show how the sorted representations support more efficient procedures. A second issue concerns the declarative specification of various procedures in terms of the parameters of the finite representation of entities. This issue is of importance in relation to the ease with which a user may express procedures on complex representations. We show how well-defined procedures may be represented in a declarative form in terms of the parameters of the finite representation of the entities.

Supported in part by NSF grant IRI-9117094 and NASA 1992–1994 Global Change Fellowship.

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Raghu Ramakrishnan, Divesh Srivastava, and S. Sudershan, CORAL-control, Relation and Logic. Proceedings of the 18th VLDB Conference, Vancouver, Canada, 1992.

    Google Scholar 

  2. T. R. Smith, J. Su, D. Agrawal, and A. El Abbadi, Database and Model ing Systems for the earth sciences. In IEEE Bulletin of the Technical Committee on Data Engineering, 16(1), March 1993. (Special Issue on Scientific Databases).

    Google Scholar 

  3. H. B. Enderton, A mathematical introduction to logic, Academic press, 1984

    Google Scholar 

  4. Jeff Dozier, Looking Ahead to EOS: The Earth Observing System, Computer in Physics, May/June 1990.

    Google Scholar 

  5. J. A. Dutton, The Eos Data and Information System:Concepts for Design, IEEE Transaction on Geoscience and Remote Sensing, Vol. 27. No. 2. March 1989.

    Google Scholar 

  6. A. Requicha, Representations for rigid solids: theory, methods, and systems. ACM Computing Surveys, 12:437–464, 1980.

    Article  Google Scholar 

  7. D. Dobkin, L. Guibas, J. Hershberger, and J. Snoeyink, An Efficient Algorithm for Finding the CSG Representation of a Simple Polygon. ACM Computer Graphics, 22(4):31–40, 1988.

    Google Scholar 

  8. O. Gunther, Efficient Structures for Geometric Data Management. PhD Thesis, College of Engineering, UC Berkeley, November 1987.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Ding-Zhu Du Xiang-Sun Zhang

Rights and permissions

Reprints and permissions

Copyright information

© 1994 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Chen, Y., Smith, T.R. (1994). Finitely representable spatial objects and efficient computation. In: Du, DZ., Zhang, XS. (eds) Algorithms and Computation. ISAAC 1994. Lecture Notes in Computer Science, vol 834. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58325-4_180

Download citation

  • DOI: https://doi.org/10.1007/3-540-58325-4_180

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-58325-7

  • Online ISBN: 978-3-540-48653-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics