Brianchon定理在二次曲线外切2n边形中的推广

利用有向面积方法,对二次曲线外切2n边形(n≥2)进行研究,得到二次曲线外切2n边形(n≥2)中有向面积的几个定值定理及其推论,从而把射影几何中著名的Brianchon定理推广到二次曲线外切2n边形的情形.     

定圆的最小外切三角形

在一次课外兴趣小组活动中,我向老师提了这样一个问题：半径为定值的圆的外切三角形中,以什么样的三角形的面积最小？结论是：半径为定值的圆的外切三角形中,以等边三角形的面积最小．     

施泰纳问题的几何证明

施泰纳(Sterner.J)问题可表述为:抛物线外切三角形的垂心在抛物线的准线上.本文揭示这个定理的深刻的几何背景,我     

Morgan定理的推广

1　前言美国的《数学教师》期刊上多篇文章涉及三角形内某一几何图形面积与原三角形面积之比为定值 ,如文 [1]的 Marion定理 :如图1,对于任一三角形 ,将每边三等分 ,则等分点与顶点联线得到的六边形面积与原三角形面积之比为 110 .文[2 ]利用几何软件将该结论推广得到 Morgan定理 :如图 2 ,对于任一三角形 ,将每边 n等分 ( n为大于或等于3的奇数 ) ,则边上第 n-12 、n 12 个等分点与顶点联线得到的六边形面积与原三角形面积之比为89n2 -1.为了便于推广 ,将 Morgan定理叙述为 :如图 2 ,在△ ABC中 ,A1 、B1 、C1 分别为边 BC、CA、AB的…     

多边形面积任意等分的几何作图方法

笔者通过对多边形面积等分问题的探讨,找到一种几何作图方法。其基本原理就是利用“同底等高的三角形面积相等”这一性质,将多边形转换为等积的三角形。再利用等分线段的基本作图方法,就可将多边形面积任意等分了。其基本作图方法举例如下: 1 过多边形边上一点,分多边形面积为n等分例1 设P点为五边形ABCDE边上任一点,过P点将五边形ABCDE的面积分成七等分。作法:(见图1)     

圆内接多边形的一个性质

笔者研究发现,圆内接多边形有如下一个美妙性质. 设A_1 A_2 """A_n为圆内接n边形(n≥4),画n-3条对角线将这个n边形分割成n-2个三角形(这些对角线在多边形内部没有交点),则无论如何分割,所得到的n-2个三角形的内切圆半径之和是一个定值.     

非锐角三角形个数的估计的改进

文[1]定理1证明：平面上任何三点不共线的n(n≥4)个点所组成的三角形中，非锐角三角形个数不少于1/4Gn^2，即至少有三角形总数的25％是非锐角三角形．令f(n)表示平面上任何三点不共线的n(n≥4)个点所组成的三角形中，非锐角三角形个数的极小值．下面对这一结果进行改进，并作进一步的探讨。     

对“多边形内角和定理”的一点看法

人教社将全日制十年制学校初中数学课本《几何》(以下称“试用本”)改编成初级中学课本《几何》(以下称“新编本”),对教学内容进行了较大的变动。本文想就“多边形内角和定理”这一内容的变动,谈几点看法。 1 “多边形内角和定理”在试用本中,是放在第二章的2.3节作为三角形内角和定理的“推论”出现的。由于定理涉及到任意自然数n(≥3),对于刚学三角形的学生来说不易接受。在新编本中则后移到第四章(四边形)学习,且标明4.2“多边形内角和定理”,还通过反复的应用来巩固它。这样安排降低了难度,强周了它的重要性,也利于学生掌握, 2 试用本中直接证明(n-2)·180°。方法是:从n边形的一个顶点出发可以作(n-3)条对角(如图1),这些对角线而把n边形分成(n-2)个三角形,而这里的“n-3”、“n-2”都是不     

抛物线的切点多边形和切线多边形重心的一个定理及应用

过抛物线上任意三点 A1 ,A2 ,A3 ,分别作切线 ,三条切线围成一个△ B1 B2 B3 叫做切线三角形 ,而△ A1 A2 A3 叫切点三角形 .同样过抛物线上任意四点 A1 ,A2 ,A3 ,A4,分别作切线 ,四条切线围成一个凸四边形叫切线四边形 ,同样 A1 A2 A3 A4叫切点四边形 .不难发现 ,过抛物线上任意五点作五条切线 ,它们相交成 10个点 ,已不能围成凸五边形 ,看来 n≥ 5时 ,切点 n边形已不再有切线 n边形了 .本文将研究切点 n( =3 ,4 )边形与此时切线 n边形的重心的性质 ,然后给出一个应用 .定理 1　如图 1,设 A1 与 A2 是抛物线 y2= 2 px上任意两点 ,…     

关于棱锥的一个猜想的证明

文[1]、文[2]对2005年湖南省高考数学试题(理10)进行了探究推广,分别给出了多边形面积三角形化定比分点、棱锥体积棱锥化定比分点的概念及有关性质.定义1设P是n边形A_1A_2…A_n(n≥3)内任意一点,S表示该n边形的面积,     

Alternating direction implicit orthogonal spline collocation on some non-rectangular regions with inconsistent partitions

The alternating direction implicit (ADI) method is a highly efficient technique for solving multi-dimensional dependent initial-boundary value problems on rectangles. Earlier we have used the ADI technique in conjunction with orthogonal spline collocation (OSC) for discretization in space to solve parabolic problems on rectangles and rectangular polygons. Recently, we extended applications of ADI OSC schemes to the solution of parabolic problems on some non-rectangular regions that allow for consistent nonuniform partitions. However, for many regions, it is impossible to construct such partitions. Therefore, in this paper, we show how to extend our approach further to solve parabolic problems on some non-rectangular regions using inconsistent uniform partitions. Numerical results are presented using piecewise Hermite cubic polynomials for spatial discretizations and our ADI OSC scheme for parabolic problems to demonstrate its performance on several regions.     

Polygons in Minkowski three space and parabolic Higgs bundles of rank 2 on \mathbb{C}{{\mathbb{P}}^1}

Consider the moduli space of parabolic Higgs bundles (E, Φ) of rank two on ??¹ such that the underlying holomorphic vector bundle for the parabolic vector bundle E is trivial. It is equipped with the natural involution defined by $ \left( {E,\varPhi } \right)\mapsto \left( {E,-\varPhi } \right) $ . We study the fixed point locus of this involution. In [GM], this moduli space with involution was identified with the moduli space of hyperpolygons equipped with a certain natural involution. Here we identify the fixed point locus with the moduli spaces of polygons in Minkowski 3-space. This identification yields information on the connected components of the fixed point locus.     

Circle Numbers of Regular Convex Polygons

The circle number function is extended here to regular convex polygons. To this end, the radius of the polygonal circle is defined as the Minkowski functional of the circumscribed polygonal disc, and the arc-length of the polygonal circle is measured in a generalized Minkowski space having the rotated polar body as the unit disc.     

A vector bundle proof of Poncelet’s closure theorem

There are few different proofs of the celebrated Poncelet closure theorem about polygons simultaneously inscribed in a smooth conic and circumscribed around another. We propose a new proof, based on the link between Schwarzenberger bundles and Poncelet curves.     

Variational aspects of Poncelet's theorem

We prove results about the maximum or minimum of the length of a convex polygon inscribed in an ellipse or circumscribed around it, respectively. Combining these, we obtain a new proof of Poncelet's theorem on homofocal ellipses and convex polygons.     

The mean value of the area of polygons circumscribed about a plane convex body

Inner parallel bodies are used to prove that the mean area of polygons circumscribed about a convex bodyK of given area is minimum whenK is a circle.     

An iterated local search algorithm based on nonlinear programming for the irregular strip packing problem

The irregular strip packing problem is a combinatorial optimization problem that requires to place a given set of two-dimensional polygons within a rectangular container so that no polygon overlaps with other polygons or protrudes from the container, where each polygon is not necessarily convex. The container has a fixed width, while its length can change so that all polygons are placed in it. The objective is to find a layout of the set of polygons that minimizes the length of the container.We propose an algorithm that separates overlapping polygons based on nonlinear programming, and an algorithm that swaps two polygons in a layout so as to find their new positions in the layout with the least overlap. We incorporate these algorithms as components into an iterated local search algorithm for the overlap minimization problem and then develop an algorithm for the irregular strip packing problem using the iterated local search algorithm. Computational comparisons on representative instances disclose that our algorithm is competitive with other existing algorithms. Moreover, our algorithm updates several best known results.     

The mean of circumscribed polygons

The mean of circumscribed polygons of a convex body in \Bbb R ²\Bbb R ^2 is again a convex body. The corresponding mapping of convex bodies is an endomorphism, and we characterize the injective case. It is shown that this endomorphism is almost always injective.     

Oriented Mixed Area and Discrete Minimal Surfaces

Recently a curvature theory for polyhedral surfaces has been established, which associates with each face a mean curvature value computed from areas and mixed areas of that face and its corresponding Gauss image face. Therefore a study of minimal surfaces requires studying pairs of polygons with vanishing mixed area. We show that the mixed area of two edgewise parallel polygons equals the mixed area of a derived polygon pair which has only the half number of vertices. Thus we are able to recursively characterize vanishing mixed area for hexagons and other n-gons in an incidence-geometric way. We use these geometric results for the construction of discrete minimal surfaces and a study of equilibrium forces in their edges, especially those with the combinatorics of a hexagonal mesh.