Related papers: Polygons in Polygons with a Twist
We introduce the notion of manifolds of amalgamation geometry and its generalization, split geometry. We show that the limit set of any surface group of split geometry is locally connected, by constructing a natural Cannon-Thurston map.
A point $p$ is said to be an area center of a polygon if all of the triangles composed of $p$ and its edges have one and the same area. We construct a moduli space $AC_n$ of such $n$-gons and study its geometry and arithmetic. For every…
Splint is a decomposition of root system into union of root systems. Splint of root system for simple Lie algebra appears naturally in studies of (regular) embeddings of reductive subalgebras. Splint can be used to construct branching…
The author has been interested in regions surrounded by cylinders of real algebraic hypersurfaces and their shapes and polynomials associated to them. Here, we formulate and investigate natural decompositions into such cylinders of real…
Given a regular $n$-gon on the plane, it is evident that from any point on the plane, taken as a center, one can draw $n$ concentric circles such that each circle passes through one of the vertices of the polygon. Naturally, this raises the…
A "reduced" differential geometry adapted to the presence of abelian isometries is constructed.Classical T-duality diagonalizes in this setting, allowing us to get conveniently the transformation of the relevant geometrical objects such as…
A cohomology theory for "odd polygon" relations -- algebraic imitations of Pachner moves in dimensions 3, 5, ... -- is constructed. Manifold invariants based on polygon relations and nontrivial polygon cocycles are proposed. Example…
A method is described for constructing, with computer assistance, planar substitution tilings that have n-fold rotational symmetry. This method uses as prototiles the set of rhombs with angles that are integer multiples of pi/n, and…
For a nonorientable surface, the twist subgroup is an index 2 subgroup of the mapping class group. It is generated by Dehn twists about two-sided simple closed curves. In this paper, we study involution generators of the twist subgroup. We…
A generic immersion of a circle into a $2$-sphere is often studied as a projection of a knot; it is called a knot projection. A chord diagram is a configuration of paired points on a circle; traditionally, the two points of each pair are…
This paper presents a general method for obtaining radius of the corresponding circumference to a cyclical polygon $n$ sides given the lengths of said sides, using the notion of complex number. As of radius $r$, obtained, can then be…
We study spin structures on Riemann and Klein surfaces in terms of divisors. In particular, we take a closer look at spin structures on hyperelliptic and $p$-gonal surfaces defined by divisors supported on their branch points. Moreover, we…
We prove that any finite collection of polygons of equal area has a common hinged dissection. That is, for any such collection of polygons there exists a chain of polygons hinged at vertices that can be folded in the plane continuously…
Geometric torsions are torsions of acyclic complexes of vector spaces which consist of differentials of geometric quantities assigned to the elements of a manifold triangulation. We use geometric torsions to construct invariants for a…
The complex or non-hermitian orthogonal polynomials with analytic weights are ubiquitous in several areas such as approximation theory, random matrix models, theoretical physics and in numerical analysis, to mention a few. Due to the…
Given a small polygon S, a big simple polygon B and a positive integer k, it is shown to be NP-hard to determine whether k copies of the small polygon (allowing translation and rotation) can be placed in the big polygon without overlap.…
Guarding a polygon with few guards is an old and well-studied problem in computational geometry. Here we consider the following variant: We assume that the polygon is orthogonal and thin in some sense, and we consider a point $p$ to guard a…
The purpose of this thesis is to study classical combinatorial objects, such as polytopes, polytopal complexes, and subspace arrangements, using tools that have been developed in combinatorial topology, especially those tools developed in…
There are many space subdivision and space partitioning techniques used in many algorithms to speed up computations. They mostly rely on orthogonal space subdivision, resp. using hierarchical data structures, e.g. BSP trees, quadtrees,…
We are interested in easy geometric transformations which regularize n-polygons in the non-euclidean plane. A transformation is called easy if it can be easily implemented into an algorithm. This article is motivated by preceding work on…