Skip to main content

Implementing the XYZ GeoBench: A programming environment for geometric algorithms

  • Conference paper
  • First Online:
Computational Geometry-Methods, Algorithms and Applications (CG 1991)

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

Included in the following conference series:

Abstract

The XYZ GeoBench (eXperimental geometrY Zurich) provides a comprehensive infrastructure for rapid prototyping of geometric algorithms and the implementation of production-quality library programs. This paper introduces the components of this programming environment and gives some implementation details. The system is implemented in an object oriented extension of Pascal on the Apple Macintosh computer. We report our experience with object oriented programming in the context of geometric algorithms and give some advice on building a programming environment for geometric computation.

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.

Similar content being viewed by others

References

  1. A. Aho, J. Hopcroft, J. Ullman: Data Structures and Algorithms, Addison Wesley, 1983.

    Google Scholar 

  2. K. Brown: Comments on “Algorithms for reporting and counting geometric intersections”, IEEE Trans. Comput. vol. C-30, pp. 147–148, Feb. 1981.

    Google Scholar 

  3. S. Fortune: A Sweepline Algorithm for Voronoi Diagrams, Algorithmica 2, pp. 153–174, 1987.

    Article  Google Scholar 

  4. J. Nievergelt, P. Schorn, C. Ammann, A. Brüngger, M. De Lorenzi: XYZ: A project in experimental geometric computation, in these proceedings, 1991.

    Google Scholar 

  5. B. Meyer. Object-Oriented Software Construction, Prentice Hall, 1987.

    Google Scholar 

  6. K. Mehlhorn, S. Näher: LEDA, A Library of Efficient Data Types and Algorithms, preliminary version, Universität des Saarlandes, 1989.

    Google Scholar 

  7. P. Schorn: Robust Algorithms in a Program Library for Geometric Computation, ETH PhD Dissertation 9519, to appear 1991.

    Google Scholar 

  8. E. Welzl: A fast randomized algorithm for computing the minimal area disk enclosing a set of points in d-space, presentation at the Workshop on Computational Geometry, Dagstuhl, Oct 1990.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

H. Bieri H. Noltemeier

Rights and permissions

Reprints and permissions

Copyright information

© 1991 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Schorn, P. (1991). Implementing the XYZ GeoBench: A programming environment for geometric algorithms. In: Bieri, H., Noltemeier, H. (eds) Computational Geometry-Methods, Algorithms and Applications. CG 1991. Lecture Notes in Computer Science, vol 553. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-54891-2_14

Download citation

  • DOI: https://doi.org/10.1007/3-540-54891-2_14

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-54891-1

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics