Ray-Circle Complementarity Overview

• Ray-circle complementarity is a cluster of relationships that embed circle graphs into ray intersection graphs, offering insights in both graph theory and computational geometry.
• It establishes an exact graph complementation between two-directional orthogonal ray graphs and circular-arc graphs with clique cover number two using normalized representations.
• The concept also extends to feasibility analyses in ray-circle contact equations and asymmetries in symplectic geometry, underpinning diverse algorithmic applications.

Ray-circle complementarity is not a formal theorem name in the cited literature. It is best understood as a cluster of technically distinct relationships between ray-based and circle-based models: a constructive embedding of circle graphs into ray intersection graphs, an exact graph-complement correspondence between two-directional orthogonal ray graphs and complements of circular-arc graphs with clique cover number two, and a complementarity-style feasibility view of ray-circle contact equations. In a separate and explicitly asymmetric sense, symplectic excision results concern complements of properly embedded rays rather than circles (Kerkhof et al., 2021, Takaoka, 2024, Skala, 2022, Tang, 2018).

1. Terminological scope and foundational models

A circle graph is the intersection graph of a finite set of chords of a circle. If a graph $G=(V,E)$ is represented by chords $c_v$, then

$uv\in E \iff c_u\cap c_v\neq \emptyset$

with intersection understood as crossing of chords in their interiors. A ray is a half-line

$r=\{p+\lambda d:\lambda\ge 0\},$

where $p\in \mathbb R^2$ is the origin and $d\neq 0$ is a direction vector. A ray intersection graph is the intersection graph of a collection of rays: $uv\in E \iff r_u\cap r_v\neq \emptyset.$ A grounded ray graph is one in which all ray origins lie on a common curve, and a downward ray graph in the cited sense is one in which all rays point into a common half-plane; in the construction of (Kerkhof et al., 2021), all rays point toward the upper-right quadrant (Kerkhof et al., 2021).

A second ray model is the two-directional orthogonal ray graph. This is a bipartite graph with bipartition $(U,V)$ represented by rightward rays $R(u)$, $u\in U$, and downward rays $c_v$0, $c_v$1, such that

$c_v$2

Under the assumption that no two endpoints share an $c_v$3- or $c_v$4-coordinate, the same class admits an order-theoretic formulation: $c_v$5 This makes the class inherently bipartite and places it in direct correspondence with certain circle-based complement classes (Takaoka, 2024).

On the circle side, a circular-arc graph is the intersection graph of arcs on a circle. For any graph $c_v$6, its complement $c_v$7 satisfies

$c_v$8

A graph has clique cover number two if its vertex set can be partitioned into two cliques; equivalently, it is the complement of a bipartite graph (Takaoka, 2024).

These definitions already show that “complementarity” has more than one meaning in this area. In some results it means constructive translation between geometric models; in others it means graph complementation; in still others it denotes a complement of a geometric object in an ambient manifold or a complementarity-style feasibility condition for intersection equations.

2. Constructive containment of circle graphs in ray intersection graphs

The principal circle-to-ray theorem states that the class of circle graphs is contained in the class of ray intersection graphs. More precisely, every circle graph can be embedded as the intersection graph of a set of rays such that every ray is grounded on a common curve, every ray points towards the upper right quadrant, and every ray is described by a point and a vector with polynomial bit complexity (Kerkhof et al., 2021). Formally, if $c_v$9 is a circle graph, then there exists a set of rays $uv\in E \iff c_u\cap c_v\neq \emptyset$0 such that

$uv\in E \iff c_u\cap c_v\neq \emptyset$1

The construction is representation-level rather than merely graph-theoretic. Starting from a chord representation, one chooses a cut point on the circle, traverses clockwise, and replaces the cyclic order of the $uv\in E \iff c_u\cap c_v\neq \emptyset$2 chord endpoints by a linear order of points on the rapidly growing convex curve

$uv\in E \iff c_u\cap c_v\neq \emptyset$3

If a chord has endpoints in positions $uv\in E \iff c_u\cap c_v\neq \emptyset$4, the corresponding ray starts at $uv\in E \iff c_u\cap c_v\neq \emptyset$5 and passes through $uv\in E \iff c_u\cap c_v\neq \emptyset$6: $uv\in E \iff c_u\cap c_v\neq \emptyset$7 The circle has thus been “cut” and “unrolled” into a linear order, so chord crossing becomes the alternation pattern $uv\in E \iff c_u\cap c_v\neq \emptyset$8 or $uv\in E \iff c_u\cap c_v\neq \emptyset$9 (Kerkhof et al., 2021).

The geometric core is the lemma asserting that the far-right tails of such rays do not create spurious intersections. If $r=\{p+\lambda d:\lambda\ge 0\},$0 is the ray from $r=\{p+\lambda d:\lambda\ge 0\},$1 through $r=\{p+\lambda d:\lambda\ge 0\},$2 and $r=\{p+\lambda d:\lambda\ge 0\},$3 is the subray starting at $r=\{p+\lambda d:\lambda\ge 0\},$4, and similarly $r=\{p+\lambda d:\lambda\ge 0\},$5 are defined from $r=\{p+\lambda d:\lambda\ge 0\},$6, then $r=\{p+\lambda d:\lambda\ge 0\},$7 and $r=\{p+\lambda d:\lambda\ge 0\},$8 do not intersect. Hence

$r=\{p+\lambda d:\lambda\ge 0\},$9

This guarantees that ray intersection matches intersection of the finite chord-like segments between endpoint points on the curve, and therefore matches chord crossing in the original circle representation (Kerkhof et al., 2021).

The factorial curve is used because it is increasing, strongly convex, and grows fast enough to separate relevant slopes. The coordinates also have polynomial bit complexity because

$p\in \mathbb R^2$0

Accordingly, each ray can be specified with polynomially many bits (Kerkhof et al., 2021).

This result is explicitly one-way. The cited paper does not claim that every ray intersection graph is a circle graph. A plausible implication is that the phrase “ray-circle complementarity,” in this setting, is better understood as a controlled containment theorem than as an equivalence theorem.

3. Graph complementation between orthogonal ray graphs and circular-arc graphs

A sharper form of ray-circle complementarity appears for two-directional orthogonal ray graphs. The relevant equivalence is

$p\in \mathbb R^2$1

Equivalently, if $p\in \mathbb R^2$2 denotes the class of two-directional orthogonal ray graphs and $p\in \mathbb R^2$3 the class of circular-arc graphs with clique cover number two, then

$p\in \mathbb R^2$4

This is the most explicit graph-complement statement linking a ray model and a circle-based model in the cited literature (Takaoka, 2024).

The combinatorial basis for the equivalence is immediate from bipartiteness. If $p\in \mathbb R^2$5 has bipartition $p\in \mathbb R^2$6, then there are no edges inside $p\in \mathbb R^2$7 or inside $p\in \mathbb R^2$8; therefore, in $p\in \mathbb R^2$9, both $d\neq 0$0 and $d\neq 0$1 become cliques. The geometric basis is encoded through normalized circular-arc representations. By the cited normalization theorem, a circular-arc graph with vertex partition into two cliques $d\neq 0$2 has a normalized representation with two points $d\neq 0$3 on the circle such that every $d\neq 0$4-arc contains $d\neq 0$5 but not $d\neq 0$6, and every $d\neq 0$7-arc contains $d\neq 0$8 but not $d\neq 0$9 (Takaoka, 2024).

From such a normalized circular-arc representation of $uv\in E \iff r_u\cap r_v\neq \emptyset.$0, one obtains a normalized ray representation of $uv\in E \iff r_u\cap r_v\neq \emptyset.$1 by reading endpoint orders from the two $uv\in E \iff r_u\cap r_v\neq \emptyset.$2-to-$uv\in E \iff r_u\cap r_v\neq \emptyset.$3 boundary chains. Clockwise traversal from $uv\in E \iff r_u\cap r_v\neq \emptyset.$4 to $uv\in E \iff r_u\cap r_v\neq \emptyset.$5 yields one linear order, and counterclockwise traversal yields the second. These become the $uv\in E \iff r_u\cap r_v\neq \emptyset.$6- and $uv\in E \iff r_u\cap r_v\neq \emptyset.$7-orders of the ray representation. The paper states that it is routine to check that the resulting pair of orders is a normalized representation of $uv\in E \iff r_u\cap r_v\neq \emptyset.$8 (Takaoka, 2024).

Normalization is governed by neighborhood containment. For a normalized two-directional orthogonal ray representation,

$uv\in E \iff r_u\cap r_v\neq \emptyset.$9

$(U,V)$0

The circular-arc side has the corresponding containment rule

$(U,V)$1

These parallel containment conditions explain why normalized circle representations can be converted into normalized ray representations (Takaoka, 2024).

The same paper also studies unique representability. For connected $(U,V)$2, the following are equivalent: $(U,V)$3 is uniquely representable, $(U,V)$4 contains no buried subgraph, and the auxiliary graph $(U,V)$5 has two non-trivial components (Takaoka, 2024). This suggests that the complementarity is not merely class-theoretic: structural ambiguity on the ray side reflects structural ambiguity inherited from normalized circular-arc complements.

4. Complement constructions internal to ray intersection graphs

A different complement theorem places rays at the target of a planar-graph construction. Any planar graph has an even subdivision whose complement is a ray intersection graph, and the subdivision and the ray representation can be computed in polynomial time (Cabello et al., 2011). This does not involve circles as represented objects, but it is central for understanding the range of complement constructions available on the ray side.

The proof builds a geometric reference frame from circular arcs $(U,V)$6 and families $(U,V)$7 of rays. The arcs are auxiliary guides rather than represented objects. Two geometric lemmas are pivotal: when $(U,V)$8, any ray from $(U,V)$9 intersects any ray from $R(u)$0; and any ray tangent to $R(u)$1 at a point $R(u)$2 intersects any ray from $R(u)$3, except those having their origin at $R(u)$4 (Cabello et al., 2011). These lemmas create a layered intersection regime.

The first structural step is the snooker representation of the complement of an embedded tree. Each vertex at level $R(u)$5 is represented by a ray in $R(u)$6; if $R(u)$7 has parent $R(u)$8, the ray for $R(u)$9 passes through the origin of the ray for $u\in U$0. Because the construction uses open rays, passing through another ray’s origin does not count as an intersection. Parent-child pairs therefore become precisely the nonedges required in the complement of the tree (Cabello et al., 2011).

The second step handles an admissible extension $u\in U$1 of the tree $u\in U$2, where maximal added paths have 3 or 4 vertices and join consecutive leaves on the same level. The cited extension lemma states that the complement of $u\in U$3 is again a ray intersection graph. A further combinatorial lemma shows that any embedded planar graph has an even subdivision of exactly this form, with $u\in U$4 an embedded tree and $u\in U$5 an admissible extension (Cabello et al., 2011).

This line of work yields a complement representation theorem of the form

$u\in U$6

The paper also proves a polynomial-size integer-coordinate realization. Its role in the present topic is cautionary as well as substantive: the construction uses circular arcs internally, but it establishes no circle-based target class and no ray-circle equivalence theorem (Cabello et al., 2011).

5. Analytic ray-circle contact and complementarity-style feasibility

In computational geometry, ray-circle complementarity can also denote the feasibility structure of ray-circle contact equations. A circle centered at $u\in U$7 with radius $u\in U$8 has implicit equation

$u\in U$9

With homogeneous coordinates $c_v$00, this can be written as

$c_v$01

where

$c_v$02

This is the two-dimensional specialization of the quadric formalism used for line- and ray-quadric intersection (Skala, 2022).

Let a ray be parameterized by

$c_v$03

with $c_v$04 and $c_v$05. Writing $c_v$06, substitution into the circle equation yields

$c_v$07

Hence

$c_v$08

and the quadratic becomes

$c_v$09

The roots are

$c_v$10

The line-intersection test is governed by the discriminant: $c_v$11 means no real intersection, $c_v$12 tangency, and $c_v$13 two real intersections. For a ray, one must additionally require at least one feasible parameter $c_v$14 (Skala, 2022).

This gives a complementarity-style interpretation of contact. A boundary hit asks for $c_v$15 such that

$c_v$16

Tangency is the doubly active case

$c_v$17

which coincides with the repeated-root condition $c_v$18 (Skala, 2022). The cited paper itself does not explicitly use complementarity notation; rather, it reorganizes the classical quadratic test into a matrix form that separates line-dependent and quadric-dependent quantities: $c_v$19 This separation is emphasized as convenient for SSE instructions and GPU implementation when many rays are tested against many quadrics (Skala, 2022).

6. Asymmetries, limitations, and applications

The literature does not support a single, uniform doctrine of ray-circle complementarity. The containment theorem for circle graphs is one-way; the complement equivalence with circular-arc graphs holds only for the specific class of two-directional orthogonal ray graphs; and the computational-geometry formulation concerns algebraic feasibility rather than graph representation (Kerkhof et al., 2021, Takaoka, 2024, Skala, 2022).

An especially sharp asymmetry appears in symplectic geometry. A noncompact symplectic manifold that admits a properly embedded ray with a wide neighborhood is symplectomorphic to the complement of that ray. In Euclidean space, if $c_v$20 is the standard ray and $c_v$21, then $c_v$22 is symplectomorphic to $c_v$23, with the symplectomorphism localized near the ray (Tang, 2018). The cited paper explicitly does not prove an analogous statement for circles or other closed codimension-two submanifolds. It emphasizes features specific to rays: properness, noncompactness, an end at infinity, and the possibility of opening a half-line or slit in the momentum-map image (Tang, 2018). A plausible implication is that “complementarity” between rays and circles is fundamentally asymmetric outside graph representation theory.

The applications are correspondingly diverse. The circle-to-ray embedding theorem is used to show that the global curve simplification problem for the directed Hausdorff distance is NP-hard (Kerkhof et al., 2021). The complement-of-even-subdivision theorem for planar graphs is used to prove that finding a maximum clique in a ray intersection graph is NP-hard, even when a geometric ray representation is part of the input (Cabello et al., 2011). In the later reduction of (Kerkhof et al., 2021), the authors also use the complement of a ray in a purely geometric sense: the opposite half-line on the same supporting line with the same origin. That notion is distinct from graph complementation and distinct again from the complement of a subset in a manifold (Kerkhof et al., 2021).

Taken together, these results show that the phrase “ray-circle complementarity” is most precise when disambiguated into three separate regimes. In geometric graph theory, it refers either to constructive translation from chord diagrams to grounded ray systems or to graph complementation between orthogonal ray graphs and clique-cover-two circular-arc graphs. In computational geometry, it refers to feasibility structure for ray-circle contact equations. Outside those settings, and especially in symplectic geometry, the available theorems are explicitly one-sided in favor of rays rather than circles (Kerkhof et al., 2021, Takaoka, 2024, Skala, 2022, Tang, 2018).