Interval Constraint Plotting for Interactive Visual Exploration of Implicitly Defined Relations

Interval Constraint Plotting for Interactive Visual Exploration of Implicitly Defined Relations 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. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Reliable Computing Springer Journals

Interval Constraint Plotting for Interactive Visual Exploration of Implicitly Defined Relations

Loading next page...
 
/lp/springer_journal/interval-constraint-plotting-for-interactive-visual-exploration-of-PuGup6NL20
Publisher
Kluwer Academic Publishers
Copyright
Copyright © 2000 by Kluwer Academic Publishers
Subject
Mathematics; Numeric Computing; Approximations and Expansions; Computational Mathematics and Numerical Analysis; Mathematical Modeling and Industrial Mathematics
ISSN
1385-3139
eISSN
1573-1340
D.O.I.
10.1023/A:1009950630139
Publisher site
See Article on Publisher Site

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.

Journal

Reliable ComputingSpringer Journals

Published: Oct 7, 2004

References

You’re reading a free preview. Subscribe to read the entire article.


DeepDyve is your
personal research library

It’s your single place to instantly
discover and read the research
that matters to you.

Enjoy affordable access to
over 12 million articles from more than
10,000 peer-reviewed journals.

All for just $49/month

Explore the DeepDyve Library

Unlimited reading

Read as many articles as you need. Full articles with original layout, charts and figures. Read online, from anywhere.

Stay up to date

Keep up with your field with Personalized Recommendations and Follow Journals to get automatic updates.

Organize your research

It’s easy to organize your research with our built-in tools.

Your journals are on DeepDyve

Read from thousands of the leading scholarly journals from SpringerNature, Elsevier, Wiley-Blackwell, Oxford University Press and more.

All the latest content is available, no embargo periods.

See the journals in your area

DeepDyve Freelancer

DeepDyve Pro

Price
FREE
$49/month

$360/year
Save searches from Google Scholar, PubMed
Create lists to organize your research
Export lists, citations
Read DeepDyve articles
Abstract access only
Unlimited access to over
18 million full-text articles
Print
20 pages/month
PDF Discount
20% off