Region Boundaries on a Triangular Grid
Charles T. Zahn, USDOE Office of Science (SC), US Atomic Energy Commission (AEC) · 1972
A simple graph model is developed for binary digibl pictures on &triangular grid leading to consistent and intuitive definitions of connectivity and region boundaries as well as fast memory-efficient algorithms for computing boundaries and the "insidedness" tree.Boundary encodings are extremely compact and can be smoothed using a discrete implementation of minimumperimeter polygon methods.Attempts to generalize the model to nontriangular grids explain the well-known "anomaly" associated with connectivity on the square grid.