![]() | |
| Home Page | Mark Forums Read | Today's Posts | My Replies | Classifieds | Reviews | Photo Gallery | Web Links | Share Files | Advertise With Us | Ad List |
| |||||||
| Coding Post your Coding for opensource projects here. |
| This forum is sponsored by: |
![]() |
| | LinkBack | Thread Tools | Search this Thread | Display Modes |
|
#13
| |||
| |||
| Jack000: thank you for that paper - my previosu algorithm was much simplier (and faster) but could not generate multiple loops - at the end there was only one. New algorithm works better - but calculations take much much longer. Larken: i'm using linked lists (std::list) to store primitives - most operations on chains involve inserting and deleting objects from container and resizing vector takes time. "Chain inside chain" shuold be easy - create a infinite line starting from any node of "suspected chain" (direction of line is unimportant) and count how many times this line croses other chain - assuming that "other" chain is closed and does not intersect with "suspected" chain - when number of intersections is odd - "suspected" is inside "other" Frankly speaking i started this project to give my brain some workout (you need something intersting to think of while coding (ctrl-c ctrl-v mostly) thousandth version of "that creative teaser animation") so i tried without looking at other's. |
|
#14
| |||
| |||
| to tell whether one chain is inside another, you could first detect whether the two intersect - if they do intersect, just return null or w/e, but if they don't intersect, choose one point on either chain and do a point in polygon. (if they don't intersect, either every point is inside or every point is outside) here's an illustration of my offset method: ![]() the butterfly was about 200ms for the offset, which is pretty good for flash/actionscript. There are still some issues - because of the finite resolution of the bitmap, sometimes it leaves "stubbles", but it should be fairly easy to detect. I'm squashing some bugs, but should be ready for a release soon
__________________ ___________________________ www.carveit.ca |
|
#15
| ||||
| ||||
| awesome... Now i understand how the offset is made with the software..thanks for explanation
__________________ http://free3dscans.blogspot.com/ http://my-woodcarving.blogspot.com/ http://my-diysolarwind.blogspot.com/ |
| Sponsored Links |
|
#17
| |||
| |||
| check out the open source forum, the app's been released :] I'm using a feature of flash to generate the bitmap. Admittedly this is a bit of a hack, but I'm not smart enough to do it with voronoi diagrams..
__________________ ___________________________ www.carveit.ca |
![]() |
| Currently Active Users Viewing This Thread: 1 (0 members and 1 guests) | |
| Thread Tools | Search this Thread |
| Display Modes | |
| |
Similar Threads | ||||
| Thread | Thread Starter | Forum | Replies | Last Post |
| Algorithm? | CNCgr | OpenSource Software | 16 | 12-07-2009 05:23 PM |
| Algorithm for G02 / G03 coding | jemmyell | Coding | 19 | 08-06-2009 05:58 PM |
| Archimedean Spiral Algorithm | fooo | Coding | 6 | 10-08-2007 10:28 PM |
| XY positioning algorithm needed | Tracid | PIC Programing / Design | 4 | 11-28-2006 10:26 AM |
| Need Help With Circular Pocketing Algorithm | lerman | G-Code Programing | 9 | 11-20-2006 04:41 PM |