An algorithm to generate Thiessen diagrams for a set of n points defined in the plane is presented. First, existing proximal polygon computation procedures are reviewed and t e r n are defined. The algorithm developed here uses a rectangular window within which the Thiessen diagram is de5ned. The computation of Thiessen polygons uses an iterative walking process whereby the processing stmi?s at the Iower lejl corner of the diagram and proceeds toward the right top c m r . The use of a sorted point sequence and dynamical core allocation provide for e f i e n t processing. The presentation is concluded b y the discussion of an impbmentutim of the algorithm in a FORTRAN program.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.