Cyclic quadrangles from squares.
Čerin, Zvonko, Gianella, Gian Mario (2006)
Annales Mathematicae et Informaticae
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “On the Impossibility of one Ruler-and-Compass Construction”
Cyclic quadrangles from squares.
Cyclic polygons of integer points
M. N. Huxley, S. V. Konyagin (2009)
Acta Arithmetica
Similarity:
A stability theorem for the area sum of a convex polygon and its polar reciprocal.
Florian, August (1998)
Mathematica Pannonica
Similarity:
A minimum-problem on areas of inscribed and circumscribed polygons of a circle
John Aczél, Ladislas Fuchs (1951)
Compositio Mathematica
Similarity:
Morse index of a cyclic polygon
Gaiane Panina, Alena Zhukova (2011)
Open Mathematics
Similarity:
It is known that cyclic configurations of a planar polygonal linkage are critical points of the signed area function. In the paper we give an explicit formula of the Morse index for the signed area of a cyclic configuration. We show that it depends not only on the combinatorics of a cyclic configuration, but also on its metric properties.
Areas of Polygons Inscribed in a Circle.
D.P. Robbins (1994)
Discrete & computational geometry
Similarity:
A note about Bezdek's conjecture on covering an annulus by strips.
Zhang, Yuqin, Ding, Ren (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Cyclic presentations of the trivial group.
Edjvet, Martin, Hammond, Paul, Thomas, Nathan (2001)
Experimental Mathematics
Similarity:
Approximating the MaxMin and MinMax Area Triangulations using Angular Constraints
Mark Keil, J, Vassilev, Tzvetalin (2010)
Serdica Journal of Computing
Similarity:
* A preliminary version of this paper was presented at XI Encuentros de Geometr´ia Computacional, Santander, Spain, June 2005. We consider sets of points in the two-dimensional Euclidean plane. For a planar point set in general position, i.e. no three points collinear, a triangulation is a maximal set of non-intersecting straight line segments with vertices in the given points. These segments, called edges, subdivide the convex hull of the set into triangular regions called...
On the construction of cyclic quadruple systems
K. T. Phelps (1980)
Colloquium Mathematicae
Similarity: