Implicit curves and surfaces: Mathematics, data structures and algorithms

Implicit Curves and Surfaces: Mathematics, Data Structures and Algorithms

Volumn , Issue , 2009, Pages 1-351

  Gomes, Abel J P ^a   Voiculescu, Irina ^b   Jorge, Joaquim ^c   Wyvill, Brian ^d   Galbraith, Callum ^e  

^a UNIVERSITY OF BEIRA INTERIOR   (Portugal)

^b UNIVERSITY OF OXFORD   (United Kingdom)

^c UNIVERSITY OF LISBON   (Portugal)

^d UNIVERSITY OF VICTORIA   (Canada)

^e UNIVERSITY OF CALGARY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 70350274397     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1007/978-1-84882-406-5     Document Type: Book

References (430)

1. A. Adamson and M. Alexa. Approximating and intersecting surfaces from points. In Proceedings of the 1st Eurographics/ACM SIGGRAPH Symposium on Geometry Processing, pages 230-239, Aire-la-Ville, Switzerland, 2003. Eurographics Association.
2. S. Akkouche and E. Galin. Adaptive implicit surface polygonization using marching triangles. Computer Graphics Forum, 20(2):67-80, 2001.
3. G. Albertelli and R. Crawfis. Efficient subdivision of finite-element data sets into consistent tetrahedra. In Proceedings of the IEEE Conference on Visualization' 97, pages 213-219. IEEE Computer Society Press, 1997.
4. G. Alefeld and J. Herzberger. Introduction to Interval Computations. Academic Press, New York, 1983.
5. M. Alexa, J. Behr, D. Cohen-Or, S. Fleishman, D. Levin, and C. Silva. Computing and rendering point set surfaces. IEEE Transactions on Visualization and Computer Graphics, 9(1):3-15, January-March 2003.
6. R. Allégre, A. Barbier, S. Akkouche, and E. Galin. A hybrid shape representation for free-form modeling. In Shape Modeling International 2004, pages 7-18, 2004.
7. E. Allgower and K. Georg. Simplicial and continuation methods for approximating fixed points and solutions to systems of equations. SIAM Review, (1):28-85, 1980.
8. E. Allgower and K. Georg. Introduction to Numerical Continuation Methods. SIAM's Classics in Applied Mathematics. SIAM Press, 2003.
9. E. Allgower and S. Gnutzmann. An algorithm for piecewise linear approximation of implicitly defined two-dimensional surfaces. SIAM Journal on Numerical Analysis, 24(2):452-469, 1987.
10. E. Allgower and S. Gnutzmann. Simplicial pivoting for mesh generation of implicitly defined surfaces. Computer Aided Geometric Design, 8(4):305-325, 1991.
11. E. Allgower and P. Schmidt. An algorithm for piecewise linear approximation of implicitly defined manifold. SIAM Journal on Numerical Analysis, 22(2):322-346, 1985.
12. N. Amenta, M. Bern, and M. Kamvysselis. A new Voronoi-based surface reconstruction algorithm. ACM SIGGRAPH Computer Graphics, 32(5):415-421, 1998.
13. N. Amenta, S. Choi, T. Dey, and N. Leekha. A simple algorithm for homeomorphic surface reconstruction. International Journal of Computational Geometry and Applications, 12(1-2):125-141, 2002.
14. N. Amenta, S. Choi, and R. Kolluri. The power crust. In Proceedings of the 6th ACM Symposium on Solid Modeling and Applications, pages 249-266, Ann Arbor, Michigan, USA, 2001. ACM Press.
15. N. Amenta and Y. Kil. The domain of a point set surface. In M. Alexa and S. Rusinkiewicz, editors, Proceedings of Eurographics Symposium on Point-Based Graphics, pages 139-147. ETH Zurich, Switzerland, Eurographics Association, June 2-4 2004.
16. B. Anderson, J. Jackson, and M. Sitharam. Descartes' rule of signs revisited. American Mathematical Montlhy, 105(5):447-451, 1998.
17. M. Andrade, J. Comba, and J. Stolfi. Affine arithmetic. In Proceedings of Interval 94. St. Petersburg, Russia, March 1994. Available at: www-graphics. stanford.edu/~comba/papers/aa-93-12-petersburg-paper.ps.gz.
18. A. Angelidis, P. Jepp, and M. Cani. Implicit modelling with skeleton curves: controlled blending in contact situations. In Proceedings of the International Conference on Shape Modeling and Applications (SMI 2002), pages 137-144. IEEE Computer Society, May 2002.
19. B. Araújo. Curvature-dependent polygonization of implicit surfaces. Master's thesis, Instituto Superior Técnico, Universidade Técnica de Lisboa, Portugal, February 2008.
20. B. Araújo and J. Jorge. Adaptive polygonization of implicit surfaces. Computers & Graphics, 29(5):686-696, 2005.
21. C. Armstrong, A. Bowyer, S. Cameron, J. Corney, G. Jared, R. Martin, A. Middleditch, M. Sabin, and J. Salmon. Djinn: A Geometric Interface for Solid Modelling: Specification and Report. Information Geometers Ltd., Winchester, England, December 2000.
22. A. Atieg and G. Watson. Use of lp norms in fitting curves and surfaces to data. Australian and New Zealand Industrial and Applied Mathematics Journal, 45:C187-C200, 2004.
23. D. Avis and B. Bhattacharya. Algorithms for computing d-dimensional voronoi diagrams and their duals. In F. Preparata, editor, Computational Geometry, volume 1 of Advances in Computing Research, pages 159-180. JAI Press, London, England, 1983.
24. R. Balsys and K. Suérn. Visualisation of implicit surfaces. Computers & Graphics, 25(1):89-107, February 2001.
25. R. Balsys and K. Suérn. Adaptive polygonisation of non-manifold implicit surfaces. In Proceedings of the International Conference on Computer Graphics, Imaging and Vision: New Trends (CGIV'05), pages 257-263. IEEE Computer Society Press, 2005.
26. C. Barber, D. Dobkin, and H. Huhdanpaa. The quickhull algorithm for convex hulls. ACM Transactions on Mathematical Software, 22(4):469-483, December 1996.
27. A. H. Barr. Global and local deformations of solid primitives. In Computer Graphics (SIGGRAPH 84 Conference Proceedings), volume 18, pages 21-30. ACM Press, 1984.
28. L. Barthe, N. A. Dodgson, M. A. Sabin, B. Wyvill, and V. Gaildrat. Twodimensional potential élds for advanced implicit modeling operators. Computer Graphics Forum, 22(1):23-33, 2003.
29. L. Barthe, V. Gaildrat, and R. Caubet. Combining implicit surfaces with soft blending in a CSG tree. In CSG Conference Series, pages 17-31, Apr 1998.
30. L. Barthe, V. Gaildrat, and R. Caubet. Extrusion of 1D implicit profiles: theory and first application. International Journal of Shape Modeling, 7(2):179-198, 2001.
31. L. Barthe, B. Wyvill, and E. de Groot. Controllable binary CSG operators for soft objects. International Journal of Shape Modeling, 10(2):135-154, 2004.
32. S. Basu, R. Pollack, and M.-F. Roy. Algorithms in Real Algebraic Geometry. Springer-Verlag, New York, 2003.
33. B. Baumgart. Winged edge polyhedron representation. Stanford Artificial Intelligence Project, MEMO AIM-179 STAN-CS-320, Computer Science Department, Stanford University, 1972.
34. P. Baxa, V. Skala, and R. Moucek. Error estimation for isosurfaces. In Proceedings of 6th International Conference on Computational Graphics and Visualization Techniques (COMPUGRAPHICS'97), pages 202-211, Vilamoura, Algarve, Portugal, 1997.
35. P. Baxandall. Vector Calculus. Oxford Applied Mathematics and Computing Science Series. Clarendon Press, Oxford, England, Oxford, UK, 1986.
36. R. Beatson, J. Cherrie, and D. Ragozin. Fast evaluation of radial basis functions: methods for four-dimensional polyharmonic splines. SIAM Journal on Mathematical Analysis, 32(6):1272-1310, 2001.
37. R. Beatson, M. Powell, and A. Tan. Fast evaluation of polyharmonic splines in three dimensions. IMA Journal of Numerical Analysis, 27(3):427-450, 2006.
38. T. Becker and V. Weispfenning. Gröbner Bases. Springer-Verlag, New York, 1993.
39. T. Belytschko, Y. Krongauz, D. Organ, M. Fleming, and P. Krysl. Meshless methods: an overview and recent developments. Computer Methods in Applied Mechanics and Engineering, 139(1-4):3-47, December 1996.
40. J. Berchtold, I. Voiculescu, and A. Bowyer. Interval arithmetic applied to multivariate Bernstein form polynomials. Technical Report 31/98 (http://people.bath.ac.uk/ensab/G-mod/Bernstein/tr-31-98.html), University of Bath, England, 1998.
41. Jakob Berchtold. The Bernstein Basis in Set-theoretic Geometric Modelling. PhD thesis, University of Bath, England, 2000.
42. F. Bernardini, C. Bajaj, J. Chen, and D. Schikore. Automatic reconstruction of 3D CAD models from digital scans. International Journal of Computational Geometry and Applications, 9(4-5):327-369, August-October 1999.
43. F. Bernardini, J. Mittleman, H. Rushmeier, C. Silva, and G. Taubin. The ball-pivoting algorithm for surface reconstruction. IEEE Transactions on Visualization and Computer Graphics, 5(4):349-359, October-December 1999.
44. F. Bigdeli. Triangulations of Convex Polytopes and d-Cubes. PhD thesis, University of Kentucky, Lexington, USA, 1991.
45. A. Blake and M. Isard. Active Contours. Springer-Verlag, Berlin, 1998.
46. C. Blanc and C. Schlick. Extended éld functions for soft objects. In Implicit Surfaces '95, pages 21-32, 1995.
47. J. Blinn. A generalization of algebraic surface drawing. ACM Transactions on Graphics, 1(3):235-256, July 1982.
48. J. Bloomenthal. Modeling the mighty maple. In Computer Graphics (SIGGRAPH 85 Conference Proceedings), volume 19, pages 305-311. ACM Press, 1985.
49. J. Bloomenthal. Polygonization of implicit surfaces. Computer-Aided Geometric Design, 5(4):341-355, November 1988.
50. J. Bloomenthal. An implicit surface polygonizer. In P. Heckbert, editor, Graphics Gems IV, Academic Press Graphics Gems Series, pages 324-349. Academic Press, 1994.
51. J. Bloomenthal. Skeletal Design of Natural Forms. PhD thesis, University of Calgary, 1995.
52. J. Bloomenthal. Surface tiling. In J. Bloomenthal, J. Blinn, M.-P. Cani-Gascuel, A. Rockwood, B. Wyvill, and G. Wyvill, editors, Introduction to Implicit Surfaces, The Morgan Kaufmann Series in Computer Graphics and Geometric Modeling, pages 127-165. Morgan Kaufmann Publishers, Inc., 1997.
53. J. Bloomenthal and K. Ferguson. Polygonization of nonmanifold implicit surfaces. ACM SIGGRAPH Computer Graphics, 29:309-316, August 1995. (SIGGRAPH' 95).
54. J. Bloomenthal and B. Wyvill. Interactive Techniques for Implicit Modeling. Computer Graphics, 24(2):109-116, 1990.
55. G. Bodnár and J. Schicho. A computer program for the resolution of singularities. In H. Hauser, J. Lipman, F. Oort, and A. Quirós, editors, Resolution of Singularities, A Research Textbook in Tribute to Oscar Zariski, volume 181 of Progress in Mathematics, pages 231-238. Birkhäuser, 2000.
56. J. Boissonnat. Geometric structures for three-dimensional shape representation. ACM Transactions on Graphics, 3(4):266-286, 1984.
57. J. Boissonnat and F. Cazals. Smooth surface reconstruction via natural neighbor interpolation of distance functions. In Proceedings of the 16th ACM Symposium on Computational Geometry, pages 223-232. ACM Press, 2000.
58. W. Boothby. An Introduction to Diérentiable Manifolds and Riemannian Geometry. Number 63 in Pure and Applied Mathematics. Academic Press, Inc., New York, 1975.
59. P. Borodin, G. Zachmann, and R. Klein. Consistent normal orientation for polygonal meshes. In Proceedings of Computer Graphics International (CGI'04), pages 18-25. IEEE Computer Society Press, 2004.
60. A. Bowyer. Computing Dirichlet tessellations. The Computer Journal, 24(2):162-166, 1981.
61. A. Bowyer. SVLIS set-theoretic kernel modeller. Information Geometers Ltd. and http://people.bath.ac.uk/ensab/G mod/Svlis, 1995.
62. A. Bowyer, J. Berchtold, D. Eisenthal, I. Voiculescu, and K. Wise. Interval methods in geometric modelling. In Geometric Modelling and Processing 2000. IEEE Computer Society Press, April 2000.
63. A. Bowyer, R. Martin, H. Shou, and I. Voiculescu. Affine intervals in a CSG geometric modeller. In J. Winkler and M. Niranjan, editors, Uncertainty in Geometric Computations, pages 1-14. Kluwer Academic Publishers, 2001.
64. E. Brisson. Representing geometric structures in d dimensions: topology and order. Discrete & Computational Geometry, 9(4):387-426, 1993.
65. T. Brocker and K. Janich. Introduction to Diérential Topology. Cambridge University Press, Cambridge, England, 1982.
66. K. Brodlie. Mathematical Methods in Computer Graphics and Design. Institute of Mathematics and Its Applications Conference Series. Academic Press, 1980.
67. I. Bronstein and K. Semendjajew. Taschenbuch der Mathematik. B. G. Teubner Verlagsgesellschaft, 1991.
68. J. Bruce and P. Giblin. Curves and Singularities. Cambridge University Press, Cambridge, England, 1984.
69. P. Brunet and I. Navazo. Solid representation and operation using extended octrees. ACM Transactions on Graphics, 9(2):170-197, 1990.
70. B. Buchberger. On Finding a Vector Space Basis of the Residue Class Ring Modulo a Zero Dimensional Polynomial Ideal (in German). PhD thesis, Universit ät Innsbruck, Austria, 1965.
71. K. Bühler. Fast and reliable plotting of implicit curves. In J. Winkler and M. Niranjan, editors, Uncertainty in Geometric Computations, pages 15-28. Kluwer Academic Publishers, 2002.
72. K. Bühler and W. Barth. A new intersection algorithm for parametric surfaces based on linear interval estimations. In W. Krämer and J. W. von Gudenberg, editors, Scientific Computing, Validated Numerics, Interval Methods. Kluwer Academic Publishers, 2001.
73. M. Buhmann. Radial Basis Functions. Cambridge University Press, Cambridge, England, 2003.
74. M. P. Cani. An implicit formulation for precise contact modeling between exible solids. In SIGGRAPH '93, pages 313-320. ACM Press, Aug 1993.
75. H. Carr, T. Möller, and J. Snoeyink. Artifacts caused by simplicial subdivision. IEEE Transactions on Visualization and Computer Graphics, 12(2):231-242, March/April 2006.
76. J. Carr, R. Beatson, J. Cherrie, T. Mitchell, W. Fright, B. McCallum, and T. Evans. Reconstruction and representation of 3D objects with radial basis functions. ACM SIGGRAPH Computer Graphics, 35(3):67-76, August 2001.
77. J. Carr, R. Beatson, B. McCallum, W. Fright, T. McLennan, and T. Mitchell. Smooth surface reconstruction from noisy range data. In M Adcock, I. Gwilt, and Y.T. Lee, editors, Proceedings of the 1st International Conference on Computer Graphics and Interactive Techniques in Australasia and South-East Asia (GRAPHITE'03), February 11-14, Melbourne, Australia, pages 119-126. ACM Press, 2003.
78. J. Carr, W. Fright, and R. Beatson. Surface interpolation with radial basis functions for medical imaging. IEEE Transactions on Medical Imaging, 16(1):96-107, February 1997.
79. M. Cermak and V. Skala. Adaptive edge spinning algorithm for polygonization of implicit surfaces. In Proceedings of the Computer Graphics International (CGI'04), pages 36-43. IEEE Computer Society Press, 2004.
80. M. Cermak and V. Skala. Edge spinning algorithm for implicit surfaces. Applied Numerical Mathematics, 49(3-4):331-342, June 2004.
81. S. Chan and E. Purisima. A new tetrahedral tessellation scheme for isosurface generation. Computers & Graphics, 22(1):83-90, January 1998.
82. R. Chandler. A tracking algorithm for implicitly defined curves. IEEE Computer Graphics and Applications, 8(2):83-89, March 1988.
83. S. Chapra and R. Canale. Numerical Methods for Engineers (5th Edition). McGraw-Hill, New York, 2006.
84. E. Chernyaev. Marching cubes 33: construction of topologically correct isosurfaces. Technical Report CN/95-17, European Organization for Nuclear Research (CERN), 1995. Available at: http://wwwinfo.cern.ch/asdoc/psdir/mc.ps. gz.
85. P. Cignoni, F. Ganovelli, C. Montani, and R. Scopigno. Reconstruction of topologically correct and adaptive trilinear surfaces. Computers and Graphics, 24(3):399-418, June 2000.
86. H. Cline, W. Lorensen, and S. Ludke. Two algorithms for the three-dimensional reconstruction of tomograms. Medical Physics, 15(3):320-327, May 1988.
87. E. Cohen, R. Riesenéld, and G. Elber. Geometric Modeling with Splines: An Introduction. A K Peters, Ltd., 2001.
88. D. Cohen-Steiner and F. Da. A greedy Delaunay-based surface reconstruction algorithm. The Visual Computer, 20(1):4-16, April 2004.
89. G. Collins and A.Akritas. Polynomial real root isolation using Descartes' rule of signs. In Proceedings of the 3rd ACM Symposium on Symbolic and Algebraic Computations, Yorktown Heights, New York, pages 272-275, 1976.
90. J. Comba and J. Stolfi. Affine arithmetic and its applications to computer graphics. In Actas do VI Simpósio Brasileiro de Computação Gráfica e Processamento de Imagens (SIBGRAPI'93), pages 9-18, 1993.
91. D. Cox, J. Little, and D. O'Shea. Ideals, Varieties, and Algorithms: an Introduction to Computational Algebraic Geometry and Commutative Algebra. Undergraduate Texts in Mathematics. Springer-Verlag, New York, 1992.
92. H. Coxeter. Discrete groups generated by reections. The Annals of Mathematics, 35(3):588-621, July 1934.
93. H. Coxeter. Introduction to Geometry. John Wiley & Sons, Inc., New York, USA, 1961.
94. B. Curless and M. Levoy. A volumetric method for building complex models from range images. ACM SIGGRAPH Computer Graphics, 30(3):303-312, August 1996.
95. J. Davenport, Y. Siret, and E. Tournier. Computer Algebra - Systems and Algorithms for Algebraic Computation. Academic Press, 1988.
96. M. Dayhoff. A contour-map program for x-ray crystallography. Communications of the ACM, 6(10):620-622, 1963.
97. M. de Berg, M. van Kreveld, M. Overmars, and O. Schwarzkopf. Computational Geometry: Algorithms and Applications. Springer-Verlag, New York, 2000.
98. C. de Boor. A Practical Guide to Splines. Number 27 in Applied Mathematical Sciences. Springer-Verlag, New York (revised edition), 2001.
99. A. de Cusatis Jr., L. de Figueiredo, and M. Gattass. Affine arithmetic and its applications to computer graphics. In Actas do XII Simpósio Brasileiro de Computação Gráfica e Processamento de Imagens (SIBGRAPI'99), pages 65-71, 1999.
100. L. de Figueiredo. Surface intersection using Affine arithmetic. In R. Bartels and W. Davis, editors, Proceedings of the Conference on Graphics Interface'96, pages 168-175. Canadian Information Processing Society, 1996.
101. L. de Figueiredo, J. Gomes, D. Terzopoulos, and L. Velho. Physically based methods for polygonization of implicit surfaces. In R. Booth and A. Fournier, editors, Proceedings of the Conference on Graphics Interface (GI'92), pages 250-257. Morgan Kaufmann Publishers, Inc., 1992.
102. L. de Figueiredo and J. Stolfi. Adaptive enumeration of implicit surfaces with Affine arithmetic. Computer Graphics Forum, 15(5):287-296, 1996.
103. L. de Figueiredo, J. Stolfi, and L. Velho. Approximating parametric curves with strip trees using Affine arithmetic. Computer Graphics Forum, 22(2):171-179, 2003.
104. L. de Floriani and A. Hui. Data structures for simplicial complexes: an analysis and a comparison. In M. Desbrun and H. Pottmann, editors, Proceedings of the 3rd Eurographics Symposium on Geometry Processing (SGP'05), pages 119-128. Eurographics Association, 2005.
105. E. de Forrest. On some methods of interpolation applicable to the graduation of irregular series. Annual Report of the Board of Regents of the Smithsonian Institute for 1871, Smithsonian Institute, 1873.
106. E. de Groot and B. Wyvill. Rayskip: Faster ray tracing of implicit surface animations. In Proceedings of the 3rd International Conference on Computer Graphics and Interactive Techniques in Australasia and Southeast Asia (GRAPHITE'05), pages 31-36. ACM Press, 2005.
107. J. de Loera. Triangulations of Polytopes and Computational Algebra. PhD thesis, Cornell University, Ithaca, USA, 1995.
108. M. Desbrun and M. P. Cani-Gascuel. Active implicit surface for animation. Graphics Interface '98, pages 143-150, Jun 1998.
109. O. Deussen and B. Lintermann. Digital Design of Nature: Computer-Generated Plants and Organics. Springer-Verlag, 2005.
110. T. Dey, J. Giesen, N. Leekha, and R. Wenger. Detecting boundaries for surface reconstruction using co-cones. International Journal of Computer Graphics and CAD/CAM, 16:141-159, 2001.
111. T. Dey and S. Goswami. Tight cocone: a water-tight surface reconstruction. In Proceedings of the 8th ACM Symposium on Solid Modeling and Applications, pages 127-134, Seattle, Washington, USA, 2003. ACM Press.
112. S. Dineen. Multivariate Calculus and Geometry. Undergraduate Mathematics Series. Springer-Verlag, London, 1998.
113. D. Dobkin and M. Laszlo. Primitives for the manipulation of three-dimensional subdivisions. Algorithmica, 4(1):3-32, 1989.
114. D. Dobkin, S. Levy, W. Thurston, and A. Wilks. Contour tracing by piecewise linear approximations. ACM Transactions on Graphics, 9(4):389-423, 1990.
115. A. Doi and A. Koide. An Efficient method of triangulating equi-valued surface by using tetrahedral cells. IEICE Transactions, E74(1):214-224, January 1991.
116. J. Dongarra, J. Croz, S. Hammarling, and I. Duff. A set of level 3 basic linear algebra subprograms. ACM Transactions on Mathematical Software, 16(1):1-17, March 1990.
117. Z. Du, V. Sharma, and C. Yap. Amortized bound for root isolation via sturm sequences. In D. Wang and L. Zhi, editors, Proceedings of the International Workshop on Symbolic-Numeric Computing, Beijing, China, 2005.
118. C. Duarte and J. Oden. H-p clouds: an h-p meshless method. Numerical Methods for Partial Diérential Equations, 12(6):673-705, November 1996.
119. J. Duchon. Interpolation des fonctions de deux variables suivante le principe de la exion des plaques minces. RAIRO Modélisation Mathématique et Analyse Numérique, 10(12):5-12, 1976.
120. J. Duchon. Splines minimizing rotation-invariant semi-norms in Sobolev spaces. In Constructive Theory of Functions of Several Variables, volume 571 of Lecture Notes in Mathematics, pages 85-100. Springer-Verlag, Berlin, 1977.
121. J. Duchon. Sur l'erreur d'interpolation des fonctions de plusieurs variables par les dm splines. RAIRO Modélisation Mathématique et Analyse Numérique, 12(4):325-334, 1978.
122. M. Dürst. Letters: additional reference to marching cubes. ACM SIGGRAPH Computer Graphics, 22(4):72-73, 1988.
123. N. Dyn and S. Rippa. Data-dependent triangulations for scattered data interpolation and finite element approximation. Applied Numerical Mathematics, 12(1-3):89-105, May 1993.
124. B. Eaves. Properly labeled simplexes. In G. Dantzig and B. Eaves, editors, Studies in Optimization, volume 10 of Studies in Mathematics, pages 71-93. Mathematical Association of America, 1974.
125. M. Eck, T. DeRose, T. Duchamp, H. Hoppe, M. Lounsbery, and W. Stuetzle. Multiresolution analysis of arbitrary meshes. ACM SIGGRAPH Computer Graphics, 29:173-182, August 1995.
126. H. Edelsbrunner. Algorithms in Combinatorial Geometry, volume 10 of EATCS Monographs on Theoretical Computer Science. Springer-Verlag, Berlin, 1987.
127. H. Edelsbrunner and E. Mücke. Three-dimensional alpha shapes. ACM Transactions on Graphics, 13(1):43-72, 1994.
128. C. Edwards. Advanced Calculus of Several Variables. Academic Press, New York, 1973.
129. A. Eigenwillig, V. Sharma, and C. Yap. Almost tight recursion tree bounds for the Descartes method. In B. Trager, editor, Proceedings of the 2006 ACM Symposium on Symbolic and Algebraic Computation, pages 71-78. ACM Press, 2006.
130. B. Falcidieno and O. Ratto. Two-manifold cell decomposition of r-sets. Computer Graphics Forum, 11(3):391-404, 1992.
131. C. Fang, T. Chen, and R. Rutenbar. Floating-point error analysis based on Affine arithmetic. In Proceedings of the IEEE International Conference on Acoustics, Speech, and Signal Processing (ICASSP'03), volume 2, pages 561-564. IEEE Press, April 2003.
132. G. Farin. Curves and Surfaces for CAGD: a Pratical Guide. Academic Press, (4th edition), San Diego, 1997.
133. R. Farouki and V. Rajan. On the numerical condition of polynomials in Bernstein form. Computer-Aided Geometric Design, 4:191-216, 1987.
134. R. Farouki and V. Rajan. Algorithms for polynomials in Bernstein form. Computer-Aided Geometric Design, 5:1-26, 1988.
135. G. Fasshauer. Approximate moving least-squares approximation with compactly supported weights. In M. Griebel and M. Schweitzer, editors, Meshfree Methods for Partial Diérential Equations, volume 26 of Lecture Notes in Computer Science and Engineering, pages 105-116. Springer-Verlag, Berlin, 2003.
136. G. Fasshauer. Mesh-free Approximation Methods with MATLAB, volume 6 of Interdisciplinary Mathematical Sciences. World Scientific Publishers, Singapore, 2007.
137. R. Finkel and J. Bentley. Quad trees: A data structure for retrieval on composite keys. Acta Informatica, 4(1):1-9, 1974.
138. S. Fleishman, M. Alexa, D. Cohen-Or, and C. Silva. Progressive point set surfaces. ACM Transactions on Graphics, 22(4):997-1011, October 2003.
139. S. Fleishman, D. Cohen-Or, and C. Silva. Robust moving least-squares fitting with sharp features. ACM Transactions on Graphics, 24(3):544-552, July 2005.
140. M. Floater. Mean value coordinates. Computer-Aided Geometric Design, 20(1):19-27, 2003.
141. M. Floater and K. Hormann. Surface parameterization: a tutorial and survey. In N. Dodgson, M. Floater, and M. Sabin, editors, Advances in Multiresolution for Geometric Modelling, Mathematics and Visualization, pages 157-186. Springer-Verlag, Heidelberg, 2005.
142. M. Floater and A. Iske. Multistep scattered data interpolation using compactly supported radial basis functions. Journal of Computational and Applied Mathematics, 73(1-2):65-78, October 1996.
143. S. Fortune. Voronoi diagrams and Delaunay triangulations. In D.-Z. Du and F. Hwang, editors, Computing in Euclidean Geometry, volume 1 of Lecture Notes Series on Computing, pages 193-230. World Scientific, 1992.
144. D. R. Fowler, H. Meinhardt, and P. Prusinkiewicz. Modeling seashells. Computer Graphics, 26:379-387, 1992.
145. R. Franke. Scattered data interpolation: tests of some methods. Mathematics of Computation, 38(157):181-200, 1982.
146. R. Franke and G. Nielson. Smooth interpolation of large sets of scattered data. International Journal of Numerical Methods in Engineering, 15(11):1681-1704, 1980.
147. M. Frontini and E. Sormani. Some variants of Newton's method with thirdorder convergence. Applied Mathematics and Computation, 140(2-3):419-426, August 2003.
148. H. Fuchs, Z. Kedem, and B. Naylor. On visible surface generation by a priori tree structures. In Proceedings of the 7th Annual Conference on Computer Graphics and Interactive Techniques (SIGGRAPH'80), pages 124-133. ACM Press, 1980.
149. C. Galbraith, P. MacMurchy, and B. Wyvill. Blobtree trees. In Computer Graphics International, pages 78-85, 2004.
150. C. Galbraith, L. Mündermann, and B. Wyvill. Implicit visualization and inverse modeling of growing trees. Computer Graphics Forum, 23(3):351-360, 2004.
151. C. Galbraith, P. Prusinkiewicz, and C. Davidson. Goal oriented animation of plant development. In 10th Western Computer Graphics Symposium, pages 19-32, University of Calgary, 1999. Department of Computer Science.
152. C. Galbraith, P. Prusinkiewicz, and B. Wyvill. Modeling murex cabritii seashell with a structured implicit surface modeler. Visual Computer, 18(2):70-80, 2002.
153. Callum Galbraith. Modeling Natural Phenomena with Implicit Surfaces. PhD thesis, Department of Computer Science, University of Calgary, 2005.
154. I. Gargantini and H. Atkinson. Ray tracing an octree: numerical evaluation of the first intersection. Computer Graphics Forum, 12(4):199-210, 1993.
155. J. Garloff. Convergent bounds for the range of multivariate polynomials. In Interval Mathematics, volume 212 of Lecture Notes in Computer Science, pages 37-56. Springer-Verlag, New York, 1985.
156. M. Garrity. Ray tracing irregular volume data. ACM SIGGRAPH Computer Graphics, 24(5):35-40, November 1990.
157. C. Gauss. Theoria Motus Corporum Coelestium in Sectionibus Conicis Solem Ambientium. Perthes & Besser, Hamburg, Germany, 1809. English translation by C. Harris, reprinted 1963, Dover, New York.
158. A. Geisow. Surface Interrogations. PhD thesis, University of East Anglia, England, 1983.
159. C. Gibson. Singular points of smooth mappings. Number 25 in Research Notes in Mathematics. Pitman Publishing Limited, London, 1979.
160. G. Golub and C. van Loan. Matrix Computations. Johns Hopkins Studies in Mathematical Sciences. The John Hopkins University Press, Baltimore, 1996.
161. A. Gomes. A concise b-rep data structure for stratiéd subanalytic objects. In L. Kobbelt, P. Schroder, and H. Hoppe, editors, Proceedings of the Eurographics/ ACM SIGGRAPH Symposium on Geometry Processing, pages 83-93. Eurographics Association, 2003.
162. A. Gomes, A. Middleditch, and C. Reade. A mathematical model for boundary representations of n-dimensional geometric objects. In W. Bronsvoort and D. Anderson, editors, Fifth Symposium on Solid Modeling and Applications, pages 270-277. ACM Press, 1999.
163. L. Gonzalez-Vega and I. Necula. Efficient topology determination of implicitly defined algebraic plane curves. Computer-Aided Geometric Design, 19(9):719-743, 2002.
164. L. Gonzalez-Vega and G. Trujillo. Multivariate Sturm-Habicht sequences: real root counting on n-rectangles and triangles. Revista Matemática de la Universitat Complutense de Madrid, 10:119-130, 1997.
165. M. Gopi and S. Krishnan. A fast and Efficient projection-based approach for surface reconstruction. In L. Gonçalves and S. Musse, editors, Proceedings of the 15th Brazilian Symposium on Computer Graphics and Image Processing (SIBGRAPI'02), pages 179-186. IEEE Computer Society Press, 2002.
166. D. Grabiner. Descartes' rule of signs: another construction. American Mathematical Montlhy, 1067(9):854-855, 1999.
167. J. Gram. Über entwicklung reeler functionen in reihen mitelst der methode der kleinsten quadrate. Journal für die reine und angewandte Mathematik, 94:41-73, 1883.
168. L. Greengard and V. Rokhlin. A fast algorithm for particle simulations. Journal of Computational Physics, 73(2):325-348, December 1987.
169. A. Guéziec and R. Hummel. Exploiting triangulated surface extraction using tetrahedral decomposition. IEEE Transactions on Visualization and Computer Graphics, 1(4):328-342, December 1995.
170. L. Guibas and J. Stolfi. Primitives for the manipulation of general subdivisions and the computation of voronoi diagrams. ACM Transactions on Graphics, 4(2):74-123, 1985.
171. A. Guy and B. Wyvill. Controlled blending for implicit surfaces. In Implicit Surfaces '95, pages 107-112, 1995.
172. M. Hall and J. Warren. Adaptive polygonization of implicitly defined surfaces. IEEE Computer Graphics & Applications, 10(6):33-42, November 1990.
173. E. Halley. A new, exact and easy method of finding the roots of equations generally, and that without any previous reduction. Philosophical Transactions of the Royal Society of London, 18:136-145, 1694.
174. E. Hansen. A multidimensional interval Newton method. Reliable Computing, 12(4):253-272, 2006.
175. E. Hansen and R. Greenberg. An interval Newton method. Applied Mathematics and Computation, 12(2-3):89-98, 1983.
176. R. Hardy. Multiquadric equations of topography and other irregular surfaces. Journal of Geophysical Research, 76(8):1905-1915, 1971.
177. J. Hart. Sphere-tracing: a geometric method for the antialiased ray tracing of implicit surfaces. The Visual Computer, 12(10):527-545, 1997.
178. J. C. Hart and B. Baker. Implicit modeling of tree surfaces. In Proceedings of Implicit Surfaces '96, pages 143-152, Oct 1996.
179. E. Hartmann. A marching method for the triangulation of surfaces. The Visual Computer, 14(3):95-108, 1998.
180. B. Heap. Algorithms for production of contour maps over an irregular triangular mesh. Research Report NAC 10, National Physical Laboratory, February 1972.
181. W. Heidrich, P. Slusallek, and H.-P. Seidel. Sampling procedural shaders using Affine arithmetic. ACM Transactions on Graphics, 17(3):158-176, 1998.
182. S. Helgason. Diérential Geometry, Lie groups, and Symmetric Spaces. Pure and Appllied Mathematics Series. Academic Press, Inc., New York, 1978.
183. M. Henderson. Computing implicitly defined surfaces: two parameter continuation. Research Report RC 18777, IBM Research Division, T.J. Watson Research Center, New York, March 1993.
184. C. Hermite. L'Extension du Théoréme de M. Sturm á un Systéme d'Équations Simultanées, volume III of Oeuvres de Charles Hermite. Gauthier-Villars, Paris, 1912.
185. B. Von Herzen and A. Barr. Accurate triangulations of deformed, intersecting surfaces. Computer Graphics, 21(4), 1987. (SIGGRAPH'87).
186. N. Higham. Accuracy and Stability of Numerical Algorithms. Society for Industrial and Applied Mathematics (SIAM), 1996.
187. A. Hilton, A.Stoddart, J. Illingworth, and T. Windeatt. Marching triangles: range image fusion for complex object modelling. In Proceedings of the International Conference on Image Processing, pages 381-384. IEEE Press, 1996.
188. H. Hironaka. Subanalytic sets. In Y. Kusunoki, S. Mizohata, M. Nagata, H. Toda, M. Yamaguti, and H. Yoshizawa, editors, Number Theory, Algebraic Geometry and Commutative Algebra, pages 453-493. Kinokuniya Book-Store Co., Ltd., Tokyo, Japan, 1973.
189. H. Hironaka. Triangulations of algebraic sets. In R. Hartshorne, editor, Proceedings of Symposia in Pure Mathematics: Algebraic Geometry, Vol. 29, pages 165-185. American Mathematical Society (AMS), 1974.
190. M. Hirsch. Diérential Topology. Number 33 in Graduate Texts in Mathematics. Springer-Verlag, New York, 1976.
191. .ø Hjelle and M. Dæhlen. Triangulations and Applications. Mathematics and Visualization. Springer-Verlag, New York, 2006.
192. H. Hoppe, T. DeRose, T. Duchamp, J. McDonald, and W. Stuetzle. Surface reconstruction from unorganized points. ACM SIGGRAPH Computer Graphics, 26(2):71-78, July 1992.
193. K. Hormann and M. Floater. Mean value coordinates for arbitrary planar polygons. ACM Transactions on Graphics, 25(4):1424-1441, 2006.
194. W. Horner. A new method of solving numerical equations of all orders, by continuous approximation. Philosophical Transactions of the Royal Society of London, pages 308-335, July 1819.
195. R. Hosie. Native Trees of Canada. Fitzhenry and Whiteside Ltd., Markham, Ontario, Canada, 1990.
196. J. Huang and C. Menq. Combinatorial manifold mesh reconstruction and optimization from unorganized points with arbitrary topology. Computer-Aided Design, 34(2):149-165, February 2002.
197. J. Hubbard and B. Hubbard. Vector Calculus, Linear Algebra, and Diérential Forms: A Uniéd Approach. Prentice-Hall, Englewood Cliffs, 1999.
198. R. Hughes. Minimum-cardinality triangulations of the d-cube for d = 5 and d = 6. Discrete Mathematics, 118(1-3):75-118, August 1993.
199. K. Hui and Z. Jiang. Tetrahedra based adapative polygonization of implicit surface patches. Computer Graphics Forum, 18(1):57-68, March 1999.
200. I. Itenberg and M.-F. Roy. Multivariate Descartes' rule. Contributions to Algebra and Geometry, 36(2):337-346, 1996.
201. X. Jin, C. Tai, J. Feng, and Q. Peng. Convolution surfaces for line skeletons with polynomial weight distributions. Journal of Graphics Tools, 6(3):17-28, 2001.
202. J. Johnson and W. Krandick. Polynomial real root isolation using approximate arithmetic. In Proceedings of the 1997 ACM Symposium on Symbolic and Algebraic Computations, Maui, Hawaii, USA, pages 225-232. ACM Press, 1997.
203. K. Joy, J. Legakis, and R. MacCracken. Data structures for multiresolution representation of unstructured meshes. In G. Farin, H. Hagen, and B. Hamann, editors, Hierarchical Approximation and Geometric Methods for Scientific Visualization, pages 143-170. Springer-Verlag, Heidelberg, 2002.
204. Z. Kacic-Alesic and B. Wyvill. Controlled blending of procedural implicit surfaces. In Graphics Interface 91, pages 236-245, 1991.
205. M. Kallmann and D. Thalmann. Star-vertices: A compact representation for planar meshes with adjacency information. Journal of Graphics Tools, 6(1):7-18, 2001.
206. D. Kalra and A. Barr. Guaranteed ray intersections with implicit functions. Computer Graphics (Proc. of SIGGRAPH '89), 23(3):297-306, 1989.
207. D. Kalra and A. Barr. Guaranteed ray intersections with implicit surfaces. Computer Graphics, 23(4):297-306, 1989. (SIGGRAPH'89).
208. T. Karkanis and A. Stewart. Curvature-dependent triangulation of implicit surfaces. IEEE Computer Graphics and Applications, 21(2):60-69, March 2001.
209. M. Kass, A. Witkin, and D. Terzopoulos. Snakes: active contour models. International Journal of Computer Vision, 23(4):321-332, January 1988.
210. R. Kearfott. Empirical evaluation of innovations in interval branch and bound algorithms for nonlinear systems. SIAM Journal on Scientific Computing, 18(2):574-594, 1997.
211. S.-J. Kim and C.-G. Song. Rendering of unorganized points with octagonal splats. In V. Alexandrov, G. Albada, P. Sloot, and J. Dongarra, editors, Proceedings of the 6th International Conference on Computational Science (ICCS'06), volume 3992, Part II of Lecture Notes in Computer Science, pages 326-333. Springer-Verlag, New York, 2006.
212. A. Knoll, I. Wald, S. Parker, and C. Hansen. Interactive isosurface ray tracing of large octree volumes. In Proceedings of the IEEE Symposium on Interactive Ray Tracing (IRT'06), pages 115-124. IEEE Press, 2006.
213. L. Kobbelt, M. Botsch, U. Schwanecke, and H.-P. Seidel. Feature sensitive surface extraction from volume data. ACM SIGGRAPH Computer Graphics, 35(3):57-66, August 2001.
214. N. Kojekine, I. Hagiwara, and V. Savchenko. Software tools using CSRBFs for processing scattered data. Computers and Graphics, 27(2):311-319, April 2003.
215. J. Kou, Y. Li, and X. Wang. Efficient continuation Newton-like method for solving systems of nonlinear equations. Applied Mathematics and Computation, 174(2):846-853, March 2006.
216. J. Kou, Y. Li, and X. Wang. On modiéd Newton methods with cubic convergence. Applied Mathematics and Computation, 176(1):123-127, 2006.
217. W. Krandick and K. Mehlhorn. New bounds for the Descartes' method. Journal of Symbolic Computation, 41(1):49-66, 2006.
218. C. Kuo and H. Yau. Reconstruction of virtual parts from unorganized scanned data for automated dimensional inspection. Journal of Computing and Information Science in Engineering, 3(1):76-86, March 2003.
219. C. Kuo and H. Yau. A Delaunay-based region-growing approach to surface reconstruction from unorganized points. Computer-Aided Design, 37(8):825-835, July 2005.
220. C. Kuo and H. Yau. A new combinatorial approach to surface reconstruction with sharp features. IEEE Transactions on Visualization and Computer Graphics, 12(1):825-835, January-February 2006.
221. P. Lancaster and K. Salkauskas. Surfaces generated by moving least squares methods. Mathematics of Computation, 37(155):141-158, July 1981.
222. J. Lane and R. Riesenfeld. Bounds on a polynomial. BIT Numerical Mathematics, 21(1):112-117, 1981.
223. S. Lang. Undergraduate analysis. Undergraduate Texts in Mathematics. Springer-Verlag, New York, 1997.
224. S. Lay. Convex Sets and Their Applications. Dover Publications, Mineola, 1982.
225. C. Lee. Subdivisions and triangulations of polytopes. In J. Goodman and J. O'Rourke, editors, Handbook of Discrete and Computational Geometry, The CRC Press Series on Discrete Mathematics and Its Applications, pages 271-290. CRC Press, 1997.
226. A. Legendre. Nouvelles Méthodes pour la Détermination des Orbits des Com étes. Courcier Imprimeur, Paris, France, 1805. Reissued with a supplement, 1806. Second supplement published in 1820. A portion of the appendix was translated in 1929, pages 576-579 in A Source Book in Mathematics, S. Smith (ed.), translated by H. Ruger and H. Walker, McGraw-Hill, New York. Reprinted in two volumes, Dover, New York, 1959.
227. C. Lemke. Bimatrix equilibrium points and mathematical programming. Management Science, 11(7, Series A, Sciences):681-689, May 1965.
228. C. Lemke and J. Howson. Equilibrium points of bimatrix games. SIAM Journal on Applied Mathematics, 12(2):413-423, June 1964.
229. D. Levin. The approximation power of moving least squares methods. Mathematics of Computation, 67(224):1517-1531, October 1998.
230. D. Levin. Mesh-independent surface interpolation. In G. Brunnett, B. Hamann, H. Müller, and L. Linsen, editors, Geometric Modeling for Scientific Visualization, Mathematics and Visualization, pages 37-50. Springer-Verlag, Berlin, 2003.
231. S. Levin. Descartes' rule of signs: how hard can it be? American Mathematical Monthly (submitted for publication), 2002.
232. T. Lewiner, H. Lopes, A. Vieira, and G.Tavares. Efficient implementation of marching cubes' cases with topological guarantees. Journal of Graphics Tools, 8(2):1-15, 2003.
233. S. Li and W. Liu. Meshfree and particle methods and their applications. Applied Mechanics Reviews, 55(1):1-34, 2002.
234. S. Li and W. Liu. Mesh-free Particle Methods. Springer-Verlag, Berlin, 2004.
235. T. Li and X. Wang. On multivariate Descartes' rule: a counterexample. Contributions to Algebra and Geometry, 39(1):1-5, 1998.
236. C. Liang, B. Mourrain, and J.-P. Pavone. Subdivision methods for the topology of 2D and 3D implicit curves. In Proceedings of the Workshop on Computational Methods for Algebraic Spline Surfaces, Oslo, Norway, 2005.
237. D. Libes. Modeling dynamic surfaces with octrees. Computer & Graphics, 15(3), 1991.
238. P. Lienhardt. Topological models for boundary representation: a comparison with n-dimensional generalized maps. Computer-Aided Design, 23(1):59-82, January 1991.
239. C. Lim, G. Turkiyyah, M. Ganter, and D. Storti. Implicit reconstruction of solids from cloud point sets. In Proceedings of the 3rd ACM Symposium on Solid Modeling and Applications, pages 393-402. ACM Press, 1995.
240. C. Loader. Local Regression and Likehood. Statistics and Computing. Springer-Verlag, New York, 1999.
241. S. Lojasiewicz. Triangulation of semianalytic sets. Annali Della Scuola Normale de Pisa, 3rd Series, 18:449-474, 1964.
242. S. Lojasiewicz. Ensembles semi-analytiques. Technical Report Cours Faculté des Sciences d'Orsay, Bures-sur-Yvette, Inst. Hautes études Sci., 1965.
243. A. Lopes. Accuracy in Scientific Visualization. PhD thesis, The University of Leeds, School of Computer Studies, Leeds, England, March 1999.
244. A. Lopes and K. Brodlie. Improving the robustness and accuracy of the marching cubes algorithm for isosurfacing. IEEE Transactions on Visualization and Computer Graphics, 9(1):16-29, 2003.
245. H. Lopes, J. Oliveira, and L. Figueiredo. Robust polygonal adaptive approximation of implicit curves. Computers & Graphics, 26(6):841-852, 2002.
246. H. Lopes and G. Tavares. Structural operators for modeling 3-manifolds. In Proceedings of the 4th ACM Symposium on Solid Modeling and Applications, pages 10-18. ACM Press, May 1997.
247. W. Lorensen and H. Cline. Marching cubes: a high resolution 3D surface construction algorithm. Computer Graphics, 21(4):163-169, July 1987.
248. G. Lorentz. Bernstein Polynomials. Chelsea Publishing Company, New York, 1986.
249. Y. Lu. Singularity Theory and An Introduction to Catastrophe Theory. Universitext. Springer-Verlag, New York, 1976.
250. A. Lundell and S. Weingram. The Topology od CW Complexes. The University Series in Higher Mathematics. Van Nostrand Reinhold Company, 1969.
251. P. MacMurchy. Subdivision surfaces for plant modeling. Master's thesis, University of Calgary, Canada, 2004.
252. V. Madan. Interval Newton method: Hansen-Greenberg approach|some procedural improvements. Applied Mathematics and Computation, 35(3):263-276, 1990.
253. W. Madych. Miscellaneous error bounds for multiquadric and related interpolators. Computers & Mathematics with Applications, 24(12):121-138, 1992.
254. W. Madych and S. Nelson. Multivariate interpolation and conditionally positive definite functions. Approximation Theory and Its Applications, 4(4):77-89, 1988.
255. W. Madych and S. Nelson. Multivariate interpolation and conditionally positive definite functions. ii. Mathematics of Computation, 54(189):211-230, 1990.
256. M. Mäntylä. An Introduction to Solid Modeling. Computer Science Press, 1987.
257. K. Maritaud. Rendu réaliste d'arbres vus de prés en images de synthése. PhD thesis, University de Limoges, France, December 2003.
258. R. Martin, H. Shou, I. Voiculescu, A. Boywer, and G. Wang. Comparison of interval methods for plotting algebraic curves. Computer Aided Geometric Design, 19(7):553-587, July 2002.
259. R. Martin, H. Shou, I. Voiculescu, and G. Wang. A comparison of Bernstein hull and Affine arithmetic methods for algebraic curve drawing. In J. Winkler and M. Niranjan, editors, Uncertainty in Geometric Computations, pages 143-154. Kluwer Academic Publishers, 2001.
260. T. Marzais, Y. Grard, and R. Malgouyres. LP fitting approach for reconstructing parametric surfaces from points clouds. In J. Braz, J. Jorge, M. Dias, and A. Marcos, editors, Proceedings of the 1st International Conference on Computer Graphics Theory and Applications (GRAPP'06), pages 325-330, Setúbal, Portugal, February 25-26 2006. INSTICC (Institute for Systems and Technologies of Information, Control and Communication).
261. S. Matveyev. Approximation of isosurface in the marching cube: ambiguity problem. In R. Bergeron and A. Kaufman, editors, Proceedings of the IEEE Conference on Visualization'94, pages 288-292. IEEE Computer Society Press, 1994.
262. N. Max, P. Hanrahan, and R. Crawfis. Area and volume coherence for Efficient visualization of 3D scalar functions. ACM SIGGRAPH Computer Graphics, 24(5):27-33, November 1990.
263. D. McLain. Drawing contours from arbitrary data points. Computer Journal, 17(4):318-324, 1974.
264. D. Meagher. Geometric modeling using octree encoding. Computer Graphics and Image Processing, 19(2):129-147, June 1982.
265. D. Meagher. Octree generation, analysis and manipulation. Technical Report IPL-TR-027, Image Processing Laboratory, Rensselaer Polytechnic Institute, Troy, New York, April 1982.
266. H. Meinhardt. The Algorithmic Beauty of Sea Shells. Springer-Verlag, New York, 1995.
267. E. Mencl and H. Müller. Graph-based surface reconstruction using structures in scattered point sets. In Proceedings of Computer Graphics International (CGI'98), pages 298-311. IEEE Computer Society Press, 1998.
268. M. Meyer, H. Lee, A. Barr, and M. Desbrun. Generalized barycentric coordinates on irregular polygons. Journal of Graphical Tools, 7(1):13-22, 2002.
269. C. Micchelli. Interpolation of scattered data: distance matrices and conditionally positive definite functions. Constructive Approximation, 2(1):11-12, 1986.
270. D. Michelucci. Reliable representations of strange attractors. In W. Krämer and J. W. von Gudenberg, editors, Scientific Computing, Validated Numerics, Interval Methods, pages 379-389. Kluwer Academic Publishers, 2001.
271. A. Middleditch, C. Reade, and A. Gomes. Set combinations of the mixed-dimension cellular objects of the Djinn API. Computer-Aided Design, 31(11):683-694, September 1999.
272. A. Middleditch, C. Reade, and A. Gomes. Point-sets and cell structures relevant to computer aided design. International Journal of Shape Modeling, 6(2):175-205, 2000.
273. P. Milne. On the Algorithms and Implementation of a Geometric Algebra System. PhD thesis, University of Bath, England, 1990.
274. P. Milne. The zeros of a set of multivariate polynomial equations. Technical Report 90/34, University of Bath, England, 1990.
275. S. Miyajima and M. Kashiwagi. Existence test for solution of nonlinear systems applying Affine arithmetic. Journal of Computational and Applied Mathematics, 199(2):304-309, 2007.
276. T. Möller. A fast triangle-triangle intersection test. ACM Journal of Graphics Tools, 2(2):25-30, 1997.
277. T. Möller and R. Yagel. Efficient rasterization of implicit functions. Technical Report OSU-CISRC-11/95-TR50, The Ohio State University, Department of Computer and Information Science, USA, November 1995.
278. R. Moore. Interval Analysis. Prentice-Hall, 1966.
279. R. Moore. Methods and Applications of Interval Analysis. SIAM (Society for Industrial and Applied Mathematics), 1979.
280. F. Morgado and A. Gomes. A derivative-free tracking algorithm for implicit curves with singularities. In M. Bubak, D. Albada, P. Sloot, and J. Dongarra, editors, Proceedings of the 4th International Conference on Computational Conference (ICCS'04), volume 3039 of Lecture Notes in Computer Science. Springer-Verlag, New York, 2004.
281. J. Morgado and A. Gomes. A generalized false position numerical method for finding zeros and extrema of a real function. In T. Simos and G. Maroulis, editors, Proceedings of the International Conference in Computational Methods in Sciences and Engineering (ICCMSE'05), volume 4 of Lecture Series on Computer and Computational Sciences, pages 425-428. Brill Academic Publishers, 2004.
282. B. Morse, T. Yoo, P. Rheingans, D. Chen, and K. Subramanian. Interpolating implicit surfaces from scattered surface data using compactly supported radial basis functions. In Proceedings of the International Conference on Shape Modeling and Applications, pages 89-98. IEEE Computer Society Press, 2001.
283. B. Mourrain and J.-P. Pavone. Subdivision methods for solving polynomial equations. Technical Report 5658, Institut National de Recherche en Informatique et en Automatique (INRIA), August 2005.
284. B. Mourrain, F. Rouillier, and M.-F. Roy. Bernstein's basis and real root isolation. Technical Report 5149, Institut National de Recherche en Informatique et en Automatique (INRIA), March 2004.
285. B. Mourrain and J.-P. Técourt. Computing the topology of real algebraic surface. In MEGA Electronic Proceedings, 2005.
286. B. Mourrain, M. Vrahatis, and J. Yakoubsohn. On the complexity of isolating real roots and computing with certainty the topological degree. Journal of Complexity, 18(2):612-640, 2002.
287. S. Mudur and P. Koparkar. Interval methods for processing geometric objects. IEEE Computer Graphics & Applications, 4(2):7-17, 1984.
288. D. Muller and F. Preparata. Finding the intersection of two convex polyhedra. Theoretical Computer Science, 7(2):217-236, 1978.
289. H. Müller and M. Wehle. Visualization of implicit surfaces using adaptive tetrahedrizations. In H. Hagen, G. Nielson, and F. Post, editors, Proceedings of the Conference on Scientific Visualization (Dagstuhl'97), pages 243-250. IEEE Computer Society, 1997.
290. L.Mündermann. Inverse Modeling of Plants. PhD thesis, University of Calgary, 2003.
291. J. Munkres. Elements of Algebraic Topology. Addison-Wesley, 1984.
292. J. Munkres. Analysis on Manifolds. Addison-Wesley, 1991.
293. S. Muraki. Volumetric shape description of range data using "Blobby Model". ACM SIGGRAPH Computer Graphics, 25(4):227-235, July 1991.
294. R. Méch and P. Prusinkiewicz. Visual models of plants interacting with their environment. In SIGGRAPH 96 Conference Proceedings, Annual Conference Series, pages 397-410, 1996.
295. B. Natarajan. On generating topologically consistent isosurfaces from uniform samples. The Visual Computer, 11(1):52-62, 1994.
296. I. Navazo. Extended octree representation of general solids with plane faces: model structure and algorithms. Computer Graphics, 13(1):5-16, 1989.
297. I. Navazo, D. Ayala, and P. Brunet. A geometric modeller based on the exact octtree representation of polyhedra. Computer Graphics Forum, 5(2):91-104, 1986.
298. B. Naylor, J. Amanatides, and W. Thibault. Merging BSP trees yields polyhedral set operations. In Proceedings of the 17th Annual Conference on Computer Graphics and Interactive Techniques (SIGGRAPH'90), pages 115-124. ACM Press, 1990.
299. A. Neumaier. Interval Methods for Systems of Equations. Cambridge University Press, 1990.
300. G. Nielson. Scattered data modeling. IEEE Computer Graphics & Applications, 13(1):60-70, January/February 1993.
301. G. Nielson. On marching cubes. IEEE Transactions on Visualization and Computer Graphics, 9(3):283-297, July-September 2003.
302. G. Nielson and R. Franke. Computing the separating surface for segmented data. In Proceedings of the IEEE Conference on Visualization'97, pages 229-233. IEEE Computer Society Press, 1997.
303. G. Nielson and B. Hamann. The asymptotic decider: resolving the ambiguity in marching cubes. In Proceedings of the IEEE Conference on Visualization' 91, pages 83-91. IEEE Computer Society Press, 1991.
304. G. Nielson and J. Sung. Interval volume tetrahedrization. In Proceedings of the IEEE Conference on Visualization'97, pages 221-228. IEEE Computer Society Press, 1997.
305. P. Ning and J. Bloomenthal. An evaluation of implicit surface tilers. IEEE Computer Graphics & Applications, 13(6):33-41, November 1993.
306. H. Nishimura, M. Hirai, and T. Kawai. Object modeling by distribution function and a method of image generation. Transactions of IECE of Japan, 68-D(4):227-234, April 1985.
307. T. Ochotta, C. Scheidegger, J. Schreiner, Y. Lima, R. Kirby, and C. Silva. A uniéd projection operator for moving least squares surfaces. Technical Report UUSCI-2007-006, Scientific Computing and Imaging Institute (SCII), University of Utah, Salt Lake City, April 2007.
308. Y. Ohtake, A. Belyaev, M. Alexa, G. Turk, and H.-P. Seidel. Multilevel partition of unity implicits. ACM Transactions on Graphics, 22(3):463-470, 2003.
309. Y. Ohtake, A. Belyaev, and A. Pasko. Dynamic meshes for accurate polygonization of implicit surfaces with sharp features. In A. Pasko and M. Spagnuolo, editors, Proceedings of the International Conference on Shape Modeling and Applications, pages 74-81. IEEE Computer Society Press, May 2001.
310. Y. Ohtake, A. Belyaev, and H.-P. Seidel. A multi-scale approach to 3D scattered data interpolation with compactly supported basis functions. In Myung-Soo Kim, editor, Proceedings of the Shape Modeling International (SMI'03), pages 153-161. IEEE Computer Society Press, May 2003.
311. Y. Ohtake, A. Belyaev, and H.-P. Seidel. 3d scattered data approximation with adaptive compactly supported radial basis functions. In F. Giannini and A. Pasko, editors, Proceedings of the 6th International Conference on Shape Modeling and Applications, pages 31-39. IEEE Computer Society Press, June 2004.
312. Y. Ohtake, A. Belyaev, and H.-P. Seidel. Multi-scale and adaptive CS-RBFs for shape reconstruction from cloud of points. In N. Dodgson, M. Floater, and M. Sabin, editors, Advances in Multiresolution for Geometric Modelling, pages 143-154. Springer-Verlag, June 2005. Proceedings of the MINGLEWorkshop on Multiresolution in Geometric Modelling, Cambridge, United Kingdom, September 9-11, 2003.
313. P. Olver. Equivalence, Invariants and Symmetry. Cambridge University Press, Cambridge, England, 1995.
314. J. Ortega and W. Rheinboldt. Iterative Solution of Nonlinear Equations in Several Variables. Classics in Applied Mathematics. SIAM (Society for Industrial and Applied Mathematics), Philadelphia, 2000.
315. A. Paiva, L. de Figueiredo, and J. Stolfi. Chaos and graphics: robust visualization of strange attractors using Affine arithmetic. Computers and Graphics, 30(6):1020-1026, December 2006.
316. A. Paiva, H. Lopes, T. Lewiner, and L. Figueiredo. Robust adaptive meshes for implicit surfaces. In Proceedings of the 19th Brazilian Symposium on Computer Graphics and Image Processing (SIBGRAPI '06), pages 205-212. IEEE Press, October 2006.
317. A. Pasko, V. Adzhiev, A. Sourin, and V. Savchenko. Function representation in geometric modeling: concepts, implementation and applications. Visual Computer, 11(8):429-446, 1995.
318. G. Pasko, A. Pasko, M. Ikeda, and T. Kunnii. Bounded blending operations. In Proceedings of the International Conference on Shape Modeling and Applications (SMI 2002), pages 95-103. IEEE Computer Society, May 2002.
319. M. Pauly, R. Keiser, L. Kobbelt, and M. Gross. Shape modeling with pointsampled geometry. ACM Transactions on Graphics, 22(3):641-650, July 2003.
320. B. Payne and A. Toga. Surface mapping brain function on 3D models. IEEE Computer Graphics & Applications, 10(5):33-41, September 1990.
321. P. Pedersen. Counting Real Zeros. PhD thesis, New York University, Department of Computer Science, Courant Institute of Mathematical Sciences, New York, 1991.
322. P. Pedersen. Multivariate Sturm theory. In Proceedings of the 9th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, volume 539 of Lecture Notes in Computer Science, pages 318-332. Springer-Verlag, London, 1991.
323. S. Petitjean and E. Boyer. Regular and non-regular point sets: properties and reconstruction. Computational Geometry: Theory and Applications, 19(2):101-126, July 2001.
324. U. Pinkall and K. Polthier. Computing discrete minimal surfaces and their conjugates. Experimental Mathematics, 2(1):15-36, 1993.
325. S. Plantinga and G. Vegter. Isotopic meshing of implicit surfaces. The Visual Computer, 23(1):45-58, January 2007.
326. H. Pottmann and S. Leopoldseder. A concept for parametric surface fitting which avoids the parametrization problem. Computer-Aided Geometric Design, 20(6):343-362, September 2003.
327. V. Pratt. Direct least-squares fitting of algebraic surfaces. ACM SIGGRAPH Computer Graphics, 21(4):145-152, July 1987.
328. F. Preparata and M. Shamos. Computational Geometry: An Introduction. Texts and Monographs in Computer Science. Springer-Verlag, New York, 1985.
329. W. Press, B. Flannery, S. Teukolsky, and W. Vetterling. Numerical Recipes in C. Cambridge University Press, second edition, 1992.
330. P. Prusinkiewicz and A. Lindenmayer. The Algorithmic Beauty of Plants. Springer-Verlag, New York, 1990.
331. P. Prusinkiewicz, L. Mündermann, R. Karwowski, and B. Lane. The use of positonal information in the modeling of plants. In Eugene Fiume, editor, SIGGRAPH 2001 Conference Proceedings, Annual Conference Series, pages 289-300. ACM SIGGRAPH, 2001.
332. V. Rajan, S. Klinkner, and R. Farouki. Root isolation and root approximation for polynomials in Bernstein form. Technical report, IBM Research Report RC14224, IBM Research Division, T.J. Watson Research Center, Yorktown Heights, New York, November 1988.
333. S. Rana. Topological Data Structures for Surfaces: An Introduction to Geographical Information Science. John Wiley & Sons, Chichester, 2004.
334. A. Raposo and A. Gomes. Polygonization of multi-component non-manifold implicit surfaces through a symbolic-numerical continuation algorithm. In Y.T. Lee and S. M.Shamsuddin, editors, Proceedings of the 4th International Conference on Computer Graphics and Interactive Techniques in Australasia and South-East Asia (GRAPHITE'06), pages 399-406. ACM Press, 2006.
335. H. Ratschek and J. Rokne. Computer Methods for the Range of Functions. Mathematics and Its Applications. Ellis Horwood, Chicester, 1984.
336. Rehder. The Audobon Society Field Guide to North American Seashells. Alfre A. Knopf, Inc., New York, 1981.
337. X. Renbo, L. Weijun, and W. Yuechao. A robust and topological correct marching cube algorithm without look-up table. In Proceedings of the Fifth International Conference on Computer and Information Technology (CIT'05), pages 565-569, Shanghai, China, September 21-23 2005. IEEE Computer Society Press.
338. A. Requicha and R. Tilove. Mathematical foundations of constructive solid geometry: general topology of closed regular sets. Production Automation Project Tech. Memo 27a, University of Rochester, 1978.
339. N. Revol. Interval Newton iteration in multiple precision for the univariate case. Research Report 4334, Institut National de Recherche en Informatique et en Automatique (INRIA), December 2001.
340. W. Rheinboldt. On a moving frame algorithm and the triangulation of equilibirum manifolds. In T. Kuper, R. Seydel, and H. Troger, editors, Bifurcation: Analysis, Algorithms, Applications, volume 79 of International Series of Numerical Mathematics, pages 256-267. Birkhauser, Boston, 1987.
341. A. Ricci. Constructive geometry for computer graphics. Computer Journal, 16(2):157-160, May 1973.
342. J. Rossignac, A. Safonova, and A. Szymczak. Edgebreaker on a corner table: a simple technique for representing and compressing triangulated surfaces. In G. Farin, H. Hagen, and B. Hamann, editors, Hierarchical Approximation and Geometric Methods for Scientific Visualization, pages 41-50. Springer-Verlag, Heidelberg, 2002.
343. F. Rouillier and P. Zimmermann. Efficient isolation of polynomial's real roots. Journal of Computational and Applied Mathematics, 162(1):33-50, 2004.
344. M. Sabin. Contouring: the state of the art. In R. Earnshaw, editor, Fundamental Algorithms for Computer Graphics, volume 17 of NATO ASI Series F: Computer and Systems Sciences, pages 411-482. Springer-Verlag, Berlin, 1985.
345. R. Saleh, K. Gallivan, M. Chang, I. Hajj, D. Smart, and T. Trick. Parallel circuit simulation on supercomputers. Proceedings of the IEEE, 77(12):1915-1931, December 1989.
346. H. Samet. The quadtree and elated hierarchical data structures. ACM Computing Surveys, 16(2), 1984.
347. H. Samet. Foundations of Multidimensional and Metric Data Structures. The Morgan Kaufmann Series in Data Management Systems. Morgan Kaufmann Publishers, 2006.
348. R. Sarraga. Algebraic methods for intersections of quadric surfaces in GMSOLID. Computer Vision, Graphics, and Image Processing, 22:222-238, 1983.
349. V. Savchenko, A. Pasko, O. Okunev, and T. Kuni. Function representation of solids reconstructed from scattered surface points and contours. Computer Graphics Forum, 14(4):181-188, 1995.
350. T. Scavo and J. Thoo. On the geometry of Halley's method. American Mathematical Monthly, 102(5):417-426, 1995.
351. S. Schaefer and J. Warren. Dual marching cubes: primal contouring of dual grids. In Proceedings of the 12th Pacific Conference on Computer Graphics and Applications (PG'04), pages 70-76, Seoul, Korea, October 2004. IEEE Computer Society Press.
352. M. Schmidt. Cutting cubes: visualizing implicit surfaces by adaptive polygonization. The Visual Computer, 10(2):101-115, 1993.
353. R. Schmidt, C. Grimm, and B. Wyvill. Interactive decal compositing with discrete exponential maps. ACM Transactions on Graphics, 25(3):605-613, July 2006.
354. P. Schneider. A Bézier curve-based root-finder. In A. Glassner, editor, Graphics Gems, pages 408-415. Academic Press, San Diego, 1990.
355. R. Seidel and N. Wolpert. On the exact computation of the topology of real algebraic curves. In Proceedings of the 21st ACM Annual Symposium on Computational Geometry, Pisa, Italy, pages 107-115. ACM Press, June 2005.
356. V. Shapiro. Representations of semi-algebraic sets in finite algebras generated by space decompositions. Technical Report CPA91-1 Programmable Automation, Cornell University, Ithaca, NY, February 1991.
357. V. Shapiro. Maintenance of geometric representations through space decompositions. International Journal of Computational Geometry & Applications, 6(4):383-418, 1997.
358. J. Sharma. A family of Newton-like methods based on an exponential model. International Journal of Computer Mathematics, 84(3):297-304, 2007.
359. V. Sharma. Complexity of real root isolation using continued fractions. In Proceedings of the 2007 ACM Symposium on Symbolic and Algebraic Computation, Waterloo, Ontario, Canada, pages 339-346, 2007.
360. R. Sharpe. Diérential Geometry. Graduate Texts in Mathematics. Springer-Verlag, New-York, 1997.
361. A. Sheér, E. Praun, and K. Rose. Mesh parameterization methods and their applications. Foundations and Trends in Computer Graphics and Vision, 2(2):105-171, 2006.
362. C. Shen, J. O'Brien, and J. Shewchuk. Interpolating and approximating implicit surfaces from polygon soup. ACM Transactions on Graphics, 23(3):896-904, 2004.
363. D. Shepard. A two-dimensional interpolation function for irregularly-spaced data. In Proceedings of the 23th ACM National Conference, pages 517-524, New York, 1968. ACM Press.
364. E. Sherbrooke and N. Patrikalakis. Computation of the solutions of nonlinear polynomial systems. Computer-Aided Geometric Design, 10(5):379-405, 1993.
365. M. Shiota. Geometry of Subanalytic and Semialgebraic Sets. Progress in Mathematics. Birkhauser, Boston, 1997.
366. P. Shirley and A. Tuchman. A polygonal approximation to direct scalar volume rendering. ACM SIGGRAPH Computer Graphics, 24(5):63-70, November 1990.
367. H. Shou, R. Martin, I. Voiculescu, A. Bowyer, and G. Wang. Affine arithmetic in matrix form for polynomial evaluation and algebraic curve drawing. Progress in Natural Science, 12(1):77-81, 2002.
368. H. Shou, R. Martin, G.Wang, A. Bowyer, and I. Voiculescu. A recursive Taylor method for algebraic curves and surfaces. In T. Dokken and B. Juettler, editors, Computational Methods for Algebraic Spline Surfaces, pages 135-155. Springer Verlag, New York, 2003.
369. F. Silva and A. Gomes. AIF: a data structure for polygonal meshes. In V. Kumar, M. Gavrilova, C. Tan, and P. L'Ecuyer, editors, Computational Science and Its Applications (ICCSA'03), volume 2669 of Lecture Notes in Computer Science, pages 986-987. Springer-Verlag, New York, 2003.
370. J. Snyder. Generative Modelling for Computer Graphics and CAD. Academic Press, 1992.
371. J. Snyder. Interval analysis for computer graphics. Computer Graphics, 26(2):121-130, July 1992. (SIGGRAPH'92).
372. M. Spencer. Polynomial Real Root Finding in Bernstein Form. PhD thesis, Brigham Young University, 1994.
373. G. Steele. Sun Microsystems Laboratories. Personal communication, 2002.
374. J. Stoer and R. Bulirsch. Introduction to Numerical Analysis (third edition), volume 12 of Texts in Applied Mathematics. Springer-Verlag, New York, 2002.
375. J. Sturm. Mémoire sur la résolution des équations numériques. Bulletin des Sciences de Férussac, 11, 1829.
376. K. Suérn. An octree algorithm for displaying implicitly defined mathematical functions. The Australian Computer Journal, 22(1):2-10, February 1990.
377. K. Suérn. Quadtree algorithms for contouring functions of two variables. The Computer Journal, 33(5):402-407, October 1990.
378. K. Suérn and R. Balsys. Rendering the intersections of implicit surfaces. IEEE Computer Graphics & Applications, 23(5):70-77, September/October 2003.
379. K. Suérn and E. Fackerell. Interval methods in computer graphics. Computers & Graphics, 15(3):331-340, 1991.
380. N. Sukumar. Construction of polygonal interpolants: a maximum entropy approach. International Journal for Numerical Methods in Engineering, 61(12): 2159-2181, 2004.
381. N. Sukumar and E. Malsch. Recent advances in the construction of polygonal finite element interpolants. Archives of Computational Methods in Engineering, 13(1):129-163, 2006.
382. N. Sukumar and A. Tabarraei. Conforming polygonal finite elements. International Journal for Numerical Methods in Engineering, 61(12):2045-2066, 2004.
383. G. Taubin. Estimation of planar curves, surfaces, and nonplanar space curves defined by implicit equations with applications to edge and range image segmentation. IEEE Transactions on Pattern Analysis and Machine Intelligence, 13(11):1115-1138, November 1991.
384. W. Thibault and B. Naylor. Set operations on polyhedra using binary space partition trees. In Proceedings of the 14th Annual Conference on Computer Graphics and Interactive Techniques (SIGGRAPH'87), pages 153-162. ACM Press, 1987.
385. R. Thom. La stabilité topologique des applications polynomiales. Enseignement Math., 8:24-33, 1962.
386. R. Thom. Ensembles et morphisms stratifiés. Bulletin of the American Mathematical Society, 75:240-284, 1969.
387. M. Tigges and B. Wyvill. Texture mapping the blobtree. In Implicit Surfaces '98, pages 123-130, 1998.
388. M. Tigges and B. Wyvill. Python for scene and model description for computer graphics. In IPC 2000, Jan 2000.
389. I. Tobor, P. Reuter, and C. Schlick. Efficient reconstruction of large scattered geometric datasets using the partition of unity and radial basis functions. Journal of WSCG, 12(1-3):467-474, 2004.
390. Proceedings of the 12th International Conference in Central Europe on Computer Graphics, Visualization and Computer Vision (WSCG'04), University of West Bohemia, Campus Bory, Plzen-Bory, Czech Republic, February 2-6, 2004.
391. M. Todd. On triangulations for computing fixed points. Mathematical Programming, 10(1):322-346, 1976.
392. E. Tsigaridas and I. Emiris. Univariate polynomial real root isolation: continued fractions revisited. In Y. Azar and T. Erlebach, editors, Proceedings of the 13th European Symposium on Algorithms, volume 4168 of Lecture Notes in Computer Science, pages 817-828. Springer-Verlag, New York, 2006.
393. G. Turk and J. O'Brien. Shape transformations using variational implicit surfaces. ACM SIGGRAPH Computer Graphics, 33(3):335-342, August 1999.
394. G. Turk and J. O'Brien. Modeling with implicit surfaces that interpolate. ACM Transactions on Graphics, 21(4):855-873, October 2002.
395. J. Uspensky. Theory of Equations. McGraw-Hill, New York, 1948.
396. A. van Gelder and J. Wilhelms. Topological considerations in isosurface generation. ACM Transactions on Graphics, 13(4):337-375, 1994.
397. K. van Overveld and B. Wyvill. Shrinkwrap: An Efficient adaptive algorithm for triangulating an iso-surface . The Visual Computer, 20(6):362-369, 2004.
398. L. Velho. Adaptive polygonization of implicit objects. In Proceedings of 1990 Australian Graphics Conference (AUSGRAPH'90), pages 339-343, Melbourne, Australia, September 1990.
399. L. Velho. Adaptive polygonization of implicit surfaces using simplicial decomposition and boundary constraints. In C. Vandoni and D. Duce, editors, Proceedings of 11th Annual Conference of the European Association for Computer Graphics (EUROGRAPHICS'90), pages 125-136, Montreux, Switzerland, September 1990. Elsevier Sciense Publishers B.V. (North-Holland).
400. L. Velho, L. Figueiredo, and J. Gomes. A uniéd approach for hierarchical adaptive tesselation of surfaces. ACM Transactions on Graphics, 18(4):329-360, 1990.
401. L. Velho, L. Figueiredo, and J. Gomes. A methodology for piecewise linear approximation of surfaces. Journal of the Brazilian Computer Society, 3(3):329-360, April 1997.
402. I. Voiculescu. Implicit Function Algebra in Set-theoretic Geometric Modelling. PhD thesis, University of Bath, England, 2001.
403. I. Voiculescu, J. Berchtold, A. Bowyer, R. Martin, and Q. Zhang. Interval and Affine arithmetic for surface location of power-and Bernstein-form polynomials. In R. Cipolla and R. Martin, editors, The Mathematics of Surfaces IX, Proceedings of the 9th IMA Conference on the Mathematics of Surfaces, pages 410-423. Springer-Verlag, New York, 2000.
404. E. Wachspress. Rational Finite Element Basis. Mathematics in Science & Engineering. Academic Press, New York, 1975.
405. D. Watson. Computing the n-dimensional Delaunay tessellation with application to Voronoi polytopes, The Computer Journal, 24(2):167-172, 1981.
406. D. Watson. Contouring: A Guide to the Analysis and Display of Spatial Data. Computer Methods in the Geosciences. Pergamon Press, Oxford, 1992.
407. S. Weerakoom and T. Fernando. A variant of Newton's method with accelerated third-order convergence. Applied Mathematics Letters, 13(8):87-93, November 2000.
408. C. Weigle and D. Banks. Complex-valued contour meshing. In R. Yagel and G. Nielson, editors, Proceedings of the IEEE Conference on Visualization'96, pages 173-181. IEEE Computer Society Press, 1996.
409. H.Wendland. Piecewise polynomial, positive definite and compactly supported radial basis functions of minimal degree. Advances in Computational Mathematics, 4(1):389-396, December 1995.
410. W. Wessner. Mesh Refinement Techniques for CAD Tools. PhD thesis, Technische Universität Wien, Austria, November 2006.
411. J. Whitehead. Combinatorial homotopy. I. Bulletin American Mathematical Society, 55:213-245, 1949.
412. J. Whitehead. Combinatorial homotopy. II. Bulletin American Mathematical Society, 55:453-496, 1949.
413. H. Whitney. Complexes of manifolds. Proceedings of the National Academy of Sciences (U.S.A.), 33:10-11, 1947.
414. H. Whitney. Elementary structure of real algebraic varieties. Annals of Mthematics, 66(3):545-556, November 1957.
415. B. Wilson. The Growing Tree. The University of Massachusetts Press, Amherst, 1984.
416. W. Woolhouse. Explanation of a new method of adjusting mortality tables, with some observations upon Mr. Makeham's modifications of Gompertz's theory. Journal of the Institute of Actuaries, 15:389-410, 1870.
417. X. Wu. A new continuation Newton-like method and its deformation. Applied Mathematics and Computation, 112(1):75-78, June 2000.
418. B. Wyvill, E. Galin, and A. Guy. Extending the CSG tree. warping, blending and boolean operations in an implicit surface modeling system. Computer Graphics Forum, 18(2):149-158, 1999.
419. B. Wyvill, E. Galin, and A. Guy. The blob tree, warping, blending and Boolean operations in an implicit surface modeling system. Computer Graphics Forum, 18(2):149-158, June 1999.
420. B. Wyvill and K. van Overveld. Polygonization of implicit surfaces with constructive solid geometry. Journal of Shape Modelling, 2(4):257-274, 1996.
421. G. Wyvill, 2001. Personal communication.
422. G. Wyvill, T. Kunii, and Y. Shirai. Space division for ray tracing in CSG. IEEE Computer Graphics & Applications, 6(4):227-234, April 1986.
423. G. Wyvill, C. McPheeters, and B. Wyvill. Data structure for soft objects. The Visual Computer, 2(4):227-234, August 1986.
424. J. Yang, C. Zhu, and H. Zhang. Surface reconstruction with least square reproducing kernel and partition of unity. In Workshops Proceedings of the 16th International Conference on Artificial Reality and Telexistence (ICAT'06), pages 375-380, Hangzhou, China, November/December 2006. IEEE Computer Society Press.
425. H. Yau, C. Kuo, and C. Yeh. Extension of surface reconstruction algorithm to the global stitching and repairing of STL models. Computer-Aided Design, 35(5):477-486, 2002.
426. M. Zettler and J. Garloff. Robustness analysis of polynomials with polynomial parameter dependency using Bernstein polynomials. IEEE Transactions on Automatic Control, 43(3):425-431, March 1998.
427. Q. Zhang and R. Martin. Polynomial evaluation using Affine arithmetic for curve drawing. In Proceedings of the Eurographics UK Conference, pages 49-56, 2000.
428. Y. Zhou, B. Chen, and A. Kaufmann. Multiresolution tetrahedral framework for visualizing regular volume data. In Proceedings of the IEEE Conference on Visualization'97, pages 135-142. IEEE Computer Society Press, 1997.
429. Y. Zhou, B. Chen, and Z. Tang. An elaborate ambiguity detection method for constructing isosurfaces within tetrahedral meshes. Computer & Graphics, 19(3):353-364, March 1995.
430. M. Zwicker, M. Pauly, O. Knoll, and M. Gross. Pointshop 3D: an interactive system for point-based surface editing. ACM Transactions on Graphics, 21(3):322-329, July 2002.