English
Related papers

Related papers: Cramer-Castillon on a Triangle's Incircle and Exci…

200 papers

If P is a point inside triangle ABC, then the cevians through P extended to the circumcircle of triangle ABC create a figure containing a number of curvilinear triangles. Each curvilinear triangle is bounded by an arc of the circumcircle…

History and Overview · Mathematics 2021-01-08 Stanley Rabinowitz

The incircle of a triangle touches the sides of the triangle in three points. It is well known that the lines from these points to the opposite vertices meet at a point known as the Gergonne point of the triangle. We use a computer to…

History and Overview · Mathematics 2022-01-28 Stanley Rabinowitz , Ercole Suppa

In this paper, an efficient algorithm to find the center of the biggest circle inscribed in a given polygon is described. This work was inspired by the publication of Daniel Garcia-Castellanos & Umberto Lombardo and their algorithm used to…

Metric Geometry · Mathematics 2012-12-14 Oscar Martinez

Let P be a point inside a convex quadrilateral ABCD. The lines from P to the vertices of the quadrilateral divide the quadrilateral into four triangles. If we locate a triangle center in each of these triangles, the four triangle centers…

General Mathematics · Mathematics 2022-09-14 Stanley Rabinowitz , Ercole Suppa

Spiral Galaxies is a pencil-and-paper puzzle played on a grid of unit squares: given a set of points called centers, the goal is to partition the grid into polyominoes such that each polyomino contains exactly one center and is 180{\deg}…

Computational Geometry · Computer Science 2022-07-22 Erik D. Demaine , Maarten Löffler , Christiane Schmidt

This is a paper about triangle cubics and conics in classical geometry with elements of projective geometry. In recent years, N.J. Wildberger has actively dealt with this topic using an algebraic perspective. Triangle conics were also…

Metric Geometry · Mathematics 2021-01-12 Ruslan Skuratovskii , Veronika Strarodub

The circumcircle of a planar convex polygon P is a circle C that passes through all vertices of P. If such a C exists, then P is said to be cyclic. Fix C to have unit radius. While any two angles of a uniform cyclic triangle are negatively…

History and Overview · Mathematics 2016-10-04 Steven Finch

This paper proposed a method to judge whether the point is inside or outside of the simple convex polygon by the intersection of the vertical line. It determined the point to an area enclosed by two straight lines, then convert the problem…

Computational Geometry · Computer Science 2022-06-07 Sun Yixuan , Zhu Zhehao

If P is a point inside triangle ABC, then the cevians through P divide triangle ABC into six smaller triangles. We give theorems about the relationship between the radii of the circles inscribed in these triangles.

History and Overview · Mathematics 2019-09-04 Stanley Rabinowitz

If we label the vertices of a triangle with 1, 2 and 4, and the orthocentre with 7, then any of the four numbers 1, 2, 4, 7 is the nim-sum of the other three and is their orthocentre. Regard the triangle as an orthocentric quadrangle.…

History and Overview · Mathematics 2019-10-09 Richard K. Guy

We study families of triangles that are inscribed in a fixed circle and circumscribed about a central conic, extending the classical Chapple--Euler relation within the framework of Poncelet geometry. We establish several geometric…

General Mathematics · Mathematics 2026-04-01 Mohammad Hassan Murad

We study the packing of a large number of congruent and non--overlapping circles inside a regular polygon. We have devised efficient algorithms that allow one to generate configurations of $N$ densely packed circles inside a regular polygon…

Computational Geometry · Computer Science 2023-03-08 Paolo Amore

Delaunay triangulations of a point set in the Euclidean plane are ubiquitous in a number of computational sciences, including computational geometry. Delaunay triangulations are not well defined as soon as 4 or more points are concyclic but…

Computational Geometry · Computer Science 2018-04-05 Vincent Despré , Olivier Devillers , Hugo Parlier , Jean-Marc Schlenker

The Covering Salesman Problem (CSP) is a generalization of the Traveling Salesman Problem in which the tour is not required to visit all vertices, as long as all vertices are covered by the tour. The objective of CSP is to find a minimum…

Data Structures and Algorithms · Computer Science 2021-04-05 Lucas Porto Maziero , Fábio Luiz Usberti , Celso Cavellucci

We consider closed chains of circles $C_1,C_2,\ldots,C_n,C_{n+1}=C_1$ such that two neighbouring circles $C_i,C_{i+1}$ intersect or touch each other with $A_i$ being a common point. We formulate conditions such that a polygon with vertices…

General Mathematics · Mathematics 2025-02-25 Norbert Hungerbühler

We characterize the topological configurations of points and lines that may arise when placing n points on a circle and drawing the n perpendicular bisectors of the sides of the corresponding convex cyclic n-gon. We also provide exact and…

Combinatorics · Mathematics 2022-10-28 Paul Melotti , Sanjay Ramassamy , Paul Thévenin

CP has a natural embedding in superstring models as a gauge symmetry involving inversion of the compactified space. Hence the source of CP violation could be geometrical. Such models face the problem of how to suppress contributions to…

High Energy Physics - Phenomenology · Physics 2007-05-23 Thomas Dent

If $P$ is a point inside $\triangle ABC$, then the cevians through $P$ divide $\triangle ABC$ into smaller triangles of various sizes. We give theorems about the relationship between the radii of certain excircles of some of these…

History and Overview · Mathematics 2019-10-02 Stanley Rabinowitz

We prove that a surface in real 3-space containing a line and a circle through each point is a quadric. We also give some particular results on the classification of surfaces containing several circles through each point.

Algebraic Geometry · Mathematics 2014-01-28 Fedor Nilov , Mikhail Skopenkov

Two planar sets are circularly separable if there exists a circle enclosing one of the sets and whose open interior disk does not intersect the other set. This paper studies two problems related to circular separability. A linear-time…

Computational Geometry · Computer Science 2016-08-31 Jean-Daniel Boissonnat , Jurek Czyzowicz , Olivier Devillers , Mariette Yvinec
‹ Prev 1 2 3 10 Next ›