Intersection Operation on a Complex Plane

2021 ◽  
pp. 19-27
Author(s):  
A. Girsh

Two plane algebraic curves intersect at the actual intersection points of these curves’ graphs. In addition to real intersection points, algebraic curves can also have imaginary intersection points. The total number of curves intersection points is equal to the product of their orders mn. The number of imaginary intersection points can be equal to or part of mn. The position of the actual intersection points is determined by the graphs of the curves, but the imaginary intersection points do not lie on the graphs of these curves, and their position on the plane remains unclear. This work aims to determine the geometry of imaginary intersection points, introduces into consideration the concept of imaginary complement for these algebraic curves in the intersection operation, determines the form of imaginary complements, which intersect at imaginary points. The visualization of imaginary complements clarifies the curves intersection picture, and the position of the imaginary intersection points becomes expected.

2021 ◽  
Vol 9 (1) ◽  
pp. 20-28
Author(s):  
A. Girsh

Two plane algebraic curves intersect at the actual intersection points of these curves’ graphs. In addition to real intersection points, algebraic curves can also have imaginary intersection points. The total number of curves intersection points is equal to the product of their orders mn. The number of imaginary intersection points can be equal to or part of mn. The position of the actual intersection points is determined by the graphs of the curves, but the imaginary intersection points do not lie on the graphs of these curves, and their position on the plane remains unclear. This work aims to determine the geometry of imaginary intersection points, introduces into consideration the concept of imaginary complement for these algebraic curves in the intersection operation, determines the form of imaginary complements, which intersect at imaginary points. The visualization of imaginary complements clarifies the curves intersection picture, and the position of the imaginary intersection points becomes expected.


1991 ◽  
Vol 06 (12) ◽  
pp. 1103-1107 ◽  
Author(s):  
J. SOBCZYK

We present an argument supporting the conjecture that a conformal field theory (CFT) defined on a Riemann surface viewed as a branch covering of CP 1 can be transformed to a CFT on the complex plane in which the information about branching points was coded into certain conformal field insertions.


2019 ◽  
Vol 54 (2) ◽  
pp. 90-97 ◽  
Author(s):  
H. Hakopian ◽  
D. Voskanyan

2012 ◽  
Vol 2012 ◽  
pp. 1-12 ◽  
Author(s):  
Feng-Gong Lang ◽  
Xiao-Ping Xu

A piecewise algebraic curve is a curve defined by the zero set of a bivariate spline function. Given two bivariate spline spaces (Δ) over a domainDwith a partition Δ, the Bezout number BN(m,r;n,t;Δ) is defined as the maximum finite number of the common intersection points of two arbitrary piecewise algebraic curves (Δ). In this paper, an upper bound of the Bezout number for piecewise algebraic curves over a rectangular partition is obtained.


2020 ◽  
Vol 54 (2 (252)) ◽  
pp. 108-114
Author(s):  
N.K. Vardanyan

In this paper we consider the concept of the multiplicity of intersection points of plane algebraic curves $p,q=0,$ based on partial differential operators. We evaluate the exact number of maximal linearly independent differential conditions of degree $k$ for all $k\ge 0.$ On the other hand, this gives the exact number of maximal linearly independent polynomial and polynomial-exponential solutions, of a given degree $k,$ for homogeneous PDE system $p(D)f=0,$ $q(D)f=0.$


Doklady BGUIR ◽  
2019 ◽  
pp. 58-65
Author(s):  
A. A. Butov

The technological process of manufacturing ultra-large integrated circuits includes a number of stages, one of which is the preparation with the help of computer-aided design of input information for the image generator photodetector. Creating a control program for image generation generates a large number of problems, many of which are solved by methods of computational geometry and usually operate with geometric objects such as polygon or rectangle. The purpose of this work was to develop methods for performing a set-theoretic intersection operation on topological objects of the polygon type. The paper analyzes the different variants of the intersection of the sides of polygons with each other and introduces the concept of degenerate and possible intersection points. The rules are formulated to identify degenerate points of intersection of the sides of polygons in order to reduce the number of fragments into which the boundaries of polygons are divided by intersection points, as well as to clarify the status of possible intersection points. Two methods of finding the intersection of polygons are proposed: a simpler basic method, applicable to a wide range of practical problems, and a more complex General method, used in practice much less often. The material of the article relates to research related to the General task of developing a software system for the preparation of topological information for microphotoset image generators.


Sign in / Sign up

Export Citation Format

Share Document