Reliable Computing

, Volume 6, Issue 1, pp 81–92 | Cite as

Interval Constraint Plotting for Interactive Visual Exploration of Implicitly Defined Relations

  • Timothy J. Hickey
  • Zhe Qju
  • Maarten H. Van Emden

Abstract

Conventional plotting programs adopt techniques such as adaptive sampling to approximate, but not to guarantee, correctness and completeness in graphing functions. Moreover, implicitly defined mathematical relations can impose an even greater challenge as they either cannot be plotted directly, or otherwise are likely to be misrepresented. In this paper, we address these problems by investigating interval constraint plotting as an alternative approach that plots a hull of the specified curve. We present some empirical evidence that this hull property can be achieved by a \(\mathcal{O}(n)\) algorithm. Practical experience shows that the hull obtained is the narrowest possible whenever the precision of the underlying floating-point arithmetic is adequate. We describe IASolver, a Java applet (http://www.cs.brandeis.edu/~tim) that serves as testbed for this idea.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Alefeld, G. and Herzberger, J.: Introduction to Interval Computations, Academic Press, 1983.Google Scholar
  2. 2.
    Avitzur, R., Bachmann, O., and Kajler, N.: From Honest to Intelligent Plotting, in: Proc. of ISSAC'95, ACM Press, Montreal, Canada, 1995, pp. 32-41.Google Scholar
  3. 3.
    Bajaj, C., Hoffman, C., Hoperoft, J., and Lynch, R.: Tracing Surface Intersections, Computer Aided Geometric Design 5 (1988), pp. 285-307.Google Scholar
  4. 4.
    Benhamou, F. and Older, W.: Applying Interval Arithmetic to Real, Integer, and Boolean Constraints, Journal of Logic Programming 32(1) (1997), pp. 1-24.Google Scholar
  5. 5.
    BNR Prolog User Guide and Reference Manual, Software Engineering Center, Bell-Northern Research, Ottawa, Canada, 1988.Google Scholar
  6. 6.
    Fateman, R.: Honest Plotting, Global Extrema and Interval Arithmetic, in: Proc. of ISSAC'92, ACM Press, Berkeley, CA, 1992, pp. 216-223.Google Scholar
  7. 7.
    Forsythe, G.: Pitfalis in Computation, or Why a Math Book Isn't Enough, Amer. Math. Monthly 77 (1970), pp. 931-956.Google Scholar
  8. 8.
    Hansen, E.: Global Optimization Using Interval Analysis, Marcel Dekker, 1992.Google Scholar
  9. 9.
    Hickey, T.: IASolver, Java applet accessible via http://www.cs.brandeis.edu/~tim.Google Scholar
  10. 10.
    Moore, R.: Interval Analysis, Prentice-Hall, 1966.Google Scholar
  11. 11.
    Snyder, J.: Interval Analysis for Computer Graphics, Computer Graphics (1992), pp. 121-129.Google Scholar
  12. 12.
    Suffern, K.: Quadtree Algorithms for Contouring Functions of Two Variables, The Computer Journal 33 (1990), pp. 402-407.Google Scholar
  13. 13.
    Timmer, H.: Analytic Background for Computation of Surface Intersections, Douglas Aircraft Company Technical Memorandum CI-250-CAT-77-036, 1977.Google Scholar
  14. 14.
    Tupper, J.: Graphing Equations with Generalized Interval Arithmetic, M. Sc. thesis, Department of Computer Science, University of Toronto, 1996.Google Scholar
  15. 15.
    van Emden, M.: Value Constraints in the CLP Scheme, Constraints: An International Journal 2 (1997), pp. 163-183.Google Scholar
  16. 16.
    Van Hentenryck, P., Michel, L., and Deville, Y.: Numerica: A Modelling Language for Global Optimization, MIT Press, 1997.Google Scholar
  17. 17.
    Williams, R.: The Goblin Quadtree, The Computer Journal 31 (1988), pp. 358-363.Google Scholar

Copyright information

© Kluwer Academic Publishers 2000

Authors and Affiliations

  • Timothy J. Hickey
    • 1
  • Zhe Qju
  • Maarten H. Van Emden
    • 2
  1. 1.Michtom School of Computer ScienceBrandeis UniversityWalthamUSA
  2. 2.Department of Computer ScienceUniversity of VictoriaVictoriaCanada

Personalised recommendations