Related papers: Symplectifying Biarcs
This article provides an overview of the techniques related to classification of spherical and more general objects within triangulated categories, and its relationship with algebraic geometry, representation theory and symplectic geometry.…
Inscribed angles are investigated in taxicab geometry with application to the existence and uniqueness of inscribed and circumscribed taxicab circles of triangles.
We solve the following geometric problem, which arises in several three-dimensional applications in computational geometry: For which arrangements of two lines and two spheres in R^3 are there infinitely many lines simultaneously…
Some geometry on non-singular cubic curves, mainly over finite fields, is surveyed. Such a curve has 9,3,1 or 0 points of inflexion, and cubic curves are classified accordingly. The group structure and the possible numbers of rational…
In this note we give simple symplecticity conditions for implicit schemes in the linear case. We consider implicit maps on generic symplectic manifold and we introduce the concept of consistent implicit maps, to generalize the symplecticity…
We construct special conics configurations from some points configurations which are the singularities of the dual of a quartic curve.
Complex algebraic varieties become easy piecewise-linear objects after passing to the so-called tropical limit. Geometry of these limiting objects is known as tropical geometry. In this short survey we take a look at motivation and…
We study natural additional structures on real algebraic surfaces with trivial first homology mod 2 of the complexification. If the set of real points realizes the zero of the second homology mod 2 of the complexification, then the set of…
We survey the relationship between the combinatorics and geometry of graphs and the algebraic structure of right-angled Artin groups. We concentrate on the defining graph of the right-angled Artin group and on the extension graph associated…
The purpose of this short manuscript is to show that all point constructions that can be done via ruler and compass, can also be done with compass exclusively. If we are using compass and ruler the way we construct new points is by first…
Using a notation of corner between edges when graph has a fixed rotation, i.e. cyclical order of edges around vertices, we define combinatorial objects - combinatorial maps as pairs of permutations, one for vertices and one for faces.…
This paper deals with the merging problem of segments of a composite B\'ezier curve, with the endpoints continuity constraints. We present a novel method which is based on the idea of using constrained dual Bernstein polynomial basis (P.…
We consider the Tarski--Bang problem about covering of convex bodies by planks. The results of this kind give a lower bound on the sum of widths of planks (regions between a pair of parallel hyperplanes) covering a given convex body.…
This article has been written for an educational magazine whose target audience consists of students and teachers of mathematics in universities, colleges and schools. It concerns a notion of duality between rectangles. A proof is given…
Numerous studies have reported two types of doubling of invariant closed curves (ICCs) in dynamical systems: (a) the creation of two disjoint ICCs such that iterations flip between them; and (b) the creation of a single ICC of double the…
Straight lines are common features in human made environments, which makes them a frequently explored feature for control applications. Many control schemes, like Visual Servoing, require the 3D parameters of the features to be estimated.…
We prove that curve shortening flow on the round sphere displays sharp chord-arc improvement, precisely as in the planar setting (Andrews and Bryan, Comm. Anal. Geom., 2011). As in the planar case, the sharp estimate implies control on the…
We develop a Morse-Lusternik-Schnirelmann theory for the distance between two points of a smoothly embedded circle in a complete Riemannian manifold. This theory suggests very naturally a definition of width that generalises the classical…
On the one hand the algebras of linear operators here act on finite-dimensional vector spaces, and on the other hand the point of view is generally an analysts'. Also, one might think of algebras as being used to add more data to basic…
Entropic regularization is a method for large-scale linear programming. Geometrically, one traces intersections of the feasible polytope with scaled toric varieties, starting at the Birch point. We compare this to log-barrier methods, with…