Finite conforming meshes on adaptive open-complex tiles #
An adaptive tile is a closed face of an iterated midpoint subdivision, transported to the
original intrinsic realization. Its faithful subdivision chart followed by
facePlaneHomeomorph identifies it with the standard plane triangle. We mark every vertex of
every touching adaptive tile on its boundary, refine the standard boundary graph at those
marks, and cone that graph to an interior point. This file packages the resulting honest finite
plane complex for one tile. The next layer proves that the transported tile complexes agree on
overlaps and takes their locally finite union.
A transported adaptive tile, as a closed subspace of the original realization.
Equations
- K.AdaptiveClosedFace U t = { p : K.realization // p ∈ K.adaptiveFaceCarrier U t }
Instances For
Remove the faithful subdivision transport from one adaptive tile.
Equations
- One or more equations did not get rendered due to their size.
Instances For
The canonical standard-plane chart of an adaptive tile.
Equations
- K.adaptiveFacePlaneHomeomorph U t = (K.adaptiveFaceSourceHomeomorph U t).trans ((K.safeSubdivision t.fst).refined.facePlaneHomeomorph ↑t.snd)
Instances For
A point on an adaptive edge pulls back to the corresponding edge of the refined face.
The finite type of resolved boundary points of one adaptive tile.
Equations
- K.AdaptiveBoundaryVertex U hU t = ↥(K.boundaryVertices U hU t)
Instances For
A resolved boundary point in the standard plane chart of its adaptive tile.
Equations
- K.adaptiveBoundaryPlanePoint U hU t p = ↑((K.adaptiveFacePlaneHomeomorph U t) ⟨↑p, ⋯⟩)
Instances For
Every resolved boundary mark lies in the standard triangle's one-skeleton.
The standard boundary graph refined at every touching-tile vertex.
Equations
Instances For
Remove any arrangement vertices not used by the refined boundary graph.
Equations
- K.adaptiveBoundaryGraph U hU t = (K.adaptiveBoundarySubdivision U hU t).used
Instances For
Exact support on the polygonal frontier rules out isolated used vertices: every boundary vertex belongs to a two-vertex face.
Every simplex of the boundary graph is contained in an edge.
A fixed interior point of the standard triangle, used as every tile's cone vertex.
Equations
- One or more equations did not get rendered due to their size.
Instances For
The finite cone triangulation of one adaptive tile in standard plane coordinates.
Equations
- One or more equations did not get rendered due to their size.
Instances For
Coning a pure boundary graph produces a pure two-dimensional tile complex.
Identify a tile cone's support with the corresponding adaptive closed face.
Equations
- K.adaptiveTileSupportHomeomorph U hU t = (Homeomorph.setCongr ⋯).trans (K.adaptiveFacePlaneHomeomorph U t).symm
Instances For
Embed a tile cone support into the open subspace.
Equations
- K.adaptiveTileSupportEmbed U hU t p = ⟨↑((K.adaptiveTileSupportHomeomorph U hU t) p), ⋯⟩