Geometric Computations with Interval and New Robust Methods: Applications in Computer Graphics, GIS and Computational Geometry

Geometric Computations with Interval and New Robust Methods: Applications in Computer Graphics, GIS and Computational Geometry

Volumn , Issue , 2003, Pages 1-318

  Ratschek, Helmut ^a   Rokne, Jon ^b  

^a HEINRICH HEINE UNIVERSITY   (Germany)

^b UNIVERSITY OF CALGARY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84902748300     PISSN: None     EISSN: None     Source Type: Book    
DOI: None     Document Type: Book

References (280)

1. S.G. Akl and S.G. Toussaint (1978) A fast convex hull algorithm. Info. Proc. Letters 7 219-222.
2. J. Alander (1985) On interval arithmetic range approximation methods of polynomials and rational functions. Computers and Graphics 9 365-372.
3. Albrycht, J., Wisniewski, H. (eds.):Proc. Polish Symp. Interval and Fuzzy Math.Inst. Math., Tech. Univ. Poznan (1985).
4. Alefeld, G.: Intervallrechnung Über den komplexen Zahlen und einige Anwendungen. Dissertation, Universität Karlsruhe (1968).
5. G. Alefeld and J. Herzberger (1974) Einführung in die Intervallrechnung Mannheim: Bibliographisches Institut
6. G. Alefeld and J. Herzberger (1983) Introduction to Interval Computations New York: Academic Press
7. G. Alefeld and J. Rokne (1981) On the interval evaluation of rational functions in interval arithmetic. SIAM Journal on Numerical Analysis 18 862-870.
8. E.L. Allgower and K. Georg (1990) Numerical Continuation Methods. An Introduction Berlin: Springer-Verlag
9. A.M. Andrew (1979) Another efficient algorithm for convex hulls in two dimensions. Information Processing Letters 9 216-219.
10. Arvo, J.:Transforming axis-aligned bounding boxes.In: [69], pp. 548-550 (1990).
11. Arvo, J.:A simple method for box-sphere intersection testing.In: [69], pp. 335-339 (1990).
12. F. Aurenhammer (1987) Power diagrams: properties, algorithms, and applications. SIAM Journal of Computing 16 78-96.
13. Avnaim, F., Boissonanat, J-D., Devillers, O., Preparata, F.P., Yvinec, M.:Evaluation of a new method to compute signs of determinants.Proc. of the Eleventh Symposium on Computational Geometry. ACM Press, pp. C16-C17 (1995).
14. P. Bao and J. Rokne (1988) Low complexity k-dimensional Taylor forms. Applied Mathematics and Computation 27 265-280.
15. R. Bartels, J. Beatty and B. Barsky (1987) An Introduction to Splines for Use in Computer Graphics and Geometric Modeling Morgan Kaufmann
16. H. Bauch, K.-U. Jahn, D. Oelschlägel, H. Süsse and V. Wiebigke (1987) Math.-Nat. Bibl. Intervallmathematik - Theorie und Anwendungen Leipzig: BSB B.G. Teubner Verlagsges Bd. 72
17. E. Baumann (1987) Optimal centered forms. Freiburger Intervall-Berichte 87/3 Institut für Angewandte Mathematik, Universität Freiburg 5-21.
18. Bézier, P.:The first years of CAD/CAM and the UNISURF CAD system.In: [195], pp. 13-26 (1993).
19. M. Blakemore (1987) Generalization and error in spatial data bases. Cartographica 21 131-139.
20. W. Böhm, G. Farin and J. Kahmann (1984) A survey of curve and surface methods in CAGD. Computer Aided Geometric Design 1 1-60.
21. Brönnimann, H., Burnickel, C. and Pion, S.:Interval arithmetic yields efficient dynamic filters for computational geometry.Proc. of the fourteenth annual symposium on computational geometry. ACM Press, pp. 165-174 (1998).
22. Bühler, K.:Fast and reliable plotting of implicit curves.Proc. of the Workshop of Uncertainty in Geometric Computations, The University of Sheffield, 5-6 July 2001. Kluwer, forthcoming.
23. Burnickel, C., Funke, S., Seel, M.:Exact geometric predicates using cascaded computation.Proc. of the fourteenth annual symposium on computational geometry. ACM Press, pp. 175-183 (1998).
24. Chan, T. M.:Output-sensitive results on convex hulls, extreme points and related problems.Proc. of the eleventh annual symposium on computational geometry. ACM Press, pp. 10-19 (1995).
25. R. Chandler (1989) Bezier Curves. 1990 Mathematical Sciences Calendar Rome Press Inc. pp. Jan.-March
26. B. Chazelle and D.P. Dobbin (1987) Intersection of convex objects in two and three dimensions. Journal of the Association for Computing Machinery 34 1-27.
27. S.D. Conte and C. de Boor (1980) Elementary Numerical Analysis, An Algorithmic Approach Third Ed. New York: McGraw-Hill
28. T. Csendes (2001) Convergence properties of interval global optimization algorithms with a new class of interval selection criteria. J. Global Optim 19 307-327.
29. T. Csendes and D. Ratz (2001) Subdivision direction selection in interval methods for global optimization. SIAM J. Numer. Anal 34 307-327.
30. M. de Berg, van Krefeld, M. Overmars and O. Schwarzkopf (1997) Computational Geometry. Algorithms and Applications New York: Springer-Verlag
31. M. De Lorenzi (1994) IGIS ‘94: Geographic Information Systems, LNCS 884. The XYZ GeoServer for geometric computation Berlin: Springer-Verlag 202-213.
32. Dobkin, D., Silver, D.:Recipes for geometry and numerical analysis, Part 1.: An empirical study.Proc. of the Fourth ACM Symp. on Computational geometry, pp. 93-105 (1988).
33. D. Dobkin and Silver (1990) Applied computational geometry: towards robust solutions of basic problem. Journal of Computer and System Science 40 70-87.
34. D.H. Douglas and T.K. Peucker (1973) Algorithm for the reduction of the number of points required to represent a digitized line or its caricature. The Canadian Cartographer 10 112-122.
35. D. Douglas (1990) Introductory readings in Geographic Information Systems. D.J. Peuquet, D.F. Marble,(Eds) It makes me so CROSS London: Taylor and Francis Ltd. 303-307.
36. K. Drabek (1969) Survey of Applicable Mathematics. K. Rektorys (Eds) Plane curves and constructions Mass: The M.I.T. Press 150-204.
37. T. Duff (1992) Interval arithmetic and recursive subdivision for implicit functions and constructive solid geometry. Computer Graphics 26 131-138.
38. J.G. Dunham (1986) Optimum uniform piecewise linear approximation of planar curves. IEEE Tran. Pattern Anal. and Machine Intelligence PAMI-8 67-75.
39. R. Dwyer (1987) A fast divide and conquer algorithm for constructing Delaunay triangulations. Algorithmica 2 137-151.
40. R. Dwyer (1991) Higher-dimensional Voronoi diagrams in linear expected time. Discrete and Computational Geometry 6 343-367.
41. Edelsbrunner, H., Mücke, E.P.:Simulation of simplicity: A technique to cope with degenerate cases in geometric algorithms.Proc. of the Fourth Annual Symposium on Computational Geometry. ACM Press, pp. 118-133 (1988).
42. H. Edelsbrunner (2001) Geometry and Topology for Mesh Generation Cambridge: Cambridge University Press
43. J.S. Ely (1993) The VPI Software package for variable precision interval arithmetic. Interval Computations 1993 135-153.
44. W. Enger (1992) Interval ray tracing - a divide and conquer strategy for realistic computer graphics. The Visual Computer 9 91-104.
45. T.O. Espelid (1995) On floating point summation. SIAM Review 37 603-607.
46. G. Farm (1997) Curves and Surfaces for CAGD Fourth edition Boston: Academic Press
47. R.T. Farouki and V.T. Rajan (1987) On the numerical condition of polynomials in Bernstein form. Computer Aided Geometric Design 4 191-216.
48. R.T. Farouki and V.T. Rajan (1988) Algorithms for polynomials in Bernstein form. Computer Aided Geometric Design 5 1-26.
49. Farouki, R. T.:Numerical stability in geometric algorithms and representations.In: D. C. Hanscomb (ed.): Proceedings Mathematics of Surfaces III, Oxford University Press, New York (1989).
50. R.T. Farouki (1991) Computing with barycentric polynomials. The Math. Intelligencer 13 61-69.
51. R.T. Farouki (1992) Geometry Processing for Design and Manufacture. R. Barnhill (Eds) Pythagorean-hodograph curves in practical use Philadelphia: SIAM 3-33.
52. I.D. Faux and M.J. Pratt (1979) Computational Geometry for Design and Manufacture New York: John Wiley
53. H. de Figueiredo and J. Stolfi (1996) Adaptive enumeration of implicit surfaces with affine arithmetic. Computer Graphics Forum 15 287-296.
54. J.D. Foley, A. Van Dam, S.K. Feiner and J.F. Hughes (1990) Computer Graphics, Principles and Practice Second edition Reading: Addison-Wesley 431-445.
55. N. Fomia (1996) A robust and fast convergent interval analysis method for the calculation of internally controlled switching instants. IEEE Trans. on Circuits and Systems 43 191-199.
56. A.R. Forrest (1987) Theoretical Foundations of Computer Graphics and CAD. NATO Advanced Study Institute Series. R.A. Earnshaw (Eds) Geometric computing environments: Computational geometry meets software engineering New York: Springer Verlag 185-197. 40
57. G. Forsythe (1969) Constructive Aspects of the Fundamental Theorem of Algebra. B. Dejon, P. Henrici,(Eds) What is a satisfactory quadratic equation solver New York: Wiley-Interscience 53-61.
58. G. Forsythe (1970) Pitfalls in computation, or why a math book isn't enough. American Math. Monthly 77 931-956.
59. Fortune, S.:Stable maintenance of point set triangulations in two dimensions.30th Symposium on Foundations of Computer Science, pp. 494-499 (1989).
60. S. Fortune (1991) Curves and Surfaces. P.J. Laurent, A. Le Méhauté, L.L. Schumaker,(Eds) Numerical stability of geometric algorithms Boston: Academic Press 189-192.
61. S. Fortune (1995) Numerical stability of algorithms for 2D Delaunay triangulations. International Journal of Computational Geometry and Applications 6 193-213.
62. Fortune, S., Wyk, C.:Efficient exact arithmetic for computational geometry.Proceedings of the Ninth Annual Symposium on Computational Geometry. ACM Press, pp. 163-172 (1993).
63. S. Fortune and C. Wyk (1996) Static analysis yields efficient exact integer arithmetic for computational geometry. ACM Transactions on Graphics 15 223-248.
64. Franklin, W. R.:Efficient polyhedron intersection and union.Proc. Graphics Interface 82, Canadian Information Processing Soc., Toronto, pp. 73-80 (1982).
65. W.R. Franklin (2000) Applications of analytical cartography. Cartography and Geographic Information Science 27 225-237.
66. M. Gavrilova and J. Rokne (1996) An efficient algorithm for construction of the power diagram from the Voronoi diagram in the plane. International Journal of Computer Mathematics 11 3-4.
67. M. Gavrilova and J. Rokne (2000) Reliable line segment intersection testing. Computer-Aided Design 32 737-745.
68. M. Gavrilova and J. Rokne (2001) Computing line intersections. Int. J. of Image and Graphics 1 217-230.
69. A.S. Glassner (1990) Graphics Gems New York: Academic Press
70. M. Gagnet, J.-C. Hervé, T. Pudet and J.M. Van Thong (1989) Incremental computation of planar maps. Computer Graphics 345-354. 23, (SIGGRAPH’ 89)
71. J. Gallier (1999) Curves and Surfaces in Geometric Modeling, Theory and Algorithms San Francisco: Morgan Kaufmann
72. J. Garloff (1985) Interval mathematics. A bibliography. Freiburger Intervall-Berichte 6 1-122.
73. J. Garloff (1987) Bibliography on interval mathematics. Continuation. Freiburger Intervall-Berichte 2 1-50.
74. A.J. Goldstein and P.L. Richman (1973) A midpoint phenomenon. Journal of the A.C.M. 20 301-304.
75. Goldman, R. N.:Identities for the univariate and bivariate Bernstein basis polynomials.In: [192], pp. 149-162 (1995).
76. Golin, M. and Sedgewick, R.:Analysis of a simple yet efficient convex hull algorithm.Proc. of the fourth annual symposium on computational geometry. ACM Press, pp. 153-163 (1988).
77. R. Graham (1972) An efficient algorithm for determining the convex hull of a finite planar set. Information Processing Letters 1 132-133.
78. T.A. Grandine (1989) Computing zeroes of spline functions. Computer Aided Geometric Design 6 129-136.
79. Gravesen, J.:The length of Bézier curves.In: [192], pp. 199-205 (1995).
80. Greene, D., Yao, F.:Finite-resolution computational geometry.Proceedings of the 27th Annual Symposium on Foundations of Computer Science. ACM Press, pp. 143 − 152 (1986).
81. Greene, N.:Detecting intersection of a rectangular solid and a convex polyhedron.In: [101], pp. 74-82 (1994).
82. D. Gries and I. Stojmenović (1987) A note on Graham's convex hull algorithm. Inform. Process. Lett 25 323-327.
83. Griewank, A., Corliss, G. (eds.):Automatic Differentiation of Algorithms.SIAM, Philadelphia (1991).
84. J. Guddat, F.G. Vazquez and H.T. Jongen (1990) Singularities, Pathfollowing, and Jumps Chichester: Wiley
85. L. Guibas and J. Stolfi (1985) Primitives for the manipulation of general subdivisions and the computation of Voronoi diagrams. ACM Transactions on Graphics 4 74-123.
86. L. Guibas, D. Knuth and M. Sharir (1992) Randomized incremental construction of Delaunay and Voronoi diagram. Algorithmica 7 381-413.
87. Hansen, E. R. (ed.):Topics in Interval Analysis.Oxford University Press, Oxford (1969).
88. Hansen, E. R.:The centered form.In: [87], pp. 102-105 (1969).
89. E.R. Hansen (1978) A globally convergent interval analytic method for computing and bounding real roots. BIT 18 153-163.
90. E.R. Hansen (1980) Global optimization using interval analysis - the multidimensional case. Numer. Math 34 247-270.
91. E.R. Hansen (1992) Global Optimization using Interval Arithmetic New York: Marcel Dekker
92. E.R. Hansen (1992) Bounding the solution of interval linear equations. SIAM J. Numer. Anal 29 1493-1503.
93. E.R. Hansen (2000) The hull of preconditioned interval linear equations. Rel. Computing 6 95-103.
94. E.R. Hansen and R.I. Greenberg (1983) An interval Newton method. Applied Math. and Comp 12 89-98.
95. Hansen, E. R., Sengupta, S.:Global constrained optimization using interval analysis.In: [184], pp. 25-47 (1980).
96. E.R. Hansen and S. Sengupta (1981) Bounding solutions of systems of equations using interval analysis. BIT 21 203-211.
97. E.R. Hansen and R.R. Smith (1967) Interval arithmetic in matrix computations, part II. SIAM Journal on Numerical Analysis 4 1-9.
98. Hanson, A. J.:Geometry for N-dimensional graphics.In: [101], pp. 149-170 (1994).
99. E. Haines (1989) An Introduction to Ray Tracing. A. Glassner (Eds) Essential ray tracing algorithms New York: Academic Press 33-78.
100. P. Hanrahan (1989) An Introduction to Ray Tracing. A. Glassner (Eds) A survey of ray-surface intersection algorithms New York: Academic Press 79-120.
101. P.S. Heckbert (1994) Graphic Gems IV Boston: Academic Press
102. Hershberger, J., Snoeyink, J.:Speeding up the Douglas-Peucker line simplification algorithm.In: Proceedings of the 5th International Symposium on Spatial Data Handling, International Geographical Union, Columbia, pp. 210-218 (1992).
103. Herve, C., Morain, F., Salesin, D., Serpette, B. P., Vullemin, J., Zimmermann, P.:BigNum: A portable and efficient package for arbitrary-precision arithmetic.INRIA Report 1016, Rocquencourt, (1989).
104. N.J. Higham (1993) The accuracy of floating point summation. SIAM J. Sci. Computation 14 783-799.
105. Hill, K. J.:Matrix-based ellipse geometry.In: [192], pp. 73-77 (1995).
106. Hobby, J., Baird, H.:Degraded character image restoration.Proceedings of the Fifth Annual Symposium on Document Analysis and Image Retrieval, pp. 233-245 (1996).
107. C. Hoffmann (1989) The problem of accuracy and robustness in geometric computation. IEEE Computer 22 31-42.
108. C. Hoffmann (1989) Geometric and Solid Modeling. An Introduction San Mateo: Morgan Kaufmann Inc.
109. J. Hoschek and D. Lasser (1993) Fundamentals of Computer Aided Geometric Design Wellesley, Mass: A.K. Peters
110. C.-Y. Hu, T. Maekawa, N.M. Patrikalakis and X. Ye (1997) Robust interval algorithm for surface intersections. Computer-Aided Design 29 617-627.
111. Hyvönen, E., DePascale, S.:InC++ library family for interval computations.In:Reliable Computing, Supplement (Extended Abstracts of APIC'95), pp. 85-90 (1995).
112. Institute of Electrical and Electronic Engineers:IEEE standard for binary floating-point arithmetic.IEEE Standard 754-1985, IEEE, New York (1985).
113. Institute of Electrical and Electronic Engineers:IEEE standard for radix-independent floating-point arithmetic.IEEE Standard 854-1987, IEEE, New York (1987).
114. D.D.T. Janssen and A.M. Vossepoel (1995) Adaptive vectorization of line drawing images. Computer Vision and Image Understanding 56 38-56.
115. J.W. Jaromczyk and G.W. Wasilkowski (1993) Numerical stability of a convex hull algorithm for simple polygon. Algorithmica 10 457-472.
116. J.W. Jaromczyk and G.W. Wasilkowski (1994) Computing convex hull in a floating point arithmetic. Computational Geometry Theory and Applications 4 283-293.
117. C.B. Jones and I.M. Abraham (1987) Line generalization in a global cartographic database. Cartographica 24 32-45.
118. A.K. Jones (1992) A review of Christoph M. Hoffman: Geometric and Solid Modeling: An Introduction. SIAM Reviews 34 327-329.
119. Jou, E.:Determine whether two line segments intersect.In: Modeling in Computer Graphics. Proceedings of the 10th Working Conference, Springer-Verlag, Berlin, Germany, pp. 265-274 (1991).
120. K. Jünger, G. Reinelt and D. Zepf (1991) Computing correct Delaunay triangulations. Computing 47 43-49.
121. S.A. Kalmykov, Y.I. Shokin and Z.K. Yuldashev (1986) Interval Analysis Methods Novosibirsk: NAUKA (in Russian)
122. T. Kao and G. Knott (1990) An efficient and numerically correct algorithm for the 2D convex hull problem. BIT 30 311-331.
123. M. Karasick, D. Lieber and L. Nackman (1991) Efficient Delaunay triangulation using rational arithmetic. ACM Transactions of Graphics 10, No 1 71-91.
124. J. Katajainen and M. Koppinen (1988) Constructing Delaunay triangulations by merging buckets in quadtree order. Annales Sociatatis Mathematicae Polonae, Series IV, Fundamenta Informaticae 11 275-288.
125. R.B. Kearfott (1990) Preconditioners for the interval Gauss-Seidel method. SIAM J. Numer. Anal 27 804-822.
126. Kearfott, R. B.:Rigorous computation of surface patch intersection curves.Preprint (1993)
127. R.B. Kearfott (1996) Rigorous Global Search: Continuous Problems Dordrecht: Kluwer
128. R.B. Kearfott (1996) INTERVAL-ARITHMETIC: A Fortran 90 module for an interval data type. ACM Trans. Math. Software 22 385-392.
129. R.B. Kearfott (2002) On existence and uniqueness verification of non-smooth functions. Reliable Computing 8 267-282.
130. R.B. Kearfott and Z. Xing (1994) An interval step control for continuation methods. SIAM J. Numerical Analysis 31 892-914.
131. R.B. Kearfott, M. Dawande, K.S. Du and C.Y. Hu (1994) Algorithm 737 INTLIB. ACM Trans. Math. Software 20 447-459.
132. R. Klatte, U. Kulisch, A. Wiethoff, R. Lawo and M. Rauch (1993) C-XSC Berlin: Springer-Verlag
133. R. Klatte, U. Kulisch, M. Neaga, D. Ratz and C. Ulrich (1991) PASCAL-XSC Berlin: Springer-Verlag
134. Knott, G., Jou, D.:A program to determine whether two line segments intersect.Technical Report CAR-TR-306, Dept. of Computer Science, University of Maryland, MD, USA (1987).
135. O. Knüppel (1994) PROFIL/BIAS - A fast interval library. Computing 53 277-288.
136. D.E. Knuth (1986) Metafont: The Program Reading, Mass: Addison Wesley Publ. Co.
137. D.E. Knuth (1992) Axioms and Hulls New York: Springer Verlag LNCS 606
138. R. Krawczyk (1969) Newton-Algorithmen zur Bestimmung von Nullstellen mit Fehlerschranken. Computing 4 187-201.
139. R. Krawczyk (1980) Zur äuβeren und inneren Einschlieβung des Wertebereichs einer Funktion. Freiburger Intervallberichte 80/7 1-19.
140. R. Krawczyk (1983) Intervallsteigerungen für rationale Funktionen und zugeordnete zentrische Formen. Freiburger Intervallberichte 83/2 1-30.
141. R. Krawczyk (1986) A class of interval Newton operators. Computing 37 179-183.
142. R. Krawczyk and K. Nickel (1982) Die zentrische Form in der Intervallarithmetik, ihre quadratische Konvergenz und ihre Inklusionsisotonie. Computing 28 117-132.
143. H.-P. Kriegel, T. Schmidt and T. Seidl (1997) Advances in Spatial Databases, LNCS 1262. M. Scholl, A. Voisar,(Eds) 3D similarity search by shape approximation Berlin: Springer-Verlag 11-28.
144. Kulisch, U.:Numerik mit automatischer Ergebnisverification.GAMM-Mitteilungen, pp. 39-58 (1994).
145. Kulisch, U., Miranker, W. L. (eds.):A new Approach to Scientific Computation.Academic Press, Orlando (1983).
146. J. Levin (1976) A parametric algorithm for drawing pictures of solid objects composed of quadric surfaces. CACM 19 555-563.
147. Li, Z., Milenkovic, V.:Constructing strongly convex hulls using exact or rounded arithmetic.Proceedings of the Sixth Annual Symposium on Computational Geometry. ACM Press, pp. 235-243 (1990).
148. Z. Li (1993) Some observations on the issue of line generalization. The Cartographic Journal 30 68-71.
149. Q. Lin and J. Rokne (1992) A family of centered forms for a polynomial. BIT 32 167-176.
150. W.A. Lodwick, W. Monson and L. Svoboda (1990) Attribute error and sensitivity analysis of map operations in geographical informations systems: suitability analysis. Int. J. Geographical Information Systems 4 413-428.
151. G.C. Lorentz (1953) Bernstein Polynomials Toronto: University of Toronto Press
152. D.H. McLain (1976) Two dimensional interpolation from random data. Comp. Journal 19 178-181.
153. M. Mäntylä (1986) Boolean operations of 2-manifolds through vertex neighborhood classification. ACM Trans. on Graphics 5 1-29.
154. Martin, R., Shou, H., Voiculescu, I., Bowyer, A., Wang, G.:Comparison of function range methods for solving algebraic equations in two variables.Manuscript (2001).
155. R. Martin (2002) Comparison of interval methods for plotting algebraic curves. Computer Aided Geometric Design 19 553-587.
156. K. Maruyama (1972) A procedure to determine intersections between polyhedral objects. International Journal of Computer and Information Sciences 1 255-266.
157. A. Maus (1984) Delaunay triangulation and the convex hull of n points in expected linear time. BIT 24 151-163.
158. V. Milenkovic (1988) Verifiable implementations of geometric algorithms using finite-precision arithmetic. Artificial Intelligence 37 377-401.
159. Milenkovic, V.:Double-precision geometry: A general technique for calculating line and segment intersections using rounded arithmetic.Proceedings of the 30th Annual IEEE Symposium on Foundations of Computer Science. ACM Press, pp. 500-505 (1989).
160. R.B. McMaster (1989) The integration of simplification and smoothing algorithms in line generalization. Cartographica 26 101-121.
161. D.S. Meek and D.J. Walton (1991) Several methods for representing discrete data by line segments. Cartographica 28 13-20.
162. Miller, R. D.:Quick and simple Bézier curve drawing.In: [192], pp. 206-209 (1995).
163. S.M. Markov (1998) On the algebra of intervals and convex bodies. Journal of Universal Computer Science 4 34-47.
164. Moore, R. E.:Interval arithmetic and automatic error analysis in digital computation.Ph. D. Thesis, Stanford University (1962).
165. R.E. Moore (1966) Interval Analysis Englewood Cliffs, N.J.: Prentice-Hall
166. R.E. Moore (1975) Mathematical Elements of Scientific Computing New York: Holt Rinehart Winston
167. R.E. Moore (1977) A test for existence of solutions to non-linear systems. SIAM Journal on Numerical Analysis 14 611-615.
168. R.E. Moore (1978) A computational test for convergence of iterative methods for non-linear systems. SIAM Journal on Numerical Analysis 15 1194-1196.
169. R.E. Moore (1979) Methods and Applications of Interval Analysis Philadelphia: SIAM
170. R.E. Moore (1980) Interval methods for nonlinear systems. Computing Suppl 2 113-120.
171. Moore, R. E. (ed.):Reliability in Computing: The Role of Interval Methods in Scientific Computation.Academic Press, New York (1988).
172. R.E. Moore and S.T. Jones (1977) Safe starting regions for iterative methods. SIAM Journal on Numerical Analysis 14 1051-1065.
173. J.E. Mower (1996) Developing parallel procedures for line simplification. Int. J. Geographical Information Systems 10 699-712.
174. S.P. Mudur and P.A. Koparkar (1984) Interval methods for processing geometric objects. IEEE Computer Graphics and Applications 4 7-17.
175. J.-C. Muller (1987) Fractal and automated line generalization. The Cartographic Journal 24 27-34.
176. P.S.V. Nataraj and S.M. Sheela (2002) A new subdivison strategy for range computations. Rel. Computing 8 83-92.
177. T.I. Nazarenko and L.V. Marchenko (1982) Introduction to Interval Methods of Computational Mathematics Irkutsk: Izd-vo Irkutskogo Universiteta (in Russian)
178. Neumaier, A.:The enclosure of solutions of parameter-dependent systems of equations.In [171], pp. 269-286 (1988).
179. A. Neumaier (1990) Interval Methods for Systems of Equations Cambridge: Cambridge University Press
180. A. Neumaier (1999) A simple derivation of the Hansen- Bliek -Rohn- Ning - Kearfott enclosure for linear interval equations. Rel. Computing 5 131-136.
181. K. Nickel (1971) On the Newton method in interval analysis University of Wisconsin Mathematics Research Center Report 1136
182. Nickel, K. (ed.):Interval Mathematics.Proceedings of the International Symposium, Karlsruhe 1975, Springer-Verlag, Wienna (1975).
183. K. Nickel (1977) Die Uberschätzung des Wertebereichs einer Funktion in der Intervallrechnung mit Anwendungen auf lineare Gleichungssysteme. Computing 18 15-36.
184. Nickel, K. (ed.):Interval Mathematics 1980.Proceedings of the International Symposium, Freiburg 1980, Academic Press, New York (1980).
185. Nickel, K. (ed.):Interval Mathematics 1985.Proceedings of the International Symposium, Freiburg 1985, Springer Verlag, Wienna (1986).
186. S. Ning and R.B. Kearfott (1997) A comparison of some methods for solving lineaer interval equations. SIAM J. Numer. Anal 34 1289-1305.
187. Y. Oishi and K. Sugihara (1995) Topology-oriented divide-and-conquer algorithm for Voronoi diagrams. Graphics Models and Image Processing 57 303-314.
188. A. Okabe, B. Boots and K. Sugihara (1992) Spatial Tessellations: Concepts and Applications of Voronoi Diagrams Chichester, West Sussex, England: John Wiley & Sons 205-208.
189. Oliveira, F.A.:Bounding solutions of nonlinear equations with interval analysis.Proc. 13th World Congr. Comp. Appl. Math., Dublin, pp. 246-247 (1991).
190. J. O'Rourke (1994) Computational Geometry in C Cambridge: Cambridge University Press
191. J.M. Ortega and W.C. Rheinboldt (1970) Iterative Solution of Nonlinear Equations in Several Variables Orlando: Academic Press
192. Paeth, A. W. (ed.):Graphics Gems V.Academic Press, Boston, 1995.
193. Perkal, J.:An attempt at objective line generalization.(Trans. R. Jackowski). Michigan Inter-University Consortium of Mathematical Geographers, Discussion Paper #10, University of Michigan, Ann Arbor, MI (1966).
194. Peucker, T. K.:A theory of the cartographic line.Auto-Carto II. Proceedings of the international symposium on computer-assisted cartography. U.S. Department of Commerce Bureau of the Census and the ACSM. pp. 508-518 (1975).
195. Piegel, L. (ed.):Fundamental Developments of Computer-Aided Geometric Modeling.Academic Press, London (1993).
196. Pion, S.:De la géométrie algorithmique au calcul géométrique.Thèse doctorat, Université de Nice Sophia-Antipolis (1999).
197. H. Prautzsch, W. Boehm and M. Paluszny (2002) Bezier and B-Spline Techniques New York: Springer-Verlag
198. F.P. Preparata and M.I. Shamos (1988) Computational Geometry (Second printing) New York: Springer-Verlag
199. W.H. Press, B.P. Flannery, S.A. Teukolsky and W.T. Wetterling (1988) Numerical Recipes in C Cambridge: Cambridge U. P.
200. Priest, D. M.:On properties of floating point arithmetics: numerical stability and the cost of accurate computations.Ph.D. Thesis, University of California, Berkeley (1992).
201. L.B. Rall (1981) Automatic Differentiation: Techniques and Applications New York: Springer-Verlag LNCS 120
202. L.B. Rall (1983) Mean value and Taylor forms in interval analysis. SIAM Journal on Mathematical Analysis 14 223-238.
203. U. Ramer (1972) An iterative procedure for the polygonal approximation of plane curves. Computer Graphics and Image Processing 1 244-256.
204. Ramshaw, L.:CSL notebook entry: The braiding of floating point lines.Unpublished manuscript, Xerox PARC, Palo Alto, California (1982).
205. S. Ratschan (2002) Search heuristics for box decomposition methods. J. Global Optim 24 35-49.
206. H. Ratschek (1971) Die Subdistributivität der Intervallarithmetik. Z. Angew. Math. Mech 51 189-192.
207. H. Ratschek (1972) Teilbarkeitskriterien der Intervallarithmetik. J. Reine Angew. Math 252 128-138.
208. Ratschek, H.:Nichtnumerische Aspekte der Intervallarithmetik.In: [182], pp. 48-74 (1975).
209. H. Ratschek (1978) Zentrische Formen. Zeitschrift für Angewandte Mathematik und Mechanik 58 T434-T436.
210. H. Ratschek (1980) Centered forms. SIAM Journal on Numerical Analysis 17 656-662.
211. Ratschek, H.:Some recent aspects of interval algorithms for global optimization.In: [171], pp. 325-339 (1988).
212. H. Ratschek and J. Rokne (1984) Computer Methods for the Range of Functions Chichester: Ellis Horwood
213. H. Ratschek and J. Rokne (1988) New Computer Methods for Global Optimization Chichester: Ellis Horwood
214. H. Ratschek and J. Rokne (1992) Computational and Applied Mathematics I. C. Brezinski, U. Kulisch,(Eds) Nonuniform variable precision bisecting Amsterdam: Elsevier 419-428.
215. H. Ratschek and J. Rokne (1993) Test for intersection between plane and box. Computer-Aided Design 25 249-250.
216. H. Ratschek and J. Rokne (1994) Box-sphere intersection tests. Computer-Aided Design 26 579-584.
217. H. Ratschek and J. Rokne (1995) Formulas for the width of interval products. Reliable Computing 1 9-14.
218. H. Ratschek and J. Rokne (1995) Numerical Methods and Error Bounds. G. Alefeld, G. Herzberger (Eds) Determination of the exact sign of a sum. Berlin: Akademie Verlag 198-204.
219. H. Ratschek and J. Rokne (1996) The relationship between a rectangle and a triangle. The Visual Computer 12 360-370.
220. H. Ratschek and J. Rokne (1997) Test for Intersection Between Box and Tetrahedron. Intern. J. Computer Math 65 191-204.
221. H. Ratschek and J. Rokne (1999) Exact computation of the sign of a finite sum. Applied Mathematics and Computation 99 99-127.
222. H. Ratschek and J. Rokne (2000) Exact and Optimal Convex Hulls in 2D. International Journal of Computational Geometry & Applications 10 109-129.
223. H. Ratschek, J. Rokne and M. Lerigier (2001) Robustness in GIS Algorithm Implementation with Application to Line Simplification. Int. J. Geographical Inf. Systems 15 707-720.
224. Ratschek, H., Rokne, J.:A 2D Ellipse-Rectangle Intersection Test.Journal of Mathematical Modelling and Algrithms. Forthcomming.
225. Ratschek, H., Rokne, J.:SCCI-hybrid methods for 2D-curve tracing.Accepted by IJIG.
226. Reliable Computing.Formerly Interval Computations.Institute of New Technologies in Education, St. Petersburg, Vol. 1 (1995).
227. W.C. Rheinboldt (1986) Numerical Analysis of Parametrized Nonlinear Equations New York: John Wiley and Sons
228. S. Rippa (1986) Minimal roughness property of the Delaunay triangulation. Comp. Aided Geometric Design 7 489-497.
229. D.F. Rodgers and J.A. Adams (1990) Mathematical Elements for Computer Graphics New York: McGraw Hill
230. J. Rohn (1989) Systems of linear interval equations. Lin. Alg. Appls 126 39-78.
231. Rokne, J.:Solving systems of linear interval equations.In: [171], pp. 171-182 (1988).
232. J. Rokne (1982) Optimal computation of the Bernstein algorithm for the bound of an interval polynomial. Computing 28 239-246.
233. J. Rokne (1985) A low complexity rational centered form. Computing 34 261-263.
234. J. Rokne (1986) Low complexity k-dimensional centered forms. Computing 37 247-253.
235. J. Rokne and P. Bao (1987) Interval Taylor forms. Computing 39 247-259.
236. J. Rokne (1992) Graphics Gems III. D. Kirk (Eds) Interval arithmetic San Diego: Academic Press 61-66. and pp. 454-457
237. Salesin, D. H.:Epsilon geometry: building robust algorithms from imprecise computations.Ph.D. Thesis, Stanford University (1991).
238. H. Samet (1990) Applications of Spatial Data Structures Reading: Addison Wesley
239. P. Schramm (1994) Intersection problems of parametric surfaces in CAGD. Computing 53 355-364.
240. H. Schwetlick (1979) Numerische Lösung nichtlinearer Gleichungen München-Wien: Oldenburg
241. N.R. Scott (1985) Computer Number Systems and Arithmetic Englewood Cliffs, N.J.: Prentice Hall
242. T.W. Sederberg and D.B. Buehler (1992) Mathematical Methods in Computer Aided geometric Design II. T. Lyche, L. Schumaker,(Eds) Offsets of polynomial Bézier curves: Hermite approximation with error bounds Academic Press 549-558.
243. T.W. Sederberg and R.T. Farouki (1992) Approximation by interval Bézier curves. IEEE Computer Graphics and Applications 12 87-95. September
244. R. Seidel (1997) Handbook of Computational Geometry. J.E. Goodman, J. O'Rourke,(Eds) Convex hull computations Boca Raton: CRC Press LLC 361-375.
245. P.S. Shary (1995) An optimal solution of interval linear equations. SIAM J. Numer. Anal 32 610-630.
246. P.S. Shary (2001) A surprising approach in interval global optimization. Reliable Computing 7 497-505.
247. C.-K. Shene (1994) Test for intersection between plane and a connected compact polyhedron. Computer-Aided Design 26 585-588.
248. Y.I. Shokin Yu.I. (1981) Interval Analysis Novosibirsk: NAUKA (in Russian)
249. L. Simcik and P. Linz (1993) Boundary-based interval Newton's method. Interval Computations 4 89-99.
250. S. Skelboe (1974) Computation of rational interval functions. BIT 14 87-95.
251. Smith, R. E. (ed.):Numerical Grid Generation Techniques.NASA Langley Research Center, (1980).
252. J.M. Snyder and A.H. Barr (1987) Ray tracing complex models containing surface tesselations. Computer Graphics 21 119-126.
253. J.M. Snyder (1992) Interval analysis for computer graphics. Computer Graphics 26 121-130.
254. J.M. Snyder (1992) Generative Modeling for Computer Graphics and CAD New York: Academic Press
255. D. Strip and M. Karasik (1994) SIMD algorithms for intersecting three-dimensional polyhedra. SIAM News 27 1. 3, 10, 11, 13
256. Su, P., Drysdale, R.:A comparison of sequential Delaunay triangulation algorithms.In: Proceedings of the 11th Annual Symposium on Computational Geometry, pp. 61-70 (1995).
257. K.G. Suffern (1990) Quadtree algorithms for contouring functions of two variables. The Computer Journal 33 402-407.
258. K.G. Suffern and E.D. Fackerell (1991) Interval methods in computer graphics. Computers and Graphics 15 331-340.
259. K. Sugihara (1992) A simple method for avoiding numerical error and degeneracy in Voronoi diagram construction. IEICE Trans. Fundamentals E75-A 468-477.
260. K. Sugihara and M. Iri (1994) A robust topology-oriented incremental algorithm for Voronoi diagrams. International Journal of Computational Geometry and Applications 4 179-228.
261. Sun Microsystems:Interval Arithmetic in High performance Technical Computing.Version 1.0. Sun Microsystems, Santa Clara, California (2002).
262. T. Sunaga (1958) Theory of an interval algebra and its application to numerical analysis. RAAG Memoirs 2 547-564.
263. D.C. Sutcliffe (1976) An algorithm for drawing the curve f(x,y). = 0. The Computer Journal 19 246-249.
264. Taligent: http://hpsalo.cern.ch/TaligentDocs/TaligentOnline/DocumentRoot/1.0/Docs/classes/TGEllipse.html (1997).
265. G.L. Taubin (1994) Distance approximations for rasterizing implicit curves. ACM Transactions on Graphics 13 3-42.
266. D.L. Toth (1985) On ray tracing parametric surfaces. Computer Graphics 19 171-179.
267. Tupper, J.:Reliable two-dimensional graphing methods for mathematical formulae with two free variables.Siggraph 2001, Los Angeles, CA., pp. 77-86 (2001)
268. M. Visvalingam and J.D. Whyatt (1991) Cartographic algorithms: Problems of implementation and evaluation and the impact of digitizing errors. Computer Graphics Forum 10 225-235.
269. W.V. Walter (1993) FORTRAN-XSC: A portable Fortran 90 module library for accurate and reliable scientific computation. Computing (Supplement) 9 265-286.
270. M. Warmus (1956) Calculus of approximations. Bull. Acad. Polon. Sci. Cl. III 4 253-259.
271. J.H. Wilkinson (1963) Rounding Errors in Algebraic Processes London: Her Majesty's Stationery Office
272. C.H. Wood (1995) Perceptual responses to line simplification in task-oriented map analysis experiment. Cartographica 32 22-32.
273. M.F. Worboys (1995) GIS. A Computing Perspective London: Taylor & Francis
274. Yap, C. K.:A geometric consistency theorem for a symbolic perturbation theorem.Proceedings of the Fourth Annual ACM Symposium on Computational Geometry, ACM Press, pp. 134-142 (1988).
275. C.K. Yap and T. Dubé (1995) Computing in Euclidean Geometry. Z. Du, F.K. Hwang,(Eds) The exact computation paradigm. Singapore: World Scientific 452-492.
276. C.K. Yap (1997) Handbook of Computational Geometry. J.E. Goodman, J. O'Rourke,(Eds) Robust geometric computations Boca Raton: CRC Press LLC 653-668.
277. Yap, C. K.: http://cs.nyu.edu/exct/inc/nonrobustness.html (2000).
278. R.C. Young (1931) The algebra of many-valued quantities. Math. Ann 104 260-290.
279. W.I. Zangwill and C.B. Garcia (1981) Pathways to solutions of fixed points and equilibria Englewood Cliffs: Prentice-Hall
280. Zeid, I.: CAD/CAM Theory and Practice. McGraw-Hill, New York (1991).