Skip to main content

Computational Geometry and Uncertainty

  • Chapter
Uncertainty in Geometric Computations

Part of the book series: The Springer International Series in Engineering and Computer Science ((SECS,volume 704))

  • 193 Accesses

Abstract

From the prehistory of computational geometry it has been apparent that geometric computation is fraught with problems. Although these problems have become less troublesome over the ensuing thirty years, they have not been eliminated. The paper discusses the sources of geometric errors in applied computational geometry systems and reviews various attempts at eliminating them in practical systems. No completely satisfactory solution has been devised, but for some restricted cases, there has been progress. A possible way ahead which may enable provably correct systems to be implemented is suggested.

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

Access this chapter

eBook
USD 16.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 16.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.

Similar content being viewed by others

References

  1. Braid, I. (1973). Designing with Volumes. PhD thesis, University of Cambridge, Computer Laboratory.

    Google Scholar 

  2. Braid, I. (2001). Personal communication.

    Google Scholar 

  3. Chazelle, B. and Dobkin, D. (1980). Detection is easier than computation. In 12th ACM Symposium on the Theory of Computation, Los Angeles, California.

    Google Scholar 

  4. Corthout, M. and Pol, E.-J. (1992). Point Containment and the PHAROS Chip. PhD thesis, University of Leiden, Leiden.

    Google Scholar 

  5. Fabris, A. (1995). Robust Anti-aliasing of Curves. PhD thesis, University of East Anglia Computational Geometry Project.

    Google Scholar 

  6. Fabris, A. and Forrest, A. (1997). Antialiasing of curves by discrete pre-filtering. In Computer Graphics Proceedings, SIGGRAPH, pages 317–326, Los Angeles, California. ACM SIGGRAPH, New York.

    Google Scholar 

  7. Forrest, A. (1971). Computational geometry. Proceedings of the Royal Society of London A, 321:187–197.

    Article  Google Scholar 

  8. Forrest, A. (1979). On the rendering of surfaces. In Computer Graphics Proceedings, Annual Conference Series, SIGGRAPH, volume 13, pages 253–259.

    Google Scholar 

  9. Laur, D. and Hanrahan, P. (1991). Hierarchical splatting: A progressive refinement algorithm for volume rendering. In Computer Graphics Proceedings, Annual Conference Series, SIGGRAPH, volume 25, pages 285–288. ACM SIGGRAPH, New York.

    Google Scholar 

  10. Levoy, M. and Whitted, J. (1985). The use of points as display primitives. Technical Report Technical Report TR 85-022, University of North Carolina at Chapel Hill, Department of Computer Science.

    Google Scholar 

  11. Pfister, H., Rockwood, A., Frisken, S., Perry, R., Gross, M., McMillan, L., Moreton, H., and Sweldens, W. (2001). New directions in shape representations. In Course 33: On SIGGRAPH 2001 Course Notes CD-ROM, ACM SIGGRAPH, Los Angeles, California.

    Google Scholar 

  12. Rusinkiewicz, S. and Levoy, M. (2000). Qs-plat: A multiresolution point rendering system for large meshes. In Computer Graphics Proceedings, Annual Conference Series, SIGGRAPH, pages 343–352, New Orleans, Louisiana. ACM SIGGRAPH, New York.

    Google Scholar 

  13. Sabin, M. (1999). Explorations in 3D integer-based linear geometry. Technical Report Technical Report DAMTP/1999/NA05, University of Cambridge, Department of Applied Mathematics and Theoretical Physics.

    Google Scholar 

  14. Schroeder, P., Sweldens, W., Curless, B., Guskov, I., and Zorin, D. (2001). Digital geometry processing. In Course 50: On SIGGRAPH 2001 Course Notes CD-ROM, ACM SIGGRAPH, Los Angeles, California.

    Google Scholar 

  15. Seidel, R. (1998). The nature and meaning of perturbations in geometric computing. Discrete and Computational Geometry, 19(1): 1–17.

    Article  MathSciNet  MATH  Google Scholar 

  16. Shamos, M. (1974). Problems in computational geometry. Ph.D. Thesis Outline.

    Google Scholar 

  17. Shamos, M. (1975). Geometric complexity. In 7th SIGACT Conference.

    Google Scholar 

  18. Shamos, M. (1978). Computational Geometry. PhD thesis, Yale University, Department of Computer Science.

    Google Scholar 

  19. Solomon, B. (1985). Surface Intersections for Solid Modelling. PhD thesis, University of Cambridge.

    Google Scholar 

  20. Westover, L. (1998). Footprint evaluation for volume rendering. In Computer Graphics Proceedings, Annual Conference Series, SIGGRAPH, volume 24, pages 367–376.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer Science+Business Media New York

About this chapter

Cite this chapter

Forrest, A.R. (2002). Computational Geometry and Uncertainty. In: Winkler, J., Niranjan, M. (eds) Uncertainty in Geometric Computations. The Springer International Series in Engineering and Computer Science, vol 704. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-0813-7_6

Download citation

  • DOI: https://doi.org/10.1007/978-1-4615-0813-7_6

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-1-4613-5252-5

  • Online ISBN: 978-1-4615-0813-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics