bnr@ecsvax.uncecs.edu (Tim Dempsey) (06/21/88)
I am posting this for someone else who came to me with this question. "I'm currently working on a generic interface application for the Mac which will later be upgraded to the MacII environment. I'm searching for an efficient dynamic storage algorithm for objects (regions) which contain area. The data structure should be ordered based on the location of its objects to facilitate a search of the structure given the curso structure given the cursor location at time of MouseDown. An O(n) algorithm of polling already exists, but the graph which is represented may contain as many as 500 nodes plus an even greater number of edges. any ideas are welcome, including those which require much memory, since the application will eventually be on the MacII. Also, any ideas concerning storage of a partial mapping of the graph (that area of the graph window which is currently visible would also be of interest. thanks for any possible ideas and/or references.