Arbitrarily close intrinsic graph approximation #
The first simultaneous intrinsic graph replacement polygonalizes the abstract one-skeleton but does not, by itself, give arbitrary pointwise control along a large edge. Its conforming plane model turns that replacement into an ordinary finite plane graph. Transferring the original embedding to this model and applying the plane graph approximation theorem gives the required arbitrarily close second replacement.
The original intrinsic embedding, transferred to the conforming plane graph model. Values off the graph support are irrelevant.
Equations
- One or more equations did not get rendered due to their size.
Instances For
Certified output of the intrinsic one-skeleton approximation. planeMap acts on the first
polygonal graph model; composing it with graphReplacementMap is the final intrinsic graph
embedding.
The
planeMapdeclaration.- isPLOnModel : IsPLOn replacementGraphComplex self.planeMap
- injOnModel : Set.InjOn self.planeMap replacementGraphComplex.support
- close (x : K.realization) : x ∈ K.oneSkeleton → dist (self.planeMap (K.graphReplacementMap hcont hinj D C x)) (h x) < ε
- facewisePL (t : K.Face) : IsPLOnSet (facePolygonalCircle t).carrier self.planeMap
Instances For
The final graph map on the intrinsic realization.
Equations
- A.intrinsicMap = A.planeMap ∘ K.graphReplacementMap hcont hinj D C
Instances For
Moise Ch. 6, Thm. 2 for an intrinsic finite one-skeleton: after one auxiliary polygonalization, the graph admits an arbitrarily close PL embedding, simultaneously PL on all three-edge face cycles.