Introduction to the special issue: What can one learn from box-plane intersections?

DOI10.1023/A:1009984921053MaRDI QIDQ1971091zbMATH OpenOpenAlexFDO

Authors H. Ratschek, J. Rokne

Publication date 8 May 2002

Published in Reliable Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/a:1009984921053

zbMATH Keywords

computational geometryinterval arithmeticgeometric computationsbox-plane intersection problem

Mathematics Subject Classification ID

Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Interval and finite arithmetic (65G30)

Recommendations

• How trivial are reliable box-plane intersections?
• scientific article; zbMATH DE number 1206058
• Reliable geometric computing
• Reliable and efficient geometric computing
• scientific article; zbMATH DE number 4078610

Cited in

(1)

• In Praise of Numerical Computation

This page was built for publication: Introduction to the special issue: What can one learn from box-plane intersections?

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1971091)