Few methods exist for visualizing scientific data on irregular grids. An important reason is the lack of an efficient method of point location on such grids. An algorithm is presented to address this problem. On d -dimensional grids of n irregularly shaped voxels, empirical studies have shown ∝ dn log n preprocessing time, ∝ dn preprocessing storage, ∝ log n query time and ∝ n storage space. An example is followed through several steps to demonstrate the algorithm; other examples are tested. Applications of the algorithm to visualization are also discussed.
/lp/association-for-computing-machinery/a-decomposition-algorithm-for-visualizing-irregular-grids-m19CPsEkeN