Previous Up Next
Creative Commons License
This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.

2 Quick start with cycle relations

Here is a brief summary how various geometric properties can be expressed through predefined cycle relations. Mathematical aspects of cycle relations will be discussed in § 6.3,

A new cycle can be added to a figure by specifying a list of its relation to other cycles—either already existing or the new cycle itself. In this way we can avoid vicious loops. Thus the concept of a cycle relation is central to this software and we systematically introduce it here. Lists of relations for some common configurations are presented in § 2.5.

A cycle relation from MoebInv library belongs to one of the following categories:

  1. Characterising a geometric property through one or several equations on new cycle’s coefficients—it is typically used in a list with others relations. The most fundamental example is orthogonality (⊥), cf. § 2.1.
  2. Constructing a new cycle—it is used alone or with choosing relations from the next category. An example is a reflection defined by a pair “object-mirror” (⟃).
  3. Choosing a cycle by certain condition, e.g. either its all coefficients are real numbers. Such relations are usually not used themselves, rather they may complement relations of the first two categories.

Thereafter, a meaningful list of relations to define a new cycle has the form:

(some characterising or single constructing) and optional choosing relation(s).

The order of relations in the list is not important. Some relations (at any category) may need additional parameter(s) (real numbers).

All relations except four choosing—Only Real coefficients (ℜ), Only Numeric coefficients (½), Positive orientation (⇧) and Negative orientation (⇩) —link a new cycle to other cycle(s) and can be selected from the respective cycle’s context menu (LeftClick).

Besides the above four exclusions the following relations of a cycle to itself are meaningful:

For this reason all these relations appear in New cycle ↷ ToolBar button, to give an opportunity to define such relations of the new cycle to itself.

2.1 Characterising relations for common geometric properties

The most used relation in this category is Orhogonality(⊥)—a wealth of geometric properties can be expressed by it:

Geometric propertyCycle relationIs linear?
Cycle L is a lineL is Orthogonal (⊥) to infinity (infty=∞)
Cycle L is a Lobachevsky lineL is Orthogonal (⊥) to the real line (R=ℝ)
Cycle A is a pointA is Orthogonal (⊥) to itself
Cycle C passes point AC is Orthogonal (⊥) to A
Line L1 is parallel to line L2L1 is Tangent (⩈) to L2

Usually three independent conditions fully determine a cycle on a plane, e.g.:

Geometric objectList of relations
Line L through two different points A, B {L ⊥ ∞, LA, LB}
Intersection point P of two cycles C and D {PP, PC, PD}
Cycle C has centre A and passes B {C ♓{A,∞}, CB}

In the first case all equations are linear, thus there is at most one solution. In the second case one condition (PP) is quadratic, thus two different solutions may appear. In the third case the relation “in pencil” (♓) spanned by A and ∞ says that C is concentric with A, that is has its centre in A if A is a point. The relation leaves only one degree of freedom, thus the second relation (CB) already defines C uniquely.

Other relations in this category are:

They are described below.

2.2 Constructing relations

Some relations can directly construct a new cycle from already defined cycles. Relations in this category are:

2.3 Choosing relations

We often need to restrict the set of solutions by some additional requirements. For example, the list

{PP, PL1, PL2, P≠∞}

determines the unique (if exists) intersection point of two lines L1 and L2 in the finite plane. The last condition P≠∞ (that is P is Different from ∞) is required to exclude infinity, which is the common point of any two lines.

Relations in this category are:

2.4 List of all known relations

Besides the three categories, relations have other important properties:

In addition to these characterising relations

The possible linearity is an important property greatly simplifying their solutions. However, none of characterising relation is linear if it links a the new cycle to itself.

We summarise all above-mentioned properties of known relations in reference tables below. The columns are:

It is expected that GUI handles all the above aspects of cycle relations in a correct manner.

2.4.1 Characterising relations properties

The next table shows all characterising relations with

 ParCyclesLin?Metric?Name
0+1 ↶Orthogonal
0+1 ↶f-Orthogonal
0+2 In pencil
1+2 ↶(*)Two cycle product ratio
1+3 ↶(*)Cycles cross ratio
1+7 ↶(*)Rate two cross ratios
1+1Steiner Power
1+1Cross Tangent Distance
1+1ArcCos of Cycle Angle
0+1Tangent Both
0+1Tangent Inner
0+1Tangent Outer

(*) Note: the relation may be non-linear if the new cycle is substituted more than once in it.

2.4.2 Constructing relations properties

None of constructing relations may link a new cycle to itself. The required numbers of real parameters, the numbers of other cycles involved and metric independence are as follows:

 ParCyclesMetric?Name
8+1Fractional-linear map
4+1SL(2,R) Moebius map
4+2Ad-hoc cycle reflection
0+2Named cycle conjugation
# 1+1 Instance with index

2.4.3 Choosing relations properties

Last five choosing relations may link the new cycle to itself (indicated by ↶), thus they appear in New cycle ↷ ToolBar button only. Last four relations do not require any other cycle.

 ParCyclesMetric?Name
0+1 Different
0+1 Almost Different
± 1+1 ↶Product sign
½ 0+0 ↶ Only Numeric coefficients
0+0 ↶ Only Real coefficients
0+0 ↶ Positive orientation
0+0 ↶ Negative orientation

2.5 Examples of relations for some common configurations

Some common geometrical configurations can be defined through a single list of cycle relations. We provide below few examples. Here @ refers to the newly created cycle.

Configuration List of cycle relations
Circle passing three points A, B, C
  • orthogonal to A
  • orthogonal to B
  • orthogonal to C
Straight line passing two points A, B
  • orthogonal to A
  • orthogonal to B
  • orthogonal to ∞
Intersection point of lines/circles a, b
  • orthogonal to a
  • orthogonal to b
  • orthogonal to itself
  • for lines only: different from ∞
Perpendicular from point A to line a
  • orthogonal to A
  • orthogonal to a
  • orthogonal to ∞
Line from point A parallel to line a
  • orthogonal to A
  • orthogonal to ∞
  • tangent to a
Midpoint of interval [A,B]
  • orthogonal to line AB
  • orthogonal to itself
  • value of cross ratio ⟨ @, ∞; A, B ⟩ =1
  • different from ∞
Circle with centre O passing point A
  • in pencil spanned by O and ∞
  • orthogonal to A
Centre of circle a
  • in pencil spanned by a and ∞
  • orthogonal to itself
  • different from ∞
Perpendicular line bisecting segment [A,B]
  • in pencil spanned by A and B
  • orthogonal to ∞
Bisector of angle between lines a, b
  • in pencil spanned by a and b
  • rate of cross ratios ⟨ @, a; a, @ ⟩ = ⟨ @, b; b, @ ⟩

An interesting investigation is to see what will be a result of the above constructions if certain points and lines are replaced by various cycles (circles).


Previous Up Next