Conventional R-operations generate singularities in intersection points of boundaries of primitive domains. Some singularities are intrinsic and can not be removed. Others are induced by choosing inappropriate primitives, mathematical expressions and/or order of R-operations and they will be named ``parasitic singularities'' (PSg). In this paper, the R-functions without PSg will be referred to as ``Clean R-functions'' (CRF).
Some modifications to the R-function method and some ideas and strategies for CRF generation are introduced in this paper. A new extension to R-operations is the R3-disjunction of three arguments. Unfortunately, these ideas are not general, but specific to a particular classes of problems.
In conclusion, some questions about unexplored subtopics and suggestions for future research are given. The need to direct research towards generalisation is emphasized.
This paper has an apparently relaxed style, but it has a serious intention to draw reader's attention on some only partially solved problems. The purpose is to inspire somebody to find out a more general approach.
Keywords: R-function, R-operation, singularity
An elegant way to generate smooth real
functions on a compound domain is based on
the R-operation method, invented by Ukrainian mathematician
L. V. Rvachev [1,2]. The method has an analogy with Boolean
algebra. R-functions in
-dimensional Euclidean space are defined as
continuous real functions that meet the following conditions:
Positive values of R-function inside the domain correspond to TRUE values of the Boolean function, and negative values of R-function correspond to FALSE values of the Boolean function. At the boundary, the value of the R-function is equal to zero and the corresponding Boolean truth value is undefined.
R-primitives are smooth functions satisfying conditions 1.1, 1.2 and
1.3 - usually polynomials. For example
is a primitive
R-function. Function values are positive inside the domain (unit
circular disk with centre in the origin of the coordinate system),
equal to zero at the boundary (circle), and negative outside the
domain.
New R-functions can be generated from the ones already defined using
R-operations. R-functions are not unique, because an infinite number
of algebraic expressions corresponds to the same Boolean function. If
and
(Fig. 1a, 1b) are R-functions, the conventional R-operations
are:
| R-negation |
|
(Fig. 1c,h) |
| R-conjunction |
|
(Fig. 1d,h) |
| R-disjunction |
|
(Fig. 1e) |
|
|
|
|
|
|
|
|
is a real constant (or a smooth function) satisfying inequality:
. In this paper
is adopted as a default.
The common multiplication can be included as an additional R-operation corresponding to the Boolean equivalence (Fig. 1f) and, with opposite sign, to the exclusive disjunction (Fig. 1g).
| R-equivalence |
|
(Fig. 1f) |
| R-exclusive disjunction |
|
(Fig. 1g) |
This is an well known and natural idea, although not often explicitly mentioned in connection with R-functions. From the Boolean point of view, this operation is redundant, although it is useful in applications because of the following advantages:
These advantages are illustrated on examples.
Example 1: Two concentric circular disks
and
are given with
.
The circular ring (annulus) can be defined as:
a) R-conjunction of
and negation of
:
b) negation of R-multiplication (R-Xor, i. e. R-exclusive disjunction):
Example 2: Union of six equal circular disks in 2D with centres in
vertices of regular hexagon
(Fig. 2a).
a) A conventional solution:
b) A proposed solution with R-multiplications and only one square root (Fig. 2b,2c,2d):
|
|
(Mirr(p) = mirror image of p)
| |
Problem 1: (A modification of example 2)
Union of five equal circular
disks with centres in vertices of regular pentagon
(Fig. 3).
A complete symmetry of the domain must be preserved in the solution. Only one R-operation with square root (R-conjunction or R-disjunction) is allowed.
Hints:
![]() |
![]() |
[My solutions for this and other problems are given in appendix. They are not unique and do not pretend to be optimal in any sense.]
Problem 2: (A modification of problem 1)
Union of five unequal disks with asymmetric arrangement (Fig. 4).
Again - only one square root is allowed.
Auxiliary primitives are aded in solutions proposed for problems 1 and 2: circular ring and circular disks. Here they play the role of ``patches'' for ``mending'' holes in improper solutions. Generally, the patches can assume a variety of shapes, but must be smooth (without singularities), they must completely cover the holes and lie inside the domain. (In 2D only point contacts of the patches with boundaries are allowed. In 3D - a contacts of the patches with boundaries along a curve are allowed etc.)
The R-conjunction and R-disjunction generate singularities. In points where both arguments have zero values, a subexpression under the square root also has the zero value. These points are singular and lie on intersections of boundaries of primitives.
R-operations are recursive. An ``output'' of one R-operation can be an ``input'' for the next one. The singular points from the ``input'' are inherited in the ``output''. If the new R-operation contains a square root, and if the corresponding domains (defined by positive values of R-functions) partially overlap, then new singularities will be added. (Different types of singularities will not be distinguished.) After subsequent recursion steps, the final R-function can have inner singularities in the domain.
The singularities in the concave (re-entrant) corners of the boundary are intrinsic and can not be removed. (For analogy, in continuum mechanics concave corners are singular points of stress concentration.) Unnecessary singularities at the boundary and inside the domain can be named ``Parasitic Singularities'' (PSg), and must be avoided if possible. The R-functions without PSg will be referred to as ``clean R-functions'' (CRF). Singularities outside the final domain are irrelevant. Nevertheless, they should not be too close to the boundary, because the existence of a singular point disturbs the function in the neighbourhood. (The function is ``almost singular'' near singularities.)
Note: Continuity
for any finite
can be obtained by means of
modified R-operations [2]:
| R-conjunction |
|
| R-disjunction |
|
If
is a R-function with singularities, a selective
continuity
for a particular singular point with coordinates
can be
obtained in a similar way:
Only the full (infinite) continuity will be considered in the remainder of this paper.
Some ad hoc strategies for CRF generation will be presented. Unfortunately, they are neither general nor systematic, and they spoil the elegance of the R-function method. Nevertheless, many simple examples generate interesting problems.
It has not been proven that there are solutions (CRF) for all possible domain shapes. If such solutions do exist, in complicated examples they are difficult to obtain. In any case, the ad hoc strategy ``method'' is inefficient and unpractical for applications.
In addition to some ad hoc strategies, this paper also introduces two modified R-operations: R3-disjunction and R3-conjunction (symmetric extension of R-disjunction and R-conjunction to 3 arguments).
``Weak'' R-functions, which do not necessarily satisfy condition of negative values outside the domain, are also proposed.
Functions which strictly satisfy conditions 1.1 (positive values inside the domain) and 1.2 (zero values on boundary), but not strictly satisfy the condition 1.3 (positive values outside the domain are tolerated), can be named ``weak R-functions''. Positive areas outside domain can have contacts with boundaries only in corners (in 2D). Weak R-functions generally need less square roots and more multiplications and therefore they generate less singularities than the strong ones. A drawback is that the weak R-function itself does not carry sufficient information to distinguish whether some point lies inside or outside of the domain. Additional information is necessary, for example a separate Boolean function.
Example 3: A weak R-function without singularities (CRF) on any convex polygon can be generated as the product of linear functions (the R-equivalence of a half-planes) (Fig. 5):
![]() |
![]() |
On all figures positive values outside of the domain are depicted light gray.
This expression can easily be expanded to convex polyhedra in 3D (and hyperpolyhedra in n dimensions).
(The conventional strong solution is the R-conjunction of the same half-planes.)
Example 4: 3/4 of a circular disk. The weak solution without PSg is presented (Fig. 6). Of course, the circle centre is an intrinsic singular point A.
Example 5: Union of three circular discs with unit radii. The centres lie on vertices of an unit equilateral triangle (Fig. 7a). Primitive R-functions are:
The conventional R-function for union of three primitives is
. This solution has two disadvantages:
b) An symmetrised solution:
The symmetry can be restored by defining a new function as the sum of three conventional R-functions, different only in the order of arguments:
![]() |
![]() A, B - singular |
![]() A - PSg, B - intrinsic |
![]() |
![]() |
Both drawbacks are eliminated, by means of the fourth auxiliary
primitive -a ``patch''
- a disk with a centre in the centre of symmetry,
and radius equal
The triply symmetric CRF solution is (Fig. 7d,e):
Problem 3: Union of three balls with unit radii. The centres lie in vertices of a unit equilateral triangle. This is the 3D variant of the example 5.
Example 6: Union of unit circular disk and a quarter-plane (Fig. 8a).
a) Conventional solution with a PSg:
A infinite quarter-plane is defined as an intersection of two half-planes:
.
The unit circular disk with centre at
origin:
.
The solution is
.
This solution has an PSg at origin (Fig. 8a).
![]() | ||
![]() |
![]() |
![]() |
b) CRF solution:
The CRF is generated by defining an auxiliary primitive - a
half-plane:
(Fig. 8b);
(Fig. 8c);
(Fig. 8d).
In this case the auxiliary primitive is not a ``patch'' as in earlier
examples and problems but a ``cut'' for the elimination of unwanted parts
of original primitives.
Example 7: Two intersecting elliptical disks are given. A R-function
has to be determined on the heart shape domain composed of parts of
elliptical disks (Fig. 9a). This example can not be solved without
auxiliary primitives, even if PSg points are tolerated. Namelly, the
heart shape can not be obtained from elliptical disks if only Boolean
operations, without other primitives, are allowed.
a) Solution with PSg:
Infinite part of the plane bounded with parabola is chosen as an auxiliary primitive. In the first step a subdomain - ``enlarged halfheart'' is generated by R-conjunction from the elliptic disk and parabolic area (Fig. 9b). The second subdomain is the mirror image of the first one. The purpose of the enlargement is overlapping of the two halves. The second step is the R-disjunction of these parts (Fig. 9a).
The R-disjunction generates two singular points in boundary corners. The intrinsic one is in the corner A while the second point, PSg, is in the convex corner B.
![]() B - PSg |
![]() |
![]() B - regular |
![]() C-sigularity outside |
b) CRF solution:
The auxiliary primitive is now a halfplane bounded by a straight line going through the point A, but ``missing'' the point B. The new function, i.e. the R-disjunction of the elliptic disk and the halfplane is generated in the first step (Fig. 9c). The second function is also generated as a mirror image of the first one. The complete solution - a weak R-function - is generated by multiplying these functions (Fig. 9d). This solution has singularities, but not PSg, as the singular points C lie outside the domain and can be tolerated.
Problem 4: ``Photo negative'' of the example 7. The domain is an infinite plane with a heart-shaped opening (hole).
Hints:
The example 4 and many others can be automatically solved by introducing a new R-operation - R-disjunction of 3 arguments:
Examples 8, 9, 10: R3-disjunction (Fig. 10a, 11a, 12a)
On (Fig. 10b, 11b, 12b) is
.
The figure defined by positive values of the subexpression:
(Fig. 10c, 11c, 12c), can be interpreted as an auxiliary
primitive with the same role as
in example 5.
![]() |
![]() |
![]() |
![]() |
![]() |
![]() |
![]() |
![]() |
![]() |
The correctness of analogy of the expression for
with Boolean disjunction is proven by means
of the ``truth table''
| (1) | (2) | (3) | (4) | (5) | (6) |
|
|
|
(4) |
|||
| ? | |||||
(
positive,
negative,
zero, ? non-unique sign)
The column 6 determined by the R-disjunction is identical with the corresponding Boolean disjunction, and therefore the expression is correct.
(There are probably more expressions with R3-disjunction properties, perhaps infinitely many.)
R3-conjunction (of 3 arguments) is defined from a Boolean transformation:
Example 8: Union of four unit balls:
. The centres
are in vertices of the regular unit tetrahedron.
The first compound function is the R-Xor of four balls (product of
four implicit expressions with opposite sign)and it leaves holes
inside the domain at places of penetration of two balls:
.
Every hole can be ``mended'' with a ball-shaped
``patch''. The number of patches is equal to the number of tetrahedron
edges - i.e six:
. The second auxiliary
function is
R-Xor of six patches, and it also leaves similar holes. (The
R-disjunction of patches is not correct because it generates PSg-s.)
.
The R-disjunction of the first and the auxiliary
function
is not an appropriate solution because it also
leaves secondary holes. The secondary holes can be mended with a
secondary patch - the maximal centrally placed ball completely inside
the domain:
. The complete solution is
.
The ad hoc strategies and model problems clearly have a value as a mental recreation exercise but for a more complicated real problems, this ``method'' becomes increasingly difficult and inefficient. More systematic methods for CRF generation should be developed for applications. However, prior to that some theoretical and practical problems must be resolved. The following are only some of the open issues:
Solution of Problem 1:
The product of all given primitives
(Fig. 13a)
is not a proper solution because it has
holes (negative values inside the domain).
These holes are mended by a ``patch'' shaped as a circular ring
(Fig. 13b).
![]() |
![]() |
Solution to Problem 2:
The product of all primitives
also leaves holes similar to the
ones in problem 1. But in the irregular case a substitution of one big
patch with a few ``minipatches'' is easier - one circular disk for every
hole (Fig.14).
![]() |
Solution to Problem 3:
The auxiliary disk - ``patch'' from example 5 - is now substituted with the R-disjunction of the self-intersecting torus and a ball. The torus has a central hole, and the ball is now a ``metapatch'' - the secondary ``patch'' for mending the remaining hole in the primary ``patch''. The R-disjunction generates singularity, but it is located at concave boundary points. This singularity is an intrinsic one for the final domain.
Solution to Problem 4:
a) Obviously, a R-negation of a) solution to example 7 is a simple PSg solution.
b) CRF solution. The auxiliary primitive is now a halfplane bounded
by a straight line going through the point B but ``missing'' the point
A. (Opposite than in example 7). In the first step, the new function
i.e. the R-conjunction of elliptic disk and the halfplane is
generated (Fig. 15a). The second function is a mirror image of the first
one. The complete solution - a weak R-function is generated by
multiplication of these functions. (Fig. 15b) This solution has
singularities, but not PSg. The singular points in the hole (outside
the domain) can be tolerated.
![]() |
![]() |