Skip to main content

Visualizing geometric algorithms — State of the art

  • Invited Contributions
  • Conference paper
  • First Online:
Applied Computational Geometry Towards Geometric Engineering (WACG 1996)

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

Included in the following conference series:

  • 192 Accesses

Abstract

The visual nature of geometry makes it a natural area where visualization can be an effective tool in communicating ideas. This is enhanced by the observation that much of the action in computational geometry occurs in 2 and 3 dimensions, where visualization is highly plausible. Given these observations, it is not surprising that there has been noticeable progress during the past few years in the production of visualizations of geometric algorithms and concepts. There is every reason to believe that this will continue and even accelerate in the future. In this note, I briefly survey the current state of the art as well as suggesting new directions that should be pursued in the future. Further details appear in the survey article [HD96].

This work supported in part by the National Science Foundation under Grant Number CCR93-01254.

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. David Epstein, Charlie Gunn, et al, “Not-Knot”, distributed by A K Peters, Wellesley MA, 1991.

    Google Scholar 

  2. P. Epstein, J. Kavanagh, A. Knight, J. May, T. Nguyen and J.-R. Sack, “Workbench for Computational Geometry” in Animation of Geometric Algorithms: A Video Review, edited by Brown and Hershberger, DEC SRC TR 87b, 1992.

    Google Scholar 

  3. A. Hausner and D. Dobkin, “Making Geometry Visible: An introduction to the Animation of Geometric Algori thms”, in Handbook for Computational Geometry, edited by Sack and Urrutia, to appear.

    Google Scholar 

  4. Silvio Levy, Delle Maxwell and Tamara Munzner. “Outside In”, distributed by A K Peters, Wellesley MA, 1994.

    Google Scholar 

  5. Peter Schorn, Adrian Brüngger and Michele De Lorenzi, “The XYZ GeoBench: Animation of Geometric Algorithms” in Animation of Geometric Algorithms: A Video Review, edited by Brown and Hershberger, DEC SRC TR 87b, 1992.

    Google Scholar 

  6. A.Y. Tal and D.P. Dobkin, “Visualization of Geometric Algorithms”, IEEE Transactions on Visualization and Computer Graphics (TVCG) Volume 1, Number 2.

    Google Scholar 

  7. Seth Teller, “Visualizing Fortune's Sweepline Algorithm for Planar Voronoi Diagrams” in Symposium on Computational Geometry, 1993 Video Review, edited by Brown and Hershberger.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Ming C. Lin Dinesh Manocha

Rights and permissions

Reprints and permissions

Copyright information

© 1996 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Dobkin, D. (1996). Visualizing geometric algorithms — State of the art. In: Lin, M.C., Manocha, D. (eds) Applied Computational Geometry Towards Geometric Engineering. WACG 1996. Lecture Notes in Computer Science, vol 1148. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0014481

Download citation

  • DOI: https://doi.org/10.1007/BFb0014481

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-61785-3

  • Online ISBN: 978-3-540-70680-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics