1Michtom School of Computer Science, Brandeis University, Waltham, MA 02254, USA, e-mail: email@example.comDepartment of Computer Science, University of Victoria, Victoria, B.C., Canada V8W 3P6.
Checking for direct PDF access through Ovid
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 Ō(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.