RAC drawing¶
Represent a graph geometrically so every permitted edge crossing is a two-edge intersection at a right angle, under explicit straight-line or bounded-bend conventions.
Core Idea¶
A right-angle-crossing, or RAC, drawing represents graph vertices as distinct points and edges as straight segments or polylines such that every edge intersection allowed by the model occurs between exactly two edges at ninety degrees. The drawing convention must say whether bends are permitted, how many bends each edge may have, whether adjacent edges may cross, and whether multiple edges may meet at one interior point. A graph is RAC-drawable in a chosen model if at least one drawing satisfying those conditions exists.
Scope of Application¶
The abstraction is literal wherever practitioners can identify the same constitutive roles, apply the same boundary tests, and obtain the same kind of output. The following habitats are uses of RAC drawing itself, not metaphors based only on resemblance.
- Graph visualization. Choosing layouts that make unavoidable crossings geometrically distinct.
- Extremal graph theory. Bounding edge density in straight-line and bounded-bend RAC classes.
- Recognition complexity. Deciding whether a graph admits a drawing under a fixed RAC variant.
- Complete graph families. Characterizing which complete or complete bipartite graphs admit straight-line RAC layouts.
- Hybrid planarity. Comparing RAC with one-planar, fan-planar, and angle-crossing graph classes.
- Layout construction. Producing coordinates and bends while controlling area and angular resolution.
Clarity¶
A clear account of RAC drawing must preserve the recognition invariant stated in the Core Idea rather than rely on the title alone. State the edge model, bend bound, crossing multiplicity, and treatment of adjacent edges. Distinguish a supplied RAC drawing from proof that an abstract graph is RAC-drawable. Measure the angle at each actual crossing rather than inferring it from screen appearance. Keep readability evidence separate from combinatorial membership and report other layout criteria.
Manages Complexity¶
RAC drawing manages complexity by replacing a diffuse field of observations or possible operations with a bounded role structure: abstract graph supplies vertices and incidence relations supply the object to be represented.; vertex placement supplies distinct points in the plane realize graph vertices.; edge geometry supplies straight segments or declared-bend polylines connect incident vertex points.; crossing event supplies an interior intersection involves the permitted number and types of edges.; right-angle constraint supplies the directions of the two crossing edges are perpendicular at the intersection..
Abstract Reasoning¶
- Fix the RAC variant and legal crossing conventions. 2. Map every vertex to a distinct point and every edge to a permitted geometric route. 3. Enumerate all interior intersections and reject overlaps or forbidden multi-edge crossings. 4. Compute direction vectors at each crossing and verify a zero dot product. 5. Check bend count, edge incidence, and degeneracy constraints globally. 6. Use density or family obstructions only under the same variant assumptions.
Knowledge Transfer¶
The strict upward abstraction is Representation. RAC Drawing instantiates Representation because it maps an abstract graph into a spatial visual form that preserves incidence while adding a strict crossing-angle convention. Within right angle crossing graph drawing, the full mechanism transfers literally when the same roles and boundary tests recur. Beyond that domain, only the parent-level skeleton should travel. Reusing the label RAC drawing after removing its constitutive vocabulary would hide a change of mechanism behind an analogy. The honest transfer rule is therefore two-stage: recognize the domain-specific pattern first, then lift only the parent relation that remains invariant under a substrate change.
Relationships to Other Abstractions¶
Current abstraction RAC drawing Domain-specific
Parents (1) — more general patterns this builds on
-
RAC drawing is a kind of Representation Prime
RAC Drawing instantiates Representation because it maps an abstract graph into a spatial visual form that preserves incidence while adding a strict crossing-angle convention.
Hierarchy path (1) — routes to 1 parentless root
- RAC drawing → Representation → Abstraction
Neighborhood in Abstraction Space¶
RAC drawing sits in a sparse region of the domain-specific corpus (80th percentile for distinctiveness): few abstractions share its structure, so a faithful description tends to retrieve it precisely.
Family — Graph Coloring Games & Drawings (7 abstractions)
Nearest neighbors
- Crossing number (graph theory) — 0.83
- Intersection graph — 0.82
- Vertex enumeration problem — 0.82
- Map graph — 0.82
- Pathwidth — 0.81
Computed from structural-signature embeddings · 2026-09-08