An algorithm for point clustering and grid generation

A special-purpose point clustering algorithm is described, and its application to automatic grid generation, a technique used to solve partial differential equations, is considered. Extensions of techniques common in computer vision and pattern recognition literature are used to partition points into a set of enclosing rectangles. Examples from 2-D calculations are shown, but the algorithm generalizes readily to three dimensions.<
>