Given a compact planar set and an open neighborhood , a finite square-grid construction gives a compact polygonal neighborhood inside with finitely many complementary components. Remove thin polygonal corridors disjoint from joining holes that lie in the same component of , and joining holes in its unbounded component to the exterior. Corridors can also include a prescribed point from each of finitely many specified bounded components. There remains a neighborhood whose bounded holes lie in distinct bounded components of , each containing its chosen point. Standard small polygonal rounding gives a finite union of planar surfaces with boundary. The index map from its first integral homology group to one integer per bounded hole is an isomorphism. Triangulate a surrounding disc: a one-cycle bounds a two-chain whose coefficients are constant in each complementary component. Zero hole coefficients give a filling supported inside the neighborhood; the face chain of each hole supplies a dual cycle. The cycles can be sums of boundary curves in different components. This uses finite triangulation, not the general Jordan curve theorem.
Articles by others on the same topic
There are currently no matching articles.