![]() |
|
#1
|
|||
|
|||
Closest Point on 2D Algorithm? Help wanted.Well here it goes, my first thread.
This is the problem I am having. I have written a draw program in MFC .net and now I am trying to find an algorithm that will delete the closest line when the user holds the Alt + Shift keys and clicks in the client drawing area. I have no problem with applying the functionality of the accelerators. Just Need help with an algorithm. I realize that it will only be deleting small line segments for every click and the length of the line segment will depend on how fast the user was moving the mouse. My trig is weak and I am brushing up on it trying to figure this out. I know I will be analyzing 3 points at a time (at least I think so, unless there is a better approch), two points will be the line segment from the container I am holding all the points in and the third point will be the point the user has clicked to request line delete. This were I am stuck. I am drawing triangles all over trying to figure this out. If anybody is strong in trig and could help would be greatly appreciated. Technut P.S. If there is any gaps in my explanation, please ask for detail and I will provide. |
|||
Recent GIDBlog
Once again, no time for hobbies by crystalattice
| Thread Tools | Search this Thread |
| Rate This Thread | |
|
|
Similar Threads
|
||||
| Thread | Thread Starter | Forum | Replies | Last Post |
| help.... SLR * algorithm | tay | C Programming Language | 4 | 10-Sep-2004 12:48 |
| CD burner wont burn!! | robertli55 | Computer Hardware Forum | 1 | 18-Jun-2004 11:53 |
| Yet another CD burner problem: Lite-On LSC-24082K | Erwin | Computer Hardware Forum | 1 | 22-May-2004 12:28 |
Network Sites: GIDNetwork · GIDWebHosts · GIDSearch · Learning Journal by J de Silva, The