带有给定凸切线多边形的保形五次样条逼近

本讨论带有给定切线多边形的保形逼近问题．给出了一条与给定切线多边形相切的保形五次参数祥条曲线。     

The completion of the classification of the regular near octagons with thick quads

Brouwer and Wilbrink [3] showed the nonexistence of regular near octagons whose parameters s, t₂, t₃ and t satisfy s ≥ 2, t₂ ≥ 2 and t₃ ≠ t₂(t₂+1). Later an arithmetical error was discovered in the proof. Because of this error, the existence problem was still open for the near octagons corresponding with certain values of s, t₂ and t₃. In the present paper, we will also show the nonexistence of these remaining regular near octagons. MSC2000 05B25, 05E30, 51E12 Postdoctoral Fellow of the Research Foundation - Flanders     

The valuations of the near hexagons related to the Witt designs S(5,6,12) and S(5,8,24)

Valuations of dense near polygons were introduced in 16 . In the present paper, we classify all valuations of the near hexagons ??₁ and ??₂, which are related to the respective Witt designs S(5,6,12) and S(5,8,24). Using these classifications, we prove that if a dense near polygon S contains a hex H isomorphic to ??₁ or ??₂, then H is classical in S. We will use this result to determine all dense near octagons that contain a hex isomorphic to ??₁ or ??₂. As a by‐product, we obtain a purely geometrical proof for the nonexistence of regular near 2d‐gons, d ≥ 4, whose parameters s, t, t_i (0 ≤ i ≤ d) satisfy (s, t₂, t₃) = (2, 1, 11) or (2, 2, 14). The nonexistence of these regular near polygons can also be shown with the aid of eigenvalue techniques. © 2005 Wiley Periodicals, Inc. J Combin Designs 14: 214–228, 2006     

Minkowski-type and Alexandrov-Type Theorems for Polyhedral Herissons

Classical H. Minkowski theorems on existence and uniqueness of convex polyhedra with prescribed directions and areas of faces as well as the well-known generalization of H. Minkowski uniqueness theorem due to A.D. Alexandrov are extended to a class of nonconvex polyhedra which are called polyhedral herissons and may be described as polyhedra with injective spherical image.     

Fractional Power Series and Pairings on Drinfeld Modules

Let be an algebraically closed field containing which is complete with respect to an absolute value . We prove that under suitable constraints on the coefficients, the series converges to a surjective, open, continuous -linear homomorphism whose kernel is locally compact. We characterize the locally compact sub--vector spaces of which occur as kernels of such series, and describe the extent to which determines the series. We develop a theory of Newton polygons for these series which lets us compute the Haar measure of the set of zeros of of a given valuation, given the valuations of the coefficients. The ``adjoint' series converges everywhere if and only if does, and in this case there is a natural bilinear pairing

which exhibits as the Pontryagin dual of . Many of these results extend to non-linear fractional power series. We apply these results to construct a Drinfeld module analogue of the Weil pairing, and to describe the topological module structure of the kernel of the adjoint exponential of a Drinfeld module.

     

有理Bezier曲线的拼接

有理Bezier曲线作为有理B样条曲线的特例,正得到越来越多的研究,并在CAD/CAM领域中得到越来越广泛的应用.依据Bezier曲线理论,研究了有理Bezier曲线的拼接问题,给出了两条邻接任意次有理Bezier曲线间G1和G2连续条件.     

二维装配图的快递交点排序裁剪算法

提出一个任意多边形的快速交点排序线裁剪算法,该算法简单快捷,效率高,并将其成功用于工程装配图的二维消隐。解决了大多数算法将凹多边形裁剪分解为凸多边形处理存在计算时间长、难度大等问题。     

多边形的等积三角剖分

2000年，美国数学家Stein提出了一个很一般的猜想：任何特殊多边形不可能划分为奇数个面积相等的三角形，并证明了猜想对边数不超过6的特殊多边形成立．借助Sperner引理与2-进赋值函数证明：对任何正整数n＞6，存在边数为n的特殊多边形，并证明猜想对边数为7的几类典型的特殊多边形成立．     

基于多步法绘制理论的抛物线裁剪算法

基于多步法绘制原理和Brensenham算法，提出一种新的关于抛物线的线性化裁剪算法。该算法首先线性化计算，由给定抛物线生成绘制时所需的两个数组，然后考虑到各种裁剪情况，利用两数组实现抛物线与窗口裁剪线的求交运算，得到相应的裁剪数据，最后再绘制出所求的裁剪图形。     

判定凸多边形可移动性算法的推广

文［１］研究了两个凸多边形可移动性问题的最优判定算法，讨论了简单多边形Ｐ和凸多边形Ｑ的可移动性问题。提出了一种与［１］具有相同时间复杂度的最优算法。