Related papers: A "right" path to cyclic polygons

In "Unsolved Problems in Number Theory" problem D22 Richard Guy asked for the existence of simplices with integer lengths, areas, volumes... In dimension two this is well known, these triangles are called Heron triangles. Here I will…

We enumerate certain geometric equivalence classes of subgraphs induced by Hamiltonian paths and cycles in complete graphs. Said classes are orbits under the action of certain direct products of dihedral and cyclic groups on sets of strings…

This paper studies the straight skeleton of polyhedra in three dimensions. We first address voxel-based polyhedra (polycubes), formed as the union of a collection of cubical (axis-aligned) voxels. We analyze the ways in which the skeleton…

We prove that almost every triangle can be dissected only into $n^2$ triangles which have to be equal one another. Moreover, such a dissection is unique for every $n$. It turns out that to solve this "simple" problem it is convenient to use…

The Three Gap Theorem states that for any $\alpha \in \mathbb{R}$ and $N \in \mathbb{N}$, the fractional parts of $\{ 0\alpha, 1\alpha, \dots, (N - 1)\alpha \}$ partition the unit circle into gaps of at most three distinct lengths. We prove…

In this work, we define a triangle area number to be the area number of a triangle whose sides have integer lengths, and whose area is a rational number. In Result 3, on page 17, we prove that every triangle area number is in fact an…

We provide an alternative unified approach for proving the Pythagorean theorem (in dimension $2$ and higher), the law of sines and the law of cosines, based on the concept of shape derivative. The idea behind the proofs is very simple: we…

Given the n vertices of a convex polygon in cyclic order, can the triangle of maximum area inscribed in P be determined by an algorithm with O(n) time complexity? A purported linear-time algorithm by Dobkin and Snyder from 1979 has recently…

This paper proposes an algorithm for clipping line segment against an axis-aligned rectangular window. The conventional algorithms for line segment clipping treat the clipping boundary and/or the line segment to be clipped as line. The…

Cyclic boundaries are used in many branches of physics and mathematics, typically to assist the approximation of a large space. We show that when determining the performance of planar, fault-tolerant, topological quantum error correction,…

The formula for the dihedral angle of the simplex of n dimensions, arccos(1/n), is derived using classical geometry.

We consider the following geometric optimization problem: find a maximum-area rectangle and a maximum-perimeter rectangle contained in a given convex polygon with $n$ vertices. We give exact algorithms that solve these problems in time…

We prove a symmetric version of B\'ezout's theorem. More precisely, we show that the symmetric orbit type of a transverse intersection of complex symmetric hypersurfaces in projective space is determined by the degrees. In the projective…

Sphere fitting is a common problem in almost all science and engineering disciplines. Most of methods available are iterative in behavior. This involves fitting of the parameters in a least square sense or in a geometric sense. Here we…

The aim of this paper is to extend and generalise some work of Katona on the existence of perfect matchings or Hamilton cycles in graphs subject to certain constraints. The most general form of these constraints is that we are given a…

Lichtenbaum proved that index and period coincide for a curve of genus one over a $p$-adic field. Salberger proved that the Hasse principle holds for a smooth complete intersection of two quadrics $X \subset P^n$ over a number field, if it…

High proved the following theorem. If the intersections of any two congruent copies of a plane convex body are centrally symmetric, then this body is a circle. In our paper we extend the theorem of High to spherical and hyperbolic planes.…

Polytopes are the basic finite data structures for convex sets: they appear as feasible regions in linear optimization, as geometric summaries in algorithms, and as random objects in stochastic geometry. A natural geometric question is…

Geometry is essentially a global language, which is fully understood in different times, countries and cultures. The proof of a geometric theorem (e.g. the Pythagorean Theorem) or a geometric construction (e.g. the construction of an…

High proved the following theorem. If the intersections of any two congruent copies of a plane convex body are centrally symmetric, then this body is a circle. In our paper we extend the theorem of High to spherical, Euclidean and…