Polygonal boundaries of locally finite two-simplexes #
The globally coherent locally finite edge replacement assigns a finite polygonal arc to every abstract edge. For each maximal face this file resolves its three edge complexes in one finite line arrangement and extracts the resulting simple polygonal cycle. Shared abstract edges use literally the same replacement arc, so adjacent face fillings will have identical boundaries.
The selected replacement arc on cyclic edge i of the intrinsic face t.
Equations
Instances For
A one-dimensional face in the private arrangement of one replacement edge, together with the proof that it is subordinate to that edge.
Equations
- One or more equations did not get rendered due to their size.
Instances For
An ordered pair of vertices in a subordinate one-dimensional face, indexed also by the abstract edge to which it belongs.
Equations
- One or more equations did not get rendered due to their size.
Instances For
Segment labels for the common face arrangement. The left summand lists actual graph segments. The right summand inserts the three abstract vertex images explicitly as degenerate segments, making them canonical arrangement vertices.
Equations
- One or more equations did not get rendered due to their size.
Instances For
The faceGraphSegmentLeft declaration.
Equations
- One or more equations did not get rendered due to their size.
Instances For
The faceGraphSegmentRight declaration.
Equations
- One or more equations did not get rendered due to their size.
Instances For
The faceBoundaryLeft declaration.
Equations
- One or more equations did not get rendered due to their size.
Instances For
The faceBoundaryRight declaration.
Equations
- One or more equations did not get rendered due to their size.
Instances For
The union of the three complete replacement-edge carriers around one intrinsic face.
Equations
- One or more equations did not get rendered due to their size.
Instances For
Consecutive replacement edges around one face meet exactly at their shared cyclic vertex.
Every listed family segment lies in the replacement boundary carrier.
Every boundary-carrier point lies on one of the explicitly indexed family segments.
The common auxiliary chain listing every relevant segment around one intrinsic face.
Equations
- One or more equations did not get rendered due to their size.
Instances For
One finite plane complex carrying all three replacement edges face-to-face.
Equations
- One or more equations did not get rendered due to their size.
Instances For
The common face complex has exactly the union of the three replacement edges as support.
The explicit degenerate family piece used to mark abstract corner i.
Equations
Instances For
The canonical common-arrangement vertex at abstract corner i.
Equations
- One or more equations did not get rendered due to their size.
Instances For
Every abstract corner is a zero-face of the common boundary complex.
A family segment on edge i containing the given edge-carrier point, together with its
subordination to that one edge.
The common arrangement has a face subordinate to edge i through every point of that
edge.
The subcomplex of the common face arrangement carried by cyclic edge i.
Equations
- One or more equations did not get rendered due to their size.
Instances For
A loop-free path through cyclic replacement edge i, oriented from corner i to corner
i+1.
Equations
Instances For
The oriented edge path, regarded in the common boundary complex.
Equations
- One or more equations did not get rendered due to their size.
Instances For
Every vertex visited by the oriented path for edge i lies geometrically on that replacement
edge.
The straight geometric path traced by the selected graph path on one replacement edge.
Equations
- One or more equations did not get rendered due to their size.
Instances For
The selected finite graph path covers the entire polygonal replacement edge. The key input is that a connected subpath of an embedded arc containing both endpoints must be the whole arc.
The same edge path, mapped into the common face-boundary complex, still covers the complete replacement edge.
Distinct cyclic corners remain distinct as vertices of the common arrangement.
Every oriented replacement-edge path contains at least one edge.
Consecutive replacement-edge paths share only their common endpoint, which is removed from the tail of the second path.
The first two oriented replacement edges form a simple path from corner i to the second
cyclic successor of i. The unreduced successor expression keeps dependent elaboration cheap.
Equations
- One or more equations did not get rendered due to their size.
Instances For
The tail of the first two boundary edges is disjoint from the tail of the closing edge.
The two-edge boundary path has length at least two.
The three oriented replacement-edge paths, with the final cyclic endpoint identified.
Equations
- One or more equations did not get rendered due to their size.
Instances For
The boundary walk extracted from the common arrangement is a simple graph cycle.
The geometric range of the boundary cycle is the union of its three complete replacement edges.
The simple polygonal circle formed by the three replacement edges around t.
Equations
- One or more equations did not get rendered due to their size.
Instances For
The extracted polygonal circle has exactly the prescribed three-edge replacement boundary.