arXiv research

Dancing polygons and rolling balls linked via a special geometric distribution.

This paper proposes a framework which is able to generate a sequence of three-dimensional human dance poses for a given music. The proposed framework consists of three components: a music feature encoder, a pose generator, and a music genre classifier. We focus on integrating these components for generating a realistic…

The waggle dance that honeybees perform is an astonishing way of communicating the location of food source. After over 60 years of its discovery, researchers still use manual labeling by watching hours of dance videos to detect different transitions between dance components thus extracting information regarding the dis…

Math and dance blend in choreographer's research.

Dance Dance Revolution (DDR) is a popular rhythm-based video game. Players perform steps on a dance platform in synchronization with music as directed by on-screen step charts. While many step charts are available in standardized packs, players may grow tired of existing charts, or wish to dance to a song for which no …

Record companies invest billions of dollars in new talent around the globe each year. Gaining insight into what actually makes a hit song would provide tremendous benefits for the music industry. In this research we tackle this question by focussing on the dance hit song classification problem. A database of dance hit …

Synthesizing human's movements such as dancing is a flourishing research field which has several applications in computer graphics. Recent studies have demonstrated the advantages of deep neural networks (DNNs) for achieving remarkable performance in motion and music tasks with little effort for feature pre-processing.…

DANCE improves prediction set efficiency for deep learning models.

The "dancing metric" is a pseudo-riemannian metric $\pmb{g}$ of signature $(2,2)$ on the space $M^4$ of non-incident point-line pairs in the real projective plane $\mathbb{RP}^2$. The null-curves of $(M^4,\pmb{g})$ are given by the "dancing condition": the point is moving towards a point on the line, about which the li…

This paper extends danceability concept to twisted virtual knots.

DANCE optimizes neural network and accelerator design for faster, more efficient DNN execution.

RFC enhances humanoid control to imitate complex human motions.

We present recent results on counting and distribution of circles in a given circle packing invariant under a geometrically finite Kleinian group and discuss how the dynamics of flows on geometrically finite hyperbolic $3$ manifolds are related. Our results apply to Apollonian circle packings, Sierpinski curves, Schott…

New methods classify convex lattice polygons for affine dimers.

The pentagram map's limit point is related to infinitesimal perturbations of polygons.

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…

Study finds finitely many non-congruent polygonal domains with same Steklov spectrum.

New property: polygons have a fixed dimension regardless of ambient space dimensions.

The paper classifies vertices in planar polygons formed by convex domains.

In this paper, we discuss centroaffine geometry of polygons in $3$-space. For a polygon $X$ that is locally convex with respect to an origin together with a transversal vector field $U$, we define the centroaffine dual pair $(Y,V)$ similarly to [6]. We prove that vertices of $(X,U)$ correspond to flattening points for …

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…

The pentagram map takes a planar polygon $P$ to a polygon $P'$ whose vertices are the intersection points of consecutive shortest diagonals of $P$. 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 $l_1$-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.

Study on Poncelet polygons' centers and circumcenters in various geometries.

The study proves analogues of the discrete isoperimetric inequality in hyperbolic geometry.

New formula for spherical polygon area via prequantization.

The map S transforms polygon sides, and almost no convex polygons remain convex.

Study identifies personality traits from dance movements in music.

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.

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…

Our team of dance artists, physicists, and machine learning researchers has collectively developed several original, configurable machine-learning tools to generate novel sequences of choreography as well as tunable variations on input choreographic sequences. We use recurrent neural network and autoencoder architectur…

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…

Characterizes polygonal surfaces in pseudo-hyperbolic spaces.

Maximal distortion between geodesic and Euclidean diameters in polygonal domains is studied.

Solitons are special polygon midpoints under affine transformations.

Short proof for ideal polygons with near optimal orthogeodesic decomposition.

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.

Fast algorithm samples confined polygons efficiently.

Researchers prove the arc complexes of decorated hyperbolic polygons are balls.

Classifies tilings of hyperbolic plane by regular polygons.

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 $b$ on the space of those isometric deformations which, for conv…

We prove that, among all convex hyperbolic polygons with given angles, the perimeter is minimized by the unique polygon with an inscribed circle. The proof relies on work of J.-M.\ Schlenker.

New method finds lattice polygons that can be dissected into triangles with integer areas.