We establish a fundamental connection between smooth and polygonal knot energies, showing that the Minimum Distance Energy for polygons inscribed in a smooth knot converges to the Moebius Energy of the smooth knot as the polygons converge to the smooth knot. However, the polygons must converge in a ``nice'' way, and th…
On-device research index
arXiv research
A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.
168,695 papers · 148 categories
Trend · papers per month
48 results for “polygonal approximations”
New elastic energy for irregular curves defined through polygonal approximations.
problem Defining elastic energy for irregular curves in any space dimension.
method Relaxation process with -rotation of inscribed polygonals, focusing on geometric curvature distribution.
result Energy finite if and only if curve's arc-length parameterization has second order summability.
We present new computations of approximately length-minimizing polygons with fixed thickness. These curves model the centerlines of "tight" knotted tubes with minimal length and fixed circular cross-section. Our curves approximately minimize the ropelength (or quotient of length and thickness) for polygons in their kno…
In this paper we discuss some affine properties of convex equal-area polygons, which are convex polygons such that all triangles formed by three consecutive vertices have the same area. Besides being able to approximate closed convex smooth curves almost uniformly with respect to affine length, convex equal-area polygo…
For a polygonal knot K, it is shown that a tube of radius R(K), the polygonal thickness radius, is an embedded torus. Given a thick configuration K, perturbations of size r<R(K) define satellite structures, or local knotting. We explore knotting within these tubes both theoretically and numerically. We provide bounds o…
We introduce an approach based on moving frames for polygon recognition and symmetry detection. We present detailed algorithms for recognition of polygons modulo the special Euclidean, Euclidean, equi-affine, skewed-affine and similarity Lie groups, and explain the procedure for a generic Lie group. The time complexity…
Discrete curvaturemath.DG
Survey on discrete curvature concepts for polygons and polyhedral surfaces.
problem Defining curvature for discrete structures like polygons and polyhedral surfaces.
method Explains curvature notions for polygons, polyhedral surfaces, and abstract polyhedral manifolds.
result Discrete curvature theorems parallel classical theorems in differential geometry.
For Bezier curves, subdivision algorithms create control polygons as piecewise linear (PL) approximations that converge in terms of Hausdorff distance. We prove that the exterior angles of control polygons under subdivision converge to 0 at the rate of , where is the number of subdivisions.…
Smooth curves from polygonal chains with vertex preservation and explicit curvature control.
problem Preserving vertices while smoothing polygonal chains to curves.
method Directional mollification operator for polygonal chains.
result Smooth curves that intersect original vertices and maintain explicit curvature bounds.
The study examines knot probabilities in confined lattice polygons.
problem Determining the relative knotting probabilities in confined lattice knots.
method Used Monte Carlo algorithms to enumerate conformations of lattice knots in a confined volume.
result Relative knotting probabilities are small, with the model dominated by unknots.
New findings on strong convexity in triangulations of convex polygons.
problem Understanding the structure of triangulations and their distances.
method Analyzing geodesic paths and flag triangulations in flip-graphs.
result Strong convexity properties of triangulations in convex polygons are not always preserved.
New methods classify convex lattice polygons for affine dimers.
problem Not all convex lattice polygons are characteristic polygons of affine dimers.
method General constructions and algorithm for finding affine dimers with prescribed polygons.
result All lattice triangles, generalised parallelograms, and polygons of genus at most two admit an affine dimer.
We study the -median clustering problem for high-dimensional polygonal curves with finite but unbounded number of vertices. We tackle the computational issue that arises from the high number of dimensions by defining a Johnson-Lindenstrauss projection for polygonal curves. We analyze the resulting error in terms of …
The pentagram map's limit point is related to infinitesimal perturbations of polygons.
problem Understanding the limit point of the pentagram map and its relation to polygon perturbations.
method Interpreting Glick's operator as the infinitesimal monodromy of a polygon.
result Glick's operator measures the extent to which a perturbed polygon does not close up.
General area-preserving motion of polygonal curves is formulated as a system of ODEs. Solution polygonal curves belong to a prescribed polygonal class, which is similar to the admissible class used in the crystalline curvature flow. The ODEs are discretized implicitly in time keeping a given constant area speed while s…
We provide a new proof of the classical result that any closed rectifiable Jordan curve Gamma in space being piecewise of class C^2 bounds at least one immersed minimal surface of disc-type, under the additional assumption that the total curvature of Gamma is smaller than 6*Pi. In contrast to the methods due to Osserma…
Study finds finitely many non-congruent polygonal domains with same Steklov spectrum.
problem Inverse Steklov problem on convex polygons.
method Analysis of Steklov eigenvalues and isoperimetric bounds.
result For almost all convex polygonal domains, there exist at most finitely many non-congruent domains with the same Steklov spectrum.
Algorithm constructs algebraic curves from translation surfaces.
problem Creating algebraic curves from translation surfaces.
method Using discrete Riemann surface theory and Riemann theta functions.
result Algorithm approximates Jacobian varieties of translation surfaces.
New property: polygons have a fixed dimension regardless of ambient space dimensions.
problem Understanding the dimension of polygon moduli spaces.
method Generalizing the square bending example to polygons of arbitrary edge lengths.
result There are only finitely many moduli spaces of polygons with given edge lengths, even as ambient dimension increases.
The paper classifies vertices in planar polygons formed by convex domains.
problem Classifying vertices in planar polygons formed by convex domains.
method Analyzing polygons formed by homothets and translates of a convex domain.
result The number of singular boundary points in a -polygon is between and for a strictly convex domain with singular boundary points.
In this paper, we discuss centroaffine geometry of polygons in -space. For a polygon that is locally convex with respect to an origin together with a transversal vector field , we define the centroaffine dual pair similarly to [6]. We prove that vertices of correspond to flattening points for …
The pentagram map takes a planar polygon to a polygon whose vertices are the intersection points of consecutive shortest diagonals of . This map is known to interact nicely with Poncelet polygons, i.e. polygons which are simultaneously inscribed in a conic and circumscribed about a conic. A theorem of R. Sc…
Simple rectilinear polygons (i.e. rectilinear polygons without holes or cutpoints) can be regarded as finite rectangular cell complexes coordinatized by two finite dendrons. The intrinsic -metric is thus inherited from the product of the two finite dendrons via an isometric embedding. The rectangular cell complexe…
Optimal Reeb graphs identified for polygon decomposition.
problem Investigating the topological structure of planar polygon decomposition.
method Using oriented Reeb graphs with a marked vertex for height functions.
result Described all possible optimal Reeb graphs for specific polygon configurations.
Study on Poncelet polygons' centers and circumcenters in various geometries.
problem Understanding Poncelet polygons' geometric centers in different geometries.
method Analyzing the Circumcenter of Mass and Center of Mass of Poncelet polygons, proving Dan Reznik's invariants, and exploring spherical geometry.
result Proof of Dan Reznik's invariants for billiard trajectories and insights into Poncelet polygons' centers in spherical geometry.
The study proves analogues of the discrete isoperimetric inequality in hyperbolic geometry.
problem Finding the minimum perimeter for polygons with a fixed area in hyperbolic geometry.
method Proving analogues of the discrete isoperimetric inequality for cyclic and tangential polygons in hyperbolic geometry, considering both single and multiple polygons.
result Established two versions of the isoperimetric inequality for multiple polygons in hyperbolic geometry with certain area or perimeter restrictions.
New formula for spherical polygon area via prequantization.
problem Traditional area formula for spherical polygons requires measuring angles.
method Uses prequantization to create a new formula that doesn't require angle measurement.
result New formula applicable to a wider range of degenerate curves and polygons.
The map S transforms polygon sides, and almost no convex polygons remain convex.
problem Investigating whether convex polygons remain convex under the map S.
method Analyzing the dynamics of the map S and proving properties of the set of polygons that remain convex.
result The set of polygons that remain convex under iterations of S has measure zero and is an algebraic subvariety of codimension two.
In this article we investigate a family of nonlinear evolutions of polygons in the plane called the -polygon flow and obtain some results analogous to results for the smooth curve shortening flow: (1) any planar polygon shrinks to a point and (2) a regular polygon with five or more vertices is asymptotically stable …
The study proves a discrete Blaschke theorem for convex polygons in 2-dimensional space forms.
problem Investigating curvature and circumradius constraints for convex polygons in 2-space forms.
method Defining curvature at each vertex and proving a Blaschke-type theorem.
result The circumradius of a convex polygon satisfies a specific inequality related to its vertex curvatures.
It is known that every nontrivial knot has at least two quadrisecants. Given a knot, we mark each intersection point of each of its quadrisecants. Replacing each subarc between two nearby marked points with a straight line segment joining them, we obtain a polygonal closed curve which we will call the quadrisecant appr…
We study polygon spaces arising from planar configurations of necklaces with some of the beads fixed and some of the beads sliding freely. These spaces include configuration spaces of flexible polygons and some other natural polygon spaces. We characterise critical points of the oriented area function in geometric term…
Consider a convex polygon P in the plane, and denote by U a homothetical copy of the vector sum of P and (-P). Then the polygon U, as unit ball, induces a norm such that, with respect to this norm, P has constant Minkowskian width. We define notions like Minkowskian curvature, evolutes and involutes for polygons of con…
Investigates dual foliations of polygon spaces based on area and perimeter.
problem Understanding dual foliations of polygon spaces guided by area and perimeter.
method Investigated topology of leaves, determined homology groups, and extended isoperimetric duality.
result Homology groups and homotopy types of polygon spaces are determined.
Characterizes polygonal surfaces in pseudo-hyperbolic spaces.
problem Understanding polygonal surfaces in pseudo-hyperbolic spaces.
method Characterizes polygonal surfaces by total curvature finiteness and asymptotic flatness, using comparison of ideal boundaries.
result Polygonal surfaces have parabolic type and polynomial quartic differential.
Maximal distortion between geodesic and Euclidean diameters in polygonal domains is studied.
problem Maximal ratio of geodesic to Euclidean diameters in polygonal domains with holes.
method Analyzes convex polygons with holes, using geometric triangulations as a comparison.
result The supremum of the ratio is between and for convex polygons.
Solitons are special polygon midpoints under affine transformations.
problem Characterizing polygons whose midpoints under affine transformations form a new polygon.
method Analyzing midpoints polygons and their relationship to affine transformations and differential equations.
result A large class of polygons are on an orbit of a one-parameter subgroup of the affine group, and these curves are solutions to a specific differential equation.
Short proof for ideal polygons with near optimal orthogeodesic decomposition.
problem Decomposing ideal polygons into orthogeodesics.
method Short proof with orthogeodesic decomposition of length at most .
result Optimal orthogeodesic decomposition of ideal polygons with length .
New algorithm improves stability and efficiency of neural network training.
problem Stability and efficiency issues in adaptive optimization for neural networks.
method Polygonal approximations for SDEs with monotone coefficients, providing stability and addressing vanishing gradients.
result TheoPouLa algorithm shows superior performance over popular adaptive optimizers.
We study polygonal analogues of several moving boundary problems and their time discretization which preserves the constant area speed property. We establish various polygonal analogues of geometric formulas for moving boundaries and make use of the geometric formulas for our numerical scheme and its analysis of genera…
In this paper, we study the symplectic volume of the moduli space of polygons by using Witten's formula. We propose to use this volume as a measure for the flexibility of a polygon with fixed side-lengths. The main result of our is that among all the Spherical and Euclidean polygons with fixed perimeter the regular one…
The study connects polygon areas and projective structures in 3D space.
problem Relating polygon areas and projective structures in 3D space.
method Investigates positive tuples of complete flags in R^3 and their associated polygons in RP^2.
result Establishes a relationship between Holmes-Thompson area and projective structures.
Fast algorithm samples confined polygons efficiently.
problem Sampling confined random equilateral closed polygons efficiently.
method Uses symplectic geometry to sample moment polytope, leading to a linear-time algorithm.
result Explicit formulas for expected distances and total curvature of vertices to the origin.
Researchers prove the arc complexes of decorated hyperbolic polygons are balls.
problem Understanding the structure of decorated hyperbolic polygons.
method Combinatorial approach using pseudo-manifolds and shellability.
result Arc complexes of decorated hyperbolic polygons are closed piecewise linear balls.
Classifies tilings of hyperbolic plane by regular polygons.
problem Decidability of tiling patterns in hyperbolic plane.
method Finite set of local and inductive combinatorial constraints.
result First known weakly aperiodic protosets of regular polygons in hyperbolic plane.
Defines weak normals for irregular curves in high-dimensional spaces.
problem Dealing with irregular curves in high-dimensional Euclidean spaces.
method Using sequences of inscribed polygonals and Gram-Schmidt procedure, introduces a relaxed notion of weak normals.
result Weak normals for irregular curves are the strong limit of approximating polygonals and agree with relaxed energy.
We describe all families of star-shaped n-polygons in the Euclidean plane with prescribed perimeter and area ; they are leaves of a foliation F on the space of star-shaped n-polygons. By the way, we study some geometric properties of convex polygons, for instance their inscriptibility in a circle and their regularity i…
We describe the first-order variations of the angles of Euclidean, spherical or hyperbolic polygons under infinitesimal deformations such that the lengths of the edges do not change. Using this description, we introduce a vector-valued quadratic invariant on the space of those isometric deformations which, for conv…