Reliable algorithms for ray intersection in computer graphics based on interval arithmetic
暂无分享,去创建一个
[1] Roman Kuchkuda,et al. An introduction to ray tracing , 1993, Comput. Graph..
[2] Tom Duff,et al. Interval arithmetic recursive subdivision for implicit functions and constructive solid geometry , 1992, SIGGRAPH.
[3] Ulrich W. Kulisch,et al. Numerical Toolbox for Verified Computing I , 1993 .
[4] Ole Caprani,et al. Robust and Efficient Ray Intersection of Implicit Surfaces , 2000, Reliab. Comput..
[5] Inmaculada García,et al. Interval Algorithms for Finding the Minimal Root in a Set of Multiextremal One-Dimensional Nondifferentiable Functions , 2002, SIAM J. Sci. Comput..
[6] Ulrich W. Kulisch,et al. C++ Toolbox for Verified Computing I , 1995 .
[7] A. Griewank,et al. Automatic differentiation of algorithms : theory, implementation, and application , 1994 .
[8] B. Gleyse. Sturm sequences and the number of zeros of a real polynomial in the unit disk: Numerical computation , 1997 .
[9] John M. Snyder,et al. Interval analysis for computer graphics , 1992, SIGGRAPH.
[10] Devendra Kalra,et al. Guaranteed ray intersections with implicit surfaces , 1989, SIGGRAPH.
[11] Marcelo Gattass,et al. Interval methods for ray casting implicit surfaces with affine arithmetic , 1999, XII Brazilian Symposium on Computer Graphics and Image Processing (Cat. No.PR00481).
[12] D. P. Mitchell. Robust ray intersection with interval arithmetic , 1990 .
[13] William H. Press,et al. Numerical recipes in C , 2002 .
[14] R. B. Kearfott. Rigorous Global Search: Continuous Problems , 1996 .
[15] G. Corliss,et al. C-Xsc: A C++ Class Library for Extended Scientific Computing , 1993 .