Robust and efficient ray intersection of implicit surfaces

DOI10.1023/A:1009921806032MaRDI QIDQ1971092zbMATH OpenOpenAlexFDO

Authors Yanyan Li

Publication date 22 March 2000

Published in Reliable Computing (Search for Journal in Brave)

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

zbMATH Keywords

global convergenceinterval arithmeticcomputer graphicsroot findingray tracingAlefeld-Hansen's methodray intersection of implicit surfaces

Mathematics Subject Classification ID

Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Numerical computation of solutions to single equations (65H05) Interval and finite arithmetic (65G30)

Recommendations

• scientific article; zbMATH DE number 2112338
• General, robust, and efficient polyhedron intersection in the interface reconstruction library
• scientific article; zbMATH DE number 4133542
• scientific article; zbMATH DE number 2009911
• A second order geometric method for ray/parametric surface intersection
• Robust interval algorithm for surface intersections

Cited in

(4)

• scientific article; zbMATH DE number 2094696 (Why is no real title available?)
• Discrete Geometry for Computer Imagery
• Bounding the zeros of an interval equation
• On first zero crossing points.

Describes a project that uses

Uses Software

• PROFIL/BIAS

This page was built for publication: Robust and efficient ray intersection of implicit surfaces

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