<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD v1.0 20120330//EN" "JATS-archivearticle1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink">
  <front>
    <journal-meta />
    <article-meta>
      <title-group>
        <article-title>A Constructive Algorithm for Transforming Conics in a Circle on Imaginary Laguerre Points</article-title>
      </title-group>
      <contrib-group>
        <aff id="aff0">
          <label>0</label>
          <institution>St. Petersburg State University of Telecommunication</institution>
          ,
          <addr-line>Bol'shevikov, 22/1, Saint-Petersburg, 193232</addr-line>
          ,
          <country country="RU">Russia</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>The article is devoted to the consideration of the properties of Laguerre points in their constructive relationship with the solution of the problem of transforming a pair of conical curves into two circles. Geometric schemes are presented that reveal the principle of specifying a collinear transformation that establishes a correspondence between conics and their images in the form of circles, including if the Laguerre points defining this transformation are imaginary. In the solution of the problem, a geometric scheme for the formation of the main conjugations of conics is given, one of which is a circle. The conclusion is substantiated that the radical axis of the bundle of circles is a circle that has split into a pair of straight lines, one of which is infinitely distant. An algorithm for the formation of a series of elliptic curves induced by Laguerre points is presented. Laguerre points, involution of point series, collineation, conjugation of conical curves</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. Introduction</title>
      <p>
        The development and improvement of modern information technologies in the field of geometric
modeling has provided constructive geometry with new opportunities both in the field of supporting
information-intensive scientific research and in the application of its methods for solving practical
problems [
        <xref ref-type="bibr" rid="ref4 ref8 ref9">4, 8, 9</xref>
        ]. It became possible to create and implement in drawings models of images and
transformations [
        <xref ref-type="bibr" rid="ref1 ref15 ref16">1, 15, 16</xref>
        ] not only two-dimensional and three-dimensional, but also multidimensional
spaces, as well as to implement such models in the form of automatically synthesized programs
executed on various computing devices [
        <xref ref-type="bibr" rid="ref16 ref4">4, 16, 24</xref>
        ]. The emerging opportunities aroused interest in new
studies of seemingly well-studied mathematical images: conics, quadrics and related images of
multidimensional spaces [
        <xref ref-type="bibr" rid="ref20 ref3 ref5 ref6 ref7">3, 5-7, 20</xref>
        ]. The solution of problems operating with such images becomes
extremely difficult without taking into account the presence of imaginary images in them; it requires
research related to the search for new yet unknown regularities, understanding their geometrical nature
and formulating generalizations, developing new determinants of the investigated images and their
attendant transformations. This paper presents some results of research of such kind on the example of
identifying the relationship of Laguerre points with quadratic images of a plane.
      </p>
      <p>
        A collinear transformation defined in a plane associates the linear preimages incident with this plane
with the corresponding linear images, and maps second-order curves to second-order curves [
        <xref ref-type="bibr" rid="ref13">13, 25</xref>
        ].
Since in affine geometry the circle is a particular form of a curve of the second order, and in projective
geometry it does not differ among curves of the second order in general, then it, naturally, is transformed
by any non-identical collineation into some conical section. Collinear transformations form a group;
therefore, there is also an inverse transformation that takes an arbitrary non-degenerate conic to a circle.
      </p>
      <p>The method for determining the frame of such a collineation is to select a homology (a particular
form of a collinear transformation) in which two points of the preimage and the image, respectively,
coincided, and the remaining two points of the second-order curve would translate a pair of cyclic points
of the plane at which all circles of the plane have common crossection. Cyclic points by their nature are</p>
      <p>
        2021 Copyright for this paper by its authors.
imaginary [
        <xref ref-type="bibr" rid="ref10 ref11 ref12 ref14 ref17 ref19 ref21">10-12, 14, 17, 19, 21, 23</xref>
        ] and they are incident to the line of infinity. Algorithms for
performing such a transformation are well known [
        <xref ref-type="bibr" rid="ref18 ref22">18, 22</xref>
        ], and, based on the incidence with the line at
infinity, they do not require reference to the imaginary values of cyclic points.
      </p>
      <p>
        A natural continuation of this problem is a search for transformation of two arbitrary non-degenerate
conics into two circles by means of a collinear conversion. The presence of such an algorithm makes it
possible, for example, to solve the problem of smooth conjugation of two conics by the third conic. In
[
        <xref ref-type="bibr" rid="ref18 ref22">18, 22</xref>
        ], it was shown how the search for the frame of such a collinear transformation is carried out. A
distinctive feature of this algorithm is the use of Laguerre points [
        <xref ref-type="bibr" rid="ref13 ref2">2, 13, 25</xref>
        ] originating from equal
involutions induced by both conics on some straight line.
      </p>
      <p>However, despite the legitimacy and general correctness of this approach to solving the problem, in
its practical solution, certain instrumental difficulties may arise due to the fact that Laguerre points may
turn out to be imaginary, and it becomes difficult to perform a collinear transformation by conventional
means.</p>
      <p>This article is devoted to the consideration of a set of algorithms and related issues of constructive
geometry, which make it possible to overcome the difficulties of performing a collinear transformation
that depends on the complex values of Laguerre points.</p>
    </sec>
    <sec id="sec-2">
      <title>2. Conic conjugation algorithms</title>
      <p>Let two ellipses a and b having no real points of intersection be given on the plane (Fig. 1).</p>
      <p>Let's perform the polar conic a transformation with respect to the conic b : a  b  a and the conic
b transformation with respect to the conic a : b   a b . Let’s find the intersection points of the conics
K1, K2 , K3 , K4  b  a and L1, L2 , L3 , L4  a  b . The points of intersection of the diagonals of a
hexagon, built on four points K1, K2 , K3 , K4 , allow to define an auto-polar triangle with vertices P , Q
и R relative to the conic b . It is easy to show that the diagonals of a hexagon, built on four points
L1, L2 , L3 , L4 , form an auto-polar triangle with the same vertices, i.e. coinciding with the one already
built. Thus, the triangle PQR is a common auto-polar triangle for both original conics a and b .</p>
      <p>Let us find the intersection points of the straight line QR with the original conics a and b :
A1, A2  QR  a , B1, B2  QR  b as well as the images of the infinitely distant straight line i in the
polarities  a and  b : Ca a (i ) and Cb b (i ) . Draw a straight line p  QR  Z  passing the point
P ; p ~ P . Considering the pair p  P as a common tangent to the conics a and b , let’s construct
these conics by making the connection a  A1 A2 Ca P p and b  B1 B2 Cb P p . By
construction, these conics at the intersection have a common double point P , and also form two more
separate points U ,V  a  b . Straight lines PU  u and PV  v are those lines on which the original
a b a b
conics a and b induce the corresponding equal involutions u u u u and v v v v . In fact, these
lines pass through the corresponding complex conjugate points formed by the intersection of the
original conics a and b .</p>
      <p>Choosing any of the obtained lines, u , for example, we define on it an involution from any of the
a
original conics. Conic a induces an involution u u . The involution of a point series on a straight line
that does not have real intersection points with the conic inducing involution, forms two real Laguerre
points G1 and G2 , from which each pair of corresponding points of the series is visible at right angles.
Taking as the center of homology one of the Laguerre points, say G1 , and two arbitrary non-coinciding
points S  T , S ~ u T ~ u , draw lines s  G1 S and t  G1 T and define the corresponding infinitely
distant points S  and T  on them. As the axis of homology, we choose an arbitrary line x u and
project points S and T onto it from the center G1 to obtain the corresponding points S* and T *. Then</p>
      <p>S, S*,T ,T *
collineation  S  , S*,T  ,T * will provide the transformation a*   a and b*   b , where a* and
b* are the essence of the circle (Fig. 2).</p>
      <p>a
Figure 2: Converting two conics to two circles based on real Laguerre points</p>
      <p>As it can be seen from the presented example, when executing the algorithm, there was no need to
explicitly refer to objects with complex-valued values, which means that all constructions can be
performed using traditional tools on sets of real values of objects. Drawing conjugate circles to circles
a* and b* transforming the result in reverse collineation  1 provides control over the process of
constructing conic conjugates of the two original conics a and b .</p>
      <p>Let us now consider the same algorithm, but with different initial data. Let the initial curves a and
b are two hyperbolas located on the plane as shown in Fig. 3.</p>
      <p>Performing the same operations as in the previous case, we will come to the conclusion that the
Laguerre points G1 and G2 will turn out to be complex-valued, which means that it becomes impossible
to perform the collinear transformation  with conventional tools (Fig. 4).</p>
      <p>To solve this problem, consider an auxiliary problem. Let there be some conic m and a straight line
n that has real-valued points N1 and N2 at the intersection with the conic. This means that the
m
involution n n is of hyperbolic type and its Laguerre points are imaginary. Let us find the required
collineation  by performing a number of indirect additional actions.</p>
      <p>Consider the following construction. Let's draw a circle passing through antipodal points N1 and
N2 . Note that the radius of this circle is equal in absolute value to the radius of the imaginary circle,
which could be drawn on imaginary antipodal points G1 and G2 . Draw the perpendicular h  n , h ~ Cd
from the center Cd ~ n of the circle d . A straight line h intersecting a circle d forms real points
J1, J2  h  d . By analogy with the previous algorithm, we construct a collineation  according to the
following scheme: draw a straight line y n , mark two arbitrary points E ~ n and F ~ n on a straight
line n , and project them from the center J1 onto a straight line y to obtain points E* ~ y and F* ~ y
. Using straight lines e  J1 E
and f  J1</p>
      <p>F , let’s define the infinitely distant points E and F 
and determine the collineation </p>
      <p>E, E*, F , F *
E , E*, F  , F *</p>
      <p>.</p>
      <p>Having now performed the collinear transformation of the conic m , we obtain a conic m*    m
that is not a circle, but an equilateral hyperbola. Therefore, a conic m* has two principal conjugate
conics, one of them is a circle. By denoting the collineation  that transforms the hyperbola into a
circle, we obtain the formula for the required collineation    ; m**   m . Thus, the appearance
of complex-valued Laguerre points in the construction is not an obstacle to solving the problem, and it
can be performed without referring to imaginary images (Fig. 5).</p>
      <p>Let's get back to the main task. Keeping the notation used in the additional construction, we complete
its solution. The result is shown in Fig. 6. As in the previous example, the controlled construction of
circles to circles a* and b* with the subsequent transformation of the result in reverse collineation  1
allows us to perform conjugation of hyperbolic curves.</p>
      <p>Let's perform a collinear transformation  with respect to lines u and v : u*   u  , v*   v .
It is easy to find that one of these straight lines ( v* ) is the radical axis of the resulting circles, and the
second one becomes the infinitely distant straight line v* . This construction confirms once again that
the radical axis of a bundle of circles cannot be considered in isolation from the infinitely distant straight
line. In essence, both of these straight lines are items of a degenerate radical circle that split into two
linear parts, and the addition of the radical axis with a second component, an infinitely distant straight
line, eliminates the problem of intersecting a bundle of circles with a straight line from exception. The
proposed extension of the concept of the radical axis provides a single constructive commonality of its
elements, as a result of which, without any restrictions, it can be assumed that any component of such
bundle has two points of intersection with a straight line.</p>
    </sec>
    <sec id="sec-3">
      <title>3. Laguerre points and geometric images induced by them</title>
      <p>a</p>
      <p>It has already been noted that the complex-valued Laguerre points produced by involution u u and
considered as antipodal define an imaginary circle d with a radius equal in magnitude to the radius of
the circle defined at the antipodal points N1 and N2 (Fig. 5). The four focal points of the ellipse have
a similar property (two focuses are real, and the remaining two are complex conjugate). Thus, a number
of elliptic curves are associated with Laguerre points, the method of constructing representatives of
which is shown in Fig. 7.</p>
      <p>Let there be given four focal points  F1, F2  and  F3, F4  , satisfying the above conditions. Let's
choose some control point A and draw a circle w  A F3 F4 . Let’s find the center of the circle w and
draw a straight line through it: m F3F4 , m ~ C . Let's define the points M1, M 2  w  m . Let's
d
construct a circle z  M1 F1 F2 and find its center Cz . The point O that is the center of the circle
d  F1 F2 and considered as the center of the desired ellipse e , as well as the points Cd and Cz allows
you to build an ellipse eO,Cd ,Cz  controlled by the point A . Thus, we have obtained a one-parameter
series of confocal conics induced by Laguerre points in the problem under consideration (Fig. 8). Note
also that the focal circle d and its conjugate paired imaginary circle d  F3 F4 are the inversion circles
for circles t1 and t2 with centers at a point O and are conjugate to the circles w and z , defining a
system of confocal conics and form two conjugate salinons t1  w  t2 and t1  z  t2 .</p>
      <p>A feature of this series is the tendency of the shape of ellipses to the shape of a circle with an increase
in the size of their semiaxes. It can be seen from the drawing that the set of points M1 defines an
isosceles hyperbola g conjugate to a circle d , which implies the existence in this system of one more
isosceles hyperbola, also conjugate to these curves.</p>
    </sec>
    <sec id="sec-4">
      <title>4. Conclusion</title>
      <p>As a result of the study, the following results were obtained:
 the properties of imaginary Laguerre points in their application to the problem of transforming
two arbitrary non-degenerate conics into two circles have been studied;
 structural geometric schemes for solving the corresponding problems are presented;
 the proof of the fact, that the radical axis is a circle of a special kind, split into a pair of straight
lines; one of them is the infinitely distant straight line of the plane is given;
 a new constructive algorithm for the formation of a series of curved lines induced by Laguerre
points is presented.</p>
    </sec>
    <sec id="sec-5">
      <title>5. References</title>
      <p>[23] V.A. Peklich, Mnimaya nachertatel'naya geometriya, Association of construction universities</p>
      <p>Publ., Moscow, 2007. (In Russian)
[24] P.V. Filippov, Nachertatel'naja geometrija mnogomernogo prostranstva i ee prilozhenija,</p>
      <p>LENAND Publ., Moscow, 2016. (In Russian)
[25] N.F. Chetverukhin, Proektivnaja geometrija, Prosveshenie Publ., Moskow, 1953. (In Russian)</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>I.</given-names>
            <surname>Ya</surname>
          </string-name>
          . Bakelman, Inversija, Nauka Publ., Moscow,
          <year>1966</year>
          . (In Russian)
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>E.V.</given-names>
            <surname>Bindyukova</surname>
          </string-name>
          ,
          <article-title>Tochki Lagerra v central'nom proecirovanii</article-title>
          ,
          <source>Cand.Sc. thesis</source>
          , Moscow,
          <year>1986</year>
          . (In Russian)
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>V.</given-names>
            <surname>YA</surname>
          </string-name>
          . Volkov,
          <article-title>Kurs nachertatel'noj geometrii na osnove geometricheskogo modelirovaniya</article-title>
          ,
          <source>SibADI Publ., Omsk</source>
          ,
          <year>2010</year>
          . (In Russian)
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>D.V.</given-names>
            <surname>Voloshinov</surname>
          </string-name>
          ,
          <article-title>Konstruktivnoe geometricheskoe modelirovanie</article-title>
          . Teorija, praktika, avtomatizacija, Saarbrücken: Lambert Academic Publ.,
          <year>2010</year>
          . (In Russian)
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>D. V.</given-names>
            <surname>Voloshinov</surname>
          </string-name>
          ,
          <article-title>Unified constructive algorithm for constructing foci of curves of the second order, Geometriya i grafika (</article-title>
          <year>2018</year>
          )
          <fpage>47</fpage>
          -
          <lpage>54</lpage>
          . doi:
          <volume>10</volume>
          .12737/article_5b559dc3551f95.
          <fpage>26045830</fpage>
          . (In Russian)
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>D. V.</given-names>
            <surname>Voloshinov</surname>
          </string-name>
          ,
          <article-title>Constructive geometric model of four-dimensional space as a basis for solving problems of zoning and positioning in the design of mobile networks, Trudy uchebnyh zavedenij svyazi (</article-title>
          <year>2018</year>
          )
          <fpage>44</fpage>
          -
          <lpage>60</lpage>
          . (In Russian)
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>D. V.</given-names>
            <surname>Voloshinov</surname>
          </string-name>
          ,
          <article-title>On the refinement of some concepts of constructive geometry, in: Trudy Mezhdunarodnoj konferencii po komp'yuternoj grafiki i zreniyu "Grafikon"</article-title>
          ,
          <source>Tomsk</source>
          ,
          <year>2018</year>
          , pp.
          <fpage>350</fpage>
          -
          <lpage>353</lpage>
          . (In Russian)
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>D.V.</given-names>
            <surname>Voloshinov</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.N.</given-names>
            <surname>Solomonov</surname>
          </string-name>
          ,
          <article-title>Hardware and software implementation of constructive geometric models, in: Trudy Mezhdunarodnoj konferencii po komp'yuternoj grafiki i zreniyu "Grafikon"</article-title>
          ,
          <source>St. Peterburg</source>
          ,
          <year>2020</year>
          , pp.
          <fpage>83</fpage>
          -
          <lpage>98</lpage>
          . doi:
          <volume>10</volume>
          .51130/graphicon-2020
          <source>-1-83-98</source>
          . (In Russian)
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>D.V.</given-names>
            <surname>Voloshinov</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.H.</given-names>
            <surname>Zhuraeb</surname>
          </string-name>
          ,
          <article-title>Development of a dynamic model of the blade working surface in the Simplex system, in: Sbornik nauchnyh trudov po materialam mezhdunarodnoj nauchnoprakticheskoj konferencii</article-title>
          ,
          <source>St. Petersburg - Pushkin</source>
          ,
          <year>2020</year>
          , pp.
          <fpage>292</fpage>
          -
          <lpage>295</lpage>
          . (In Russian)
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <given-names>A.G.</given-names>
            <surname>Hirsch</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.A.</given-names>
            <surname>Korotkij</surname>
          </string-name>
          ,
          <article-title>Graphic Algorithms for Reconstructing a Second Order Curve Given by Imaginary Elements, Geometriya i grafika (</article-title>
          <year>2016</year>
          )
          <fpage>19</fpage>
          -
          <lpage>30</lpage>
          . doi:
          <volume>10</volume>
          .12737/22840 (In Russian)
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <given-names>A.G.</given-names>
            <surname>Hirsh</surname>
          </string-name>
          , Nagljadnaja mnimaja geometrija,
          <source>Maska Publ., Moskow</source>
          ,
          <year>2008</year>
          . (In Russian)
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <given-names>A.G.</given-names>
            <surname>Hirsch</surname>
          </string-name>
          , New Descriptive Geometry Problems, Geometriya i grafika (
          <year>2019</year>
          )
          <fpage>18</fpage>
          -
          <lpage>33</lpage>
          . doi:
          <volume>10</volume>
          .12737/
          <fpage>2308</fpage>
          -4898-2020-18-
          <lpage>33</lpage>
          . (In Russian)
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [13]
          <string-name>
            <given-names>N.A.</given-names>
            <surname>Glagolev</surname>
          </string-name>
          , Proektivnaja geometrija, Vysshaya shkola Publ., Moscow,
          <year>1963</year>
          . (In Russian)
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [14]
          <string-name>
            <given-names>O.A.</given-names>
            <surname>Grafskij</surname>
          </string-name>
          ,
          <article-title>Vvedenie mnimyh elementov v nachertatel'nuyu geometriyu, GOU VPO "Dalnevost. State universi-ty of communication lines</article-title>
          .
          <source>Ministry of Railways of Russia" Publ., Khabarovsk</source>
          ,
          <year>2004</year>
          . (In Russian)
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          [15]
          <string-name>
            <given-names>I.D.</given-names>
            <surname>Zhizhilkin</surname>
          </string-name>
          , Inversija. MTSNMO Publ., Moscow,
          <year>2009</year>
          . (In Russian)
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          [16]
          <string-name>
            <given-names>G.S.</given-names>
            <surname>Ivanov</surname>
          </string-name>
          , Konstruirovanie tekhnicheskih poverhnostej,
          <source>Mashinostroenie Publ., Moskow</source>
          ,
          <year>1987</year>
          . (In Russian)
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          [17]
          <string-name>
            <given-names>G.S.</given-names>
            <surname>Ivanov</surname>
          </string-name>
          ,
          <string-name>
            <given-names>I.M.</given-names>
            <surname>Dmitrieva</surname>
          </string-name>
          ,
          <article-title>On descriptive geometry problems with imaginary solutions, Geometriya i grafika (</article-title>
          <year>2015</year>
          )
          <fpage>3</fpage>
          -
          <lpage>8</lpage>
          . (In Russian)
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          [18]
          <string-name>
            <given-names>V.A.</given-names>
            <surname>Korotkij</surname>
          </string-name>
          ,
          <article-title>Central projection of two coplanar conics in two circles, in: Materialy IV mezhdunarodnoj Internet-konferencii "Problemy kachestva graficheskoj podgotovki"</article-title>
          ,
          <source>Perm</source>
          ,
          <year>2014</year>
          . (In Russian)
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          [19]
          <string-name>
            <given-names>V.A.</given-names>
            <surname>Korotkij</surname>
          </string-name>
          ,
          <article-title>Computer visualization of a second-order curve passing through imaginary points and touching imaginary lines, Nauchnaya vizualizaciya (</article-title>
          <year>2018</year>
          )
          <fpage>56</fpage>
          -
          <lpage>68</lpage>
          . (In Russian)
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          [20]
          <string-name>
            <given-names>V.A.</given-names>
            <surname>Korotkij</surname>
          </string-name>
          ,
          <article-title>Conical sections in computer graphics</article-title>
          ,
          <source>in: Materialy 70-j nauchnoj konferencii Nauka YUUrGU</source>
          , Yuzhnoural'sk,
          <year>2018</year>
          , pp.
          <fpage>105</fpage>
          -
          <lpage>109</lpage>
          . (In Russian)
        </mixed-citation>
      </ref>
      <ref id="ref21">
        <mixed-citation>
          [21]
          <string-name>
            <given-names>V.A.</given-names>
            <surname>Korotkij</surname>
          </string-name>
          ,
          <article-title>Imaginary linear elements in algebra, geometry and computer graphics, Prikladnaya matematika i fundamental'naya informatika (</article-title>
          <year>2019</year>
          )
          <fpage>34</fpage>
          -
          <lpage>48</lpage>
          . (In Russian)
        </mixed-citation>
      </ref>
      <ref id="ref22">
        <mixed-citation>
          [22]
          <string-name>
            <given-names>V.A.</given-names>
            <surname>Korotkij</surname>
          </string-name>
          , Contact of conical sections,
          <source>Geometriya i grafika</source>
          (
          <year>2016</year>
          )
          <fpage>36</fpage>
          -
          <lpage>45</lpage>
          . doi:
          <volume>10</volume>
          .12737/21532 (In Russian)
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>