Path: utzoo!utgpu!jarvis.csri.toronto.edu!clyde.concordia.ca!uunet!mcsun!sunic!draken!d88-jwa From: d88-jwa@nada.kth.se (Jon Watte) Newsgroups: comp.sys.mac.programmer Subject: Re: Line selection algorithims.. Message-ID: <2597@draken.nada.kth.se> Date: 20 Dec 89 15:46:00 GMT References: <8912160053.AA00720@cadman.nyu.edu> <981@biar.UUCP> <1043@maytag.waterloo.edu> <1989Dec18.192617.10627@caen.engin.umich.edu> Reply-To: d88-jwa@nada.kth.se (Jon W{tte) Organization: Royal Institute of Technology, Stockholm, Sweden Lines: 22 >Just because the data structure is large doesn't mean the useage is >"computationally dreadful". It does gobble memory, but to check whether a Do you think one kilobyte is OK for one line ? I am, besides a mac programmer, also a graphic designer. I would have to yurn off all INITS, find a small drawing program and run without MF just to make a business card ! And that's on a 5meg SE/30... The "First check box, then calculate distance" approach is, indeed, the most effective method for this, with the quickdraw method (open an offscreen port with a portRect the size of the "click area", and then draw the objects and check for blackity) a close second. Happy hacking ! h+@nada.kth.se -- -- Stay alert ! - Trust noone ! - Keep your laser handy ! --- h+@nada.kth.se == h+@proxxi.se == Jon Watte longer .sig available on request