Academia.eduAcademia.edu

Outline

Title
Abstract
Introduction
References

Polynomial Surface Patch Representations

Profile image of Chandrajit BajajChandrajit Bajaj

1994

visibility

…

description

27 pages

link

1 file

Abstract
sparkles

AI

This paper presents an approach to the design and analysis of geometric algorithms for operations on polynomial curves and surfaces, with a focus on abstract data types. It explores implicit and parametric representations of polynomial surfaces, discussing their theoretical implications and practical applications. The work introduces conditions for generating smooth implicit surface patches and illustrates the expansion of triangulations to create seamless geometric meshes.

Related papers

Implicitization of rational surfaces by means of polynomial interpolation
Javier Martinez

Computer Aided Geometric Design, 2002

A method for finding the implicit equation of a surface given by rational parametric equations is presented. The method is based on an efficient computation of the resultant by means of classical multivariate polynomial interpolation. The used approach considerably reduces the problem of intermediate expression swell and it can easily be implemented in parallel. 

View PDFchevron_right
Implicit representation of rational parametric surfaces
John Canny

1992

In many applications we need to compute the implicit representation of rational parametric surfaces. Previously, resultants and Gröbner bases have been applied to this problem. However, these techniques at times result in an extraneous factors along with the implicit equation and fail altogether when a parametrization has base points. In this paper we present algorithms to implicitize rational parametric surfaces with and without base points.

View PDFchevron_right
A univariate resultant-based implicitization algorithm for surfaces
Sonia Pérez-Díaz

Journal of Symbolic Computation, 2008

In this paper, we present a new algorithm for computing the implicit equation of a rational surface V from a rational parametrization P(t). The algorithm is valid independent of the existence of base points, and is based on the computation of polynomial gcds and univariate resultants. Moreover, we prove that the resultant-based formula provides a power of the implicit equation. In addition, performing a suitable linear change of parameters, we prove that this power is indeed the degree of the rational map induced by the parametrization. We also present formulas for computing the partial degrees of the implicit equation.

View PDFchevron_right
Implicitizing rational surfaces with base points using the method of moving surfaces
Jianmin Zheng

Topics in Algebraic Geometry and Geometric Modeling, 2003

The method of moving planes and moving quadrics can express the implicit equation of a parametric surface as the determinant of a matrix M. The rows of M correspond to moving planes or moving quadrics that follow the parametric surface. Previous papers on the method of moving surfaces have shown that a simple base point has the effect of converting one moving quadric to a moving plane. A much more general version of the method of moving surfaces is presented in this paper that is capable of dealing with multiple base points. For example, a double base point has the effect (in this new version) of converting two moving quadrics into moving planes, eliminating one additional moving quadric, and eliminating a column of the matrix (i.e., a blending function of the moving surfaces)-thereby dropping the degree of the implicit equation by four. Furthermore, this is a unifying approach whereby tensor product surfaces, pure degree surfaces, and "corner-cut" surfaces, can all be implicitized under the same framework and do not need to be treated as distinct cases. The central idea in this approach is that if a surface has a base point of multiplicity k, the moving surface blending functions must have the same base point, but of multiplicity k − 1. Thus, we draw moving surface blending functions from the derivative ideal I , where I is the ideal of the parametric equations. We explain the general outline of the method and show how it works in some specific cases. The paper concludes with a discussion of the method from the point of view of commutative algebra.

View PDFchevron_right
On the isotopic meshing of an algebraic implicit surface
Daouda Diatta

Journal of Symbolic Computation, 2012

We present a new and complete algorithm for computing the topology of an algebraic surface S given by a squarefree polynomial in ◗[X,Y,Z]. Our algorithm involves only subresultant computations and entirely relies on rational manipulation, which makes it direct to implement. We extend the work in [15], on the topology of non-reduced algebraic space curves, and apply it to the polar curve or apparent contour of the surface S. We exploit simple algebraic criterion to certify the pseudo-genericity and genericity position of the surface. This gives us rational parametrizations of the components of the polar curve, which are used to lift the topology of the projection of the polar curve. We deduce the connection of the two-dimensional components above the cell defined by the projection of the polar curve. A complexity analysis of the algorithm is provided leading to a bound in e OB(d 15 τ) for the complexity of the computation of the topology of an implicit algebraic surface defined by integer coefficients polynomial of degree d and coefficients size τ. Examples illustrate the implementation in Mathemagix of this first complete code for certified topology of algebraic surfaces.

View PDFchevron_right
Representing rational curve segments and surface patches using semi-algebraic sets
Sonia Pérez-Díaz

Computer Aided Geometric Design, 2019

We provide a framework for representing segments of rational planar curves or patches of rational tensor product surfaces with no singularities using semi-algebraic sets. Given a rational planar curve segment or a rational tensor product surface patch with no singularities, we find the implicit equation of the corresponding unbounded curve or surface and then construct an algebraic box defined by some additional equations and inequalities associated to the implicit equation. This algebraic box is proved to include only the given curve segment or surface patch without any extraneous parts of the unbounded curve or surface. We also explain why it is difficult to construct such an algebraic box if the curve segment or surface patch includes some singular points such as self-intersections. In this case, we show how to isolate a neighborhood of these special points from the corresponding curve segment or surface patch and to represent these special points with small curve segments or surface patches. This framework allows us to dispense with expensive approximation methods such a voxels for representing surface patches.

View PDFchevron_right
Approximate conversion of surface representations with polynomial bases
Horst Nowacki

Computer Aided Geometric Design, 1985

In exchanging data between different geometric modelling systems conversions of curve and surface representations are required in order to compensate for differences in the types of polynomial bases. maximum polynomial degrees, and mesh sizes. For this purpose a set of methods is described in this paper, which are to be used in the context of data exchanges between surface modellers by means of the VDA/VDMA standard surface interface.

View PDFchevron_right
Using implicit equations of parametric curves and surfaces without computing them: Polynomial algebra by values
Gema Diaz

Computer Aided Geometric Design, 2013

The availability of the implicit equation of a plane curve or of a 3D surface can be very useful in order to solve many geometric problems involving the considered curve or surface: for example, when dealing with the point position problem or answering intersection questions. On the other hand, it is well known that in most cases, even for moderate degrees, the implicit equation is either difficult to compute or, if computed, the high degree and the big size of the coefficients makes extremely difficult its use in practice. We will show that, for several problems involving plane curves, 3D surfaces and some of their constructions (for example, offsets), it is possible to use the implicit equation (or, more precisely, its properties) without needing to explicitly determine it. We replace the computation of the implicit equation by the evaluation of the considered parameterizations in a set of points and its use, in order to deal with the considered geometric problems, is translated into one or several generalized eigenvalue problems on matrix pencils (depending again on several evaluations of the considered parameterizations). This is the so called "Polynomial Algebra by Values" approach where the huge polynomial equations coming from Elimination Theory (e.g., using resultants) are replaced by big structured and sparse numerical matrices. For these matrices there are well known numerical techniques allowing to provide the results we need to answer the geometric questions on the considered curves and surfaces.

View PDFchevron_right
Automatic parameterization of rational curves and surfaces IV: algebraic space curves
Chandrajit Bajaj

ACM Transactions on Graphics, 1989

For an irreducible algebraic space curve C that is implicitly defined as the intersection of two algebraic surfaces, f (x, y, z) = 0 and g(r, y, z) = 0, there always exists a birational correspondence between the points of C and the points of an irreducible plane curve P, whose genus is the same as that of C. Thus C is rational iff the genus of P is zero. Given an irreducible space curve C = ( f n g), with f and g not tangent along C, we present a method of obtaining a projected irreducible plane curve P together with birational maps between the points of P and C. Together with [4], this method yields an algorithm to compute the genus of C, and if the genus is zero, the rational parametric equations for C. As a biproduct, this method also yields the implicit and parametric equations of a rational surface S containing the space curve C.

View PDFchevron_right
Efficient representation and manipulation of quadratic surfaces using Geometric Algebras
Stéphane Breuils

arXiv (Cornell University), 2019

Quadratic surfaces gain more and more attention among the Geometric Algebra community and some frameworks were proposed in order to represent, transform, and intersect these quadratic surfaces. As far as the authors know, none of these frameworks support all the operations required to completely handle these surfaces. Some frameworks do not allow the construction of quadratic surfaces from control points when others do not allow to transform these quadratic surfaces. However, if we consider all the frameworks together, then all the required operations over quadratic are covered. This paper presents a unification of these frameworks that enables to represent any quadratic surfaces either using control points or from the coefficients of its implicit form. The proposed approach also allows to transform any quadratic surfaces and to compute their intersection and to easily extract some geometric properties.

View PDFchevron_right

References (67)

  1. S. Abhyankar and C. Bajaj. Automatic Rational Parameterization of Curves and Surfaces I: Conics and Conicoids. Computer Aided Design, 19(1):11-14,1987. Figure 18: Shape Control of Smooth Approximations of a Polyhedron
  2. S. Abhyankar and C. Bajaj. Automatic Rational Parameterization of Curves and Surfaces II: Cubics and Cubicoids. Computer Aided Design, 19(9):499-502,1987.
  3. S. Abhyankar and C. Bajaj. Automatic Rational Parameterization of Curves and Surfaces III: Algebraic Plane Curves. Computer Aided Geometric Design, 5(1):309-321, 1988.
  4. S. Abhyankar and C. Bajaj. Automatic Rational Parameterization of Curves and Surfaces IV; Algebraic Space Curves. ACM Transactions on Graphics, 8(4):324 -333, 1989.
  5. P. Alfcld. Scattered Data Interpolation in Three or More Variables. In T. Lyche and L. Schumaker, editors, Mathematical Mcthods in Computer Aided Geomeiric Design, pages 1-3~. Academic Press, 1989.
  6. Allgower, E., and Gnutzmann, 5.,. Simplicial Pivoting for Mesh Generation of Implicitly Defined Surfaces. Computer Aided Geomtric Design, pages 305-325, Hl91.
  7. C. Bajaj. Geometric modeling with algebraic surfaces. In D. Handscomb, editor, The Mathematics of Surfaces III, pages 3-48. Oxford Univ. Press, 1988.
  8. C. Bajaj. The Emergence of Algebraic Curves and Surfaces in Geometric Design. In R. Martin, editor, Directions in Geometric Computing, pages 1 -29. Information Geometers Press, 1993.
  9. C. Bajaj, F. Bernardini, and G. Xu. Reconstruction of Surfaces and Surfaces-on-Surfaces from Unorganized Weighted Points. Computer Science Technical Report, CS-94-001, Purdue University, 1994.
  10. C. Bajaj, J. Chen, and G. Xu. Mode/illg with Cubic A•Patches. Computer Science Technical Report, CSD-TR-93-02, Purdue University, 1993.
  11. C. Bajaj, J. Chen, and G. Xu. Free form surface design with a-patches. In Proceedings of Graphics Interface '94, pages x-y, Banff, Canada., 1994.
  12. C. Bajaj, J. Chen, and G. Xu. Smooth Low Degree Approximations of Polyhedra. Computer Science Technical Report, CSD-TR-94-002, Purdue University, 1994.
  13. C. Bajaj and I. Ihm. at Smoothing of Polyhedra with Implicit Algebraic Splines. SIGGRAPH'92, Computer Graphics, 26(2):79-88, H192.
  14. C. Bajaj and A. Royappa. The Robus~Display of Arbitrary Ra~ional Parame~rjc Surfaces. In Curves and Sur/aces in Computer Vision and Graphics JII, pages 70 -80, Boston, MA, 1992.
  15. C. Bajaj and A. Royappa. Finite Representation of Parametric Curves and Surfaces. In Proc. of IFIP TC 5/WG 5.10 II Conference on Geometric Modeling in Computer Graphics, pages x-y, Genova, Italy, 1993.
  16. C. Bajaj and A. Royappa. Topologically Correct Approximations of Arbitrary Rational Parametric Surfaces. Compu~er Science Technical Repor~, CAPO 93-06, Purdue Universi~y, 1993.
  17. C. Bajaj and G. Xu. Piecewise Rational Approximation of Real Algebraic Curves. Compu~er Science Technical Report, CAPO-91-19, Purdue University, 1991.
  18. C. Bajaj and G. Xu. A-Splines: Local Interpolation and Approximation using Ck-Continuous Piecewise Real Algebraic Curves. Compu~er Science Technical Report, CAPO-92-44, Purdue Univcrsi~y, 1992.
  19. C. Bajaj and G. Xu. NURBS Approximation of Surface-Surface Intersection Curves. Compu~er Science Technical Repor~, CAPO-92-17, Purdue University, 1992.
  20. C. Bajaj and G. Xu. Piecewise Rational Approximation of Real Algebraic Surfaces. Computer Science Technical Report, CAPO 93•21, Purdue University, 1993.
  21. C. Bajaj and G. Xu. Ra~ional spline approximations of real algebraic curves and surfaces. In H.P. Dikshit and C. Michelli, editors, Advances in Computational Mathematics, pages x-x. World Scientific Publishing Co., 1994.
  22. Beeker, E. Smoothing of Shapes Designed with Free Form Surfaces. Computer Aided Design, lS(4):224-232, 1986.
  23. Bloomcnthal, J. Polygoniza~ionof Implicit Surfaces. Computer Aided Ge.omelric Design, 5:341-355, 19S5.
  24. Chiyokura, H., and Kimura, F. Design orSolids with Free-form Surfaces. Computer Graphics, 17(3):2S9-298, 1983.
  25. Chuang, J.,. Surface Approximations in Geomtric Modeling. PhD ~hesis, Computer Science, Purdue Uni- versity, 1990.
  26. Chui, C. Multivariate Splines. Regional Conference Series in Applied Mathematics, 19S5.
  27. R. Clough and J. Tocher. Finite Element Stiffness Matrices for Analysis of Plates In Bending. In Proceedings of Conference on Matric Methods in Structural Analysis, 1965.
  28. G. Collins. Quantifier Elimination for Real Closed Fields: A Guide to the Literature, in computer algebra, symbolic and algebraic computation, 19S3.
  29. W. Dahmen. Smooth piecewise quadratic surfaces. In T. Lyche and 1. Schumaker, editors, Mathematical Methods in Computer Aided Geometric Design, pages lSl-193. Academic Press, Boston, 19S9.
  30. W. Dahmen and T-M. Thamm-Schaar. Cubicoids: modeling and visualization. Computer Aided Geometric Design, 10:93-108,1993.
  31. Dahmen, W. and Micchelli, C. Recent Progress in Multivariate Splines. In L. Schumaker C. Chui and J. Word, editors, Approximation Theory IV, pages 27-121. Academic Press, 19S3.
  32. DeRose, T. Rational Bezier Curves and Surfaces on Projective Domains. In G. Farin, editor, NURBS for Curve and Surface Design, pages 1-14. SIAM, 1991.
  33. II. Edelsbrunner. Algorithms in Combina~orial Geometry. Springer Verlag, 1987.
  34. G. Farin. Triangular Bernstein-Bezier patches. Computer Aided Geometric Design, 3:83-127, 1986.
  35. Fortune S.,. Numerical Stability of Algorithms for 2D Delaunay Triangulations. In Proc. of the 8th ACM Symposium on Computational Geometry, pages 83-92, 1989.
  36. Garrity, T., and Warren, J. Geometric continuity. Computer Aided Geometric Design, 8:51-65, 1991.
  37. Geisow, A.,. Surface Interrogations. PhD thesis, University of Anglia, School of computing Studies and Accountancy, 1983.
  38. Gregory, J., and Charrot, P. A C l Triangular Interpolation Patch for Computer Aided Geometric Design. Computer Graphics and Image Processing, 13:80-87, 1980.
  39. B. Guo. Modeling Arbitrary Smooth Objects with Algebraic Surfaces. PhD thesis, Computer Science, Cornell University, 1991.
  40. B. Guo. Surface generation using implicit cubics. In N .M. Patrikalakis, editor, Scientific Visualizaton of Physical Phenomena, pages 485-530. Springer-Vcrlag,Tokyo, 1991.
  41. B. Guo. Non-splitting Macro Patches for Implicit Cubic Spline Surfaces. Computer Graphics Forum, 12(3)0434 -445, 1993.
  42. Hagen, H., and Pottmann, H. Curvature Continuous Triangular Interpolants. Mathematical Methods in Computer Aided Geometric Design, pages 373-384, 1989.
  43. Hall, M., and Warren, J. Adaptive Polygonalization of Implicitly Defined Surfaces. IEEE Computer Graphics and Applications, pages 33-42, 1990.
  44. P. Henrici. Applied and Computational Complex Analysis, 1988.
  45. Herron, G. Smooth Closed Surfaces with Discrete Triangular Interpolants. Computer Aided Geometric Design, 2(4):297-306, 1985.
  46. IIollig, I<. Multivariate Splines. SIAM J. on Numerical Analysis, 19:1013-1031,1982.
  47. Liu, D., and Hoschek, J. GC I Continuity Conditions Between Adjacent Rectangular and Triangular Bezier Surface Patches. Computer Aided Design, 21:194-200, 1989.
  48. Lorensen, W., and Cline, H. Marching Cubes: A High Resolution 3D Surface Construction Algorithm. Computer Graphics, 21:163-169, 1987.
  49. Micchelli, C., and Prautzsch, H.,. Computing Surfaces Invariant under Subdivision. Computer Aided Geomdric Design, 4:321-328, 1987.
  50. D. Moore and J. Warren. Approximation of dense scattered data using algebraic surfaces. Tn Proc. of the 24th Hawaii Inti. Conference 011 System Sciences, pages 681-690, Kauai, Hawaii, 1991.
  51. Nielson, G. A Transfinite Visually Continuous Triangular Interpolant. In G. Farin, editor, Geometric Modeling Applications and Ne.w Trends. SIAM, 1986.
  52. Patrikalakis, N., and Kriezis, G. Representation of Piecewise Continuous Algebraic Surfaces in Terms of B-splincs. The Visual Computer, 5(6):360-374, Dec. 1989.
  53. Peters, J. Local Cubic and BiCubic C 1 Surface Interpolation with Linearly Varying Boundary Normal. Computer Aided Geometric Design, 7:499-516, 1990.
  54. Peters, J. Smooth Interpolation of a Mesh of Curves. Constructive Approximation, 7:221-246, 1991.
  55. Piper, B. Visually Smooth Interpolation with Triangular Bezier Patches. In G. Farin, editor, Geometric Modeling: Algorithms and New Trends. SIAM, 1987.
  56. Powell, M., and Sabin, M. Piecewise Quadratic Approximations on Triangles. ACM Trans. on Math. Software, 3:316-325, 1977.
  57. Ramshaw, L. Beziers and B"splines as Multiaffine Maps. In Theoretical Foundations 0/ Computer Graphics and CAD. Springer Verlag, 1988.
  58. Rockwood, A., Heaton, K., and Davis, T. Rcal-Time Rendering of Trimmed Surfaces. Computer Graphics, 23(3P07-116,1989.
  59. R. Sarraga. G 1 interpolation of generally unrestricted cubic Bezier curves. Computer Aided Geometric Design, 4:23-39, 1987.
  60. T.W. Sederberg. Piecewise algebraic surface patches. Computer Aide.d Geometric Design, 2(1-3):53-59, 1985.
  61. T.W. Sederberg. Techniques for cubic algebraic surfaces, tutorial part ii. IEEE Compute.r Graphics and Applications, 10(5):12-21, Sept. 1990.
  62. Scdcrbcrg, T., and J. Snively, J.,. Parameterization ofCllbic Algebraic Surfaces. In Oxford University Press R. Martin, editor, The Mathematics of Sur/aces II, 1987.
  63. Seidel, H-P. A New Militiaffine Approach to B-splines. Computer Aided Geometric Design, 6:23-32, 1989.
  64. Semple, J., and Roth, L. Introduction to Algebraic Geometry. Oxford University Press, Oxford, U.K., 1949.
  65. Shirman, L., and Sequin, C. Local Surface Interpolation with Bezier Patches. Computer Aided Geometric Design, 4:279-295, 1987.
  66. Walker, R. Algebraic Curves. Springer Verlag, 1950.
  67. Zariski, O. Algcbraic Sur/accs. Ergebnisse der Mathematik und ihre Grenzgebiete 4, 1935.

Related papers

A New Algorithm for Implicitizing a Parametric Algebraic Surface
ferruccio orecchia

International Journal of Pure and Apllied Mathematics, 2015

Given a parametric representation of an algebraic projective surface S of the ordinary space we give a new algorithm for finding the implicit cartesian equation of S. The algorithm is based on finding a suitable finite number of points on S and computing, by linear algebra, the equation of the surface of least degree that passes through the points.

View PDFchevron_right
Chapter 2: Surface Fitting Using Implicit Algebraic Surface Patches
Chandrajit Bajaj

Society for Industrial and Applied Mathematics eBooks, 1992

Interpolation and least-squares approximation provide! efficient ways of generating Ck.continuous meshes of surface patches, necessary for the consLrucLion of accurate computer geometric models of solid physical objects [see for e.g. [8.7]. Two surfaces J(:I;, Y,z) = 0 and g(x, y, z) = 0 meet with Ck-continuity along a curve C if and only if there exists functions a:(x, Y, z) and J3(x, v, z) such that all derivatives upta order ,;; of Ct.! -tJg equals zero [~ce for e.g.[G2]]. Ck-conl.inuity of two surface patches follows if the above conditioll is true along the common boundary curves between the two patches. This paper surveys the use of low dCF;L'Ce. implicitly defined, algebraic surfaces and surface patches in three dimensional real space m. 3 for various scat.tered data Ck-fitting problems. The use of low degree algebraic surface patches to constrHct models of physical ol>jects stems from the advantage of faster computations in sul>sequent geometric model manipulation operations such as computer graphics display, animation. and physica.l ol>ject simulations, see for e.g. (10]. Why algebraic surfaces? A real algebraic surface S in m. 3 is implicitly defined by a single polynomial equation F: !(x,y, z) = 0, where coeIfici<lllts of! arc over the real numlJers m... 1fanipulating polynomials, as opposed to arlJiLrary anaJytic fUllctions. is computationally more efficient. Furthermore algebraic surfaces provide enough gencl'illi\.y lo accurately model almost all complicated rigid objects. IThc oUlpul of olle opera.tion acts as [he inpul. 10 another operaLioll

View PDFchevron_right
Algebraic surface design and finite element meshes
Chanderjit Bajaj

1992

View PDFchevron_right
On Surface Design with Implicit Algebraic Surfaces (Ph.D. Thesis)
Insung Ihm

1991

View PDFchevron_right
An Implicitization Algorithm for Rational Surfaces with no Base Points
Rachid Senoussi

Journal of Symbolic Computation, 2001

We present an implicitization algorithm which is free of extraneous factors if the rational parametric surface has no base points. This algorithm is based on the method of Sylvester for computing the resultant of three homogeneous polynomials in three variables. Some examples and computations illustrate the efficiency and limits of this method.

View PDFchevron_right
580 California St., Suite 400
San Francisco, CA, 94104
© 2025 Academia. All rights reserved