This paper presents symbolic algorithms to determine whether a given surface(implicitly or parametrically defined)is a rational ruled surface and find a proper parametrization of the ruled surface.However,in practical...This paper presents symbolic algorithms to determine whether a given surface(implicitly or parametrically defined)is a rational ruled surface and find a proper parametrization of the ruled surface.However,in practical applications,one has to deal with numerical objects that are given approximately,probably because they proceed from an exact data that has been perturbed under some previous measuring process or manipulation.For these numerical objects,the authors adapt the symbolic algorithms presented by means of the use of numerical techniques.The authors develop numeric algorithms that allow to determine ruled surfaces"close"to an input(not necessarily ruled)surface,and the distance between the input and the output surface is computed.展开更多
This paper shows that the multiplicity of the base point locus of a projective rational surface parametrization can be expressed as the degree of the content of a univariate resultant.As a consequence,we get a new pro...This paper shows that the multiplicity of the base point locus of a projective rational surface parametrization can be expressed as the degree of the content of a univariate resultant.As a consequence,we get a new proof of the degree formula relating the degree of the surface,the degree of the parametrization,the base point multiplicity and the degree of the rational map induced by the parametrization.In addition,we extend both formulas to the case of dominant rational maps of the projective plane and describe how the base point loci of a parametrization and its reparametrizations are related.As an application of these results,we explore how the degree of a surface reparametrization is affected by the presence of base points.展开更多
基金partially supported by FEDER/Ministerio de Ciencia,Innovación y Universidades-Agencia Estatal de Investigacin/MTM2017-88796-P(Symbolic Computation New challenges in Algebra and Geometry together with its applications)the National Natural Science Foundation of China under Grant No.61872332the University of Chinese Academy of Sciences the Research Group ASYNACS(Ref.CCEE2011/R34)。
文摘This paper presents symbolic algorithms to determine whether a given surface(implicitly or parametrically defined)is a rational ruled surface and find a proper parametrization of the ruled surface.However,in practical applications,one has to deal with numerical objects that are given approximately,probably because they proceed from an exact data that has been perturbed under some previous measuring process or manipulation.For these numerical objects,the authors adapt the symbolic algorithms presented by means of the use of numerical techniques.The authors develop numeric algorithms that allow to determine ruled surfaces"close"to an input(not necessarily ruled)surface,and the distance between the input and the output surface is computed.
基金partially supported by FEDER/Ministerio de Ciencia,Innovación y Universidades-Agencia Estatal de Investigación/MTM2017-88796-P(Symbolic Computation:new challenges in Algebra and Geometry together with its applications)。
文摘This paper shows that the multiplicity of the base point locus of a projective rational surface parametrization can be expressed as the degree of the content of a univariate resultant.As a consequence,we get a new proof of the degree formula relating the degree of the surface,the degree of the parametrization,the base point multiplicity and the degree of the rational map induced by the parametrization.In addition,we extend both formulas to the case of dominant rational maps of the projective plane and describe how the base point loci of a parametrization and its reparametrizations are related.As an application of these results,we explore how the degree of a surface reparametrization is affected by the presence of base points.
