Cramer-Castillon on a Triangle's Incircle and Excircles

10/26/2021
by   Dominique Laurain, et al.
0

The Cramer-Castillon problem (CCP) consists in finding one or more polygons inscribed in a circle such that their sides pass cyclically through a list of N points. We study this problem where the points are the vertices of a triangle and the circle is either the incircle or excircles.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/14/2020

The Circumbilliard: Any Triangle can be a 3-Periodic

A Circumconic passes through a triangle's vertices. We define the Circum...
research
09/18/2020

Loci of the Brocard Points over Selected Triangle Families

We study the loci of the Brocard points over two selected families of tr...
research
08/10/2020

Obnoxious facility location: the case of weighted demand points

The problem considered in this paper is the weighted obnoxious facility ...
research
12/30/2021

Triads of Conics Associated with a Triangle

We revisit constructions based on triads of conics with foci at pairs of...
research
05/03/2021

Makespan Trade-offs for Visiting Triangle Edges

We study a primitive vehicle routing-type problem in which a fleet of nu...
research
09/19/2016

Preorder-Based Triangle: A Modified Version of Bilattice-Based Triangle for Belief Revision in Nonmonotonic Reasoning

Bilattice-based triangle provides an elegant algebraic structure for rea...
research
01/12/2018

The DCS Theorem

Blockchain design involves many tradeoffs, and much debate has focused o...

Please sign up or login with your details

Forgot password? Click here to reset