Near Polygons from Partial Linear Spaces

We construct a nondegenerate near polygon from a partial linear space without isolated points. We also prove that the points of a near polygon at distance at most 2 from a fixed point induce a near polygon, which is related to the class of the near polygons obtained from the construction. We give also a characterization of the near polygons of Hamming type in terms of parallelism.     

Flipturning Polygons

   Abstract. A flipturn transforms a nonconvex simple polygon into another simple polygon by rotating a concavity 180° around the midpoint of its bounding convex hull edge. Joss and Shannon proved in 1973 that a sequence of flipturns eventually transforms any simple polygon into a convex polygon. This paper describes several new results about such flipturn sequences. We show that any orthogonal polygon is convexified after at most n-5 arbitrary flipturns, or at most

Refolding Planar Polygons

This paper describes an algorithm for generating a guaranteed intersection-free interpolation sequence between any pair of compatible polygons. Our algorithm builds on prior results from linkage unfolding, and if desired it can ensure that every edge length changes monotonically over the course of the interpolation sequence. The computational machinery that ensures against self-intersection is independent from a distance metric that determines the overall character of the interpolation sequence. This decoupled approach provides a powerful control mechanism for determining how the interpolation should appear, while still assuring against intersection and guaranteeing termination of the algorithm. Our algorithm also allows additional control by accommodating a set of algebraic constraints that can be weakly enforced throughout the interpolation sequence.     

Robust Tensegrity Polygons

A tensegrity polygon is a planar cable-strut tensegrity framework in which the cables form a convex polygon containing all vertices. The underlying edge-labeled graph $T=(V;C,S)$ T = ( V ; C , S ) , in which the cable edges form a Hamilton cycle, is an abstract tensegrity polygon. It is said to be robust if every convex realization of T as a tensegrity polygon has an equilibrium stress which is positive on the cables and negative on the struts, or equivalently, if every convex realization of T is infinitesimally rigid. We characterize the robust abstract tensegrity polygons on n vertices with $n-2$ n - 2 struts, answering a question of Roth and Whiteley (Trans Am Math Soc 265:419–446, 1981) and solving an open problem of Connelly (Recent progress in rigidity theory, 2008).     

Sporadic Reinhardt Polygons

Let $n$ be a positive integer, not a power of two. A Reinhardt polygon is a convex $n$ -gon that is optimal in three different geometric optimization problems: it has maximal perimeter relative to its diameter, maximal width relative to its diameter, and maximal width relative to its perimeter. For almost all $n$ , there are many Reinhardt polygons with $n$ sides, and many of them exhibit a particular periodic structure. While these periodic polygons are well understood, for certain values of $n$ , additional Reinhardt polygons exist, which do not possess this structured form. We call these polygons sporadic. We completely characterize the integers $n$ for which sporadic Reinhardt polygons exist, showing that these polygons occur precisely when $n=pqr$ with $p$ and $q$ distinct odd primes and $r\ge 2$ . We also prove that a positive proportion of the Reinhardt polygons with $n$ sides is sporadic for almost all integers $n$ , and we investigate the precise number of sporadic Reinhardt polygons that are produced for several values of $n$ by a construction that we introduce.     

Implicit Convex Polygons

Convex polygons in the plane can be defined explicitly as an ordered list of vertices, or given implicitly, for example by a list of linear constraints. The latter representation has been considered in several fields such as facility location, robotics and computer graphics. In this paper, we investigate many fundamental geometric problems for implicitly represented polygons and give simple and fast algorithms that are easy to implement. We uncover an interesting partition of the problems into two classes: those that exhibit an (nlogn) lower bound on their complexity, and those that yield O(n) time algorithms via prune-and-search methods.     

Circles and Polygons

We consider the Money–Coutts process. We show that in parallelograms this process is always preperiodic while the process is chaotic for an open set of quadrilaterals.     

Probability Theory of Random Polygons from the Quaternionic Viewpoint

We build a new probability measure on closed space and plane polygons. The key construction is a map, given by Hausmann and Knutson, using the Hopf map on quaternions from the complex Stiefel manifold of 2‐frames in n‐space to the space of closed n‐gons in 3‐space of total length 2. Our probability measure on polygon space is defined by pushing forward Haar measure on the Stiefel manifold by this map. A similar construction yields a probability measure on plane polygons that comes from a real Stiefel manifold. The edgelengths of polygons sampled according to our measures obey beta distributions. This makes our polygon measures different from those usually studied, which have Gaussian or fixed edgelengths. One advantage of our measures is that we can explicitly compute expectations and moments for chord lengths and radii of gyration. Another is that direct sampling according to our measures is fast (linear in the number of edges) and easy to code. Some of our methods will be of independent interest in studying other probability measures on polygon spaces. We define an edge set ensemble (ESE) to be the set of polygons created by rearranging a given set of n edges. A key theorem gives a formula for the average over an ESE of the squared lengths of chords skipping k vertices in terms of k, n, and the edgelengths of the ensemble. This allows one to easily compute expected values of squared chord lengths and radii of gyration for any probability measure on polygon space invariant under rearrangements of edges. © 2014 Wiley Periodicals, Inc.     

Heat Flow on Alexandrov Spaces

We prove that on compact Alexandrov spaces with curvature bounded below the gradient flow of the Dirichlet energy in the \begin{align*}L^2\end{align*}‐space produces the same evolution as the gradient flow of the relative entropy in the \begin{align*}L^2\end{align*}‐Wasserstein space. This means that the heat flow is well‐defined by either one of the two gradient flows. Combining properties of these flows, we are able to deduce the Lipschitz continuity of the heat kernel as well as Bakry‐Émery gradient estimates and the \begin{align*}\Gamma_2\end{align*}‐condition. Our identification is established by purely metric means, unlike preceding results relying on PDE techniques. Our approach generalizes to the case of heat flow with drift. © 2012 Wiley Periodicals, Inc.     

Normalized Harmonic Map Heat Flow

For any closed Riemannian manifold N we propose the normalized harmonic map heat flow as a means to obtain nonconstant harmonic maps , m ≥ 3 . © 2019 Wiley Periodicals, Inc.     

Slim Near Polygons

In this paper we initiate the study of hybrid slim near hexagons. These are near hexagons which are not dense and not a generalized hexagon in which each line is incident with exactly three points. In the present paper, we will emphasize slim near hexagons with at least one W(2)-quad or Q(5, 2)-quad. Such near hexagons are finite if there are no special points, i.e. points which lie at distance at most 2 from any other point. We will determine upper bounds for the number of lines through a fixed point. We will also look at the special case where the near hexagon has an order. We will determine all slim near hexagons with an order which contain at least one (necessarily big) Q(5,2)-quad, or at least one big W(2)-quad.AMS Classification 05B25, 51E12Communicated by: M.J. de ResminiPostdoctoral Fellow of the Research Foundation–Flanders.     

Morphing Simple Polygons

In this paper we investigate the problem of morphing (i.e., continuously deforming) one simple polygon into another. We assume that our two initial polygons have the same number of sides n , and that corresponding sides are parallel. We show that a morph is always possible through an interpolating simple polygon whose n sides vary but stay parallel to those of the two original ones. If we consider a uniform scaling or translation of part of the polygon as an atomic morphing step, then we show that O(n log n) such steps are sufficient for the morph. Furthermore, the sequence of steps can be computed in O(n log n) time. Received May 25, 1999, and in revised form November 15, 1999.     

Study of Heat Flow through Highly Porous Heat Insulators

A comprehensive study is done to model flow of heat through heat insulators based on materials with high gas content such as solidified foams (e.g., eXtruded PolyStyrene foams, Expanded PolyStyrene foam), cellular glass, etc. The actual internal cell-like structure of such an insulator is replicated by regularly shaped gas pockets, which are separated from each other by thin rims of solid materials. The first model focuses on heat flow across the insulator caused by conduction and convection. Subsequently, the effect of radiation is also studied. Several numerical results are presented and computational results are compared with experimentally measured data.     

Decomposable Near Polygons

We give a common construction for the product and the glued near polygons by generalizing the glueing construction given in [5]. We call the near polygons arising from this generalized glueing construction decomposable or (again) glued. We will study the geodetically closed sub near polygons of decomposable near polygons. Each decomposable near hexagon has a nice pair of partitions in geodetically closed near polygons. We will give a characterization of the decomposable near polygons using this property.     

Reconstructing Convex Polygons in the Plane from One Directed X-Ray

Gardner [7] proved that with the exception of a simple class of nonparallel wedges, convex polygons in the plane are uniquely determined by one directed X-ray. This paper develops methods for reconstructing convex polygons in the plane from one directed X-ray. We show that nonsmooth points on the boundary of a convex body are located along rays where the derivative of the data have a jump discontinuity. Location of the nonsmooth points divides a convex polygon into a finite set of wedges. We prove uniqueness theorems and give algorithms for reconstructing nonparallel wedges from line integrals along four or more rays. Also, we characterize discrete data sets that are directed X-rays of both parallel and nonparallel wedges. Several examples of reconstructions are included. Received August 16, 1999, and in revised form September 13, 2000. Online publication May 4, 2001.     

矩形微通道热沉内单相稳态层流流体的流动与传热分析

采用解析方法分析了矩形微通道热沉内单相稳态层流流体的流动与传热．基于y方向流速和导热不变的假设,建立流体在矩形微通道内流动的流速方程和传热的温度方程,进而推导出Nusselt数和Poiseuille数的理论表达式．通过计算结果可以看出,推导的Nusselt数和Poiseuille数的解析解与其他文献的结果吻合较好,而且当宽高比趋于无穷大时,Nusselt数和Poiseuille数分别趋近于8.235和96,这与其他文献结果完全相同．在Reynolds数相同时,摩擦因数随着宽高比的增加而增加,而在相同宽高比时,摩擦因数随Reynolds数的增加而减小．     

Floer Homology and the Heat Flow

We study the heat flow in the loop space of a closed Riemannian manifold M as an adiabatic limit of the Floer equations in the cotangent bundle. Our main application is a proof that the Floer homology of the cotangent bundle, for the Hamiltonian function kinetic plus potential energy, is naturally isomorphic to the homology of the loop space. J.W. received partial financial support from TH-Projekt 00321. Received: December 2004 Revision: September 2005 Accepted: September 2005     

Extended Formulations for Polygons

The extension complexity of a polytope?P is the smallest integer?k such that?P is the projection of a polytope?Q with?k facets. We study the extension complexity of n-gons in the plane. First, we give a new proof that the extension complexity of regular n-gons is O(logn), a result originating from work by Ben-Tal and Nemirovski (Math. Oper. Res. 26(2), 193?C205, 2001). Our proof easily generalizes to other permutahedra and simplifies proofs of recent results by Goemans (2009), and Kaibel and Pashkovich (2011). Second, we prove a lower bound of $\sqrt{2n}$ on the extension complexity of generic n-gons. Finally, we prove that there exist n-gons whose vertices lie on an O(n)×O(n ²) integer grid with extension complexity $\varOmega (\sqrt{n}/\sqrt{\log n})$ .     

Polygons Needing Many Flipturns

A flipturn on a polygon consists of reversing the order of edges inside a pocket of the polygon, without changing lengths or slopes. Any polygon with n edges must be convexified after at most (n − 1)! flipturns. A recent paper showed that in fact it will be convex after at most n(n−3)/2 flipturns.We give here lower bounds.We construct a polygon such that if pockets are chosen in a bad way, at least (n − 2)²/4 flipturns are needed to convexify the polygon. In another construction, (n −1)²/8 flipturns are needed, regardless of the order in which pockets are chosen. All our bounds are adaptive to a pre-specified number of distinct slopes of the edges.     

Bénard Polygons

We prove that if a neighborhood of a polygonal region admits a two-dimensional eigenfunction of the Laplacian, having a nonzero eigenvalue and such that its normal derivative vanishes on all the bounding edges, then the polygonal region must be a union of complete pieces of a tiling of the plane by congruent rectangles, or by congruent (45°, 45°, 90°) or (30°, 60°, 90°) triangles. Hydrodynamically, this means that during critical convection in a horizontal fluid layer uniformally heated from below, the mere occurrence of one arbitrary closed vertical polygonal fluid surface across which there is no transportation of fluid automatically guarantees the presence of one of the usual special convection patterns. In addition it shows that linear convection theory seldom predicts a regular fluid pattern: e.g., for the case of a triangular container having angles substantially different from (45°, 45°, 90°), (30°, 60°, 90°), (60°, 60°, 60°) or (30°, 30°, 120°), it predicts that the convection cells not touching the boundary, if any, should be noticeably nonpolygonal. We also consider a nonlinear generalization and the noneuclidean analogues of such polygons.