Hi, I've been working on a project on and off for a few months now regarding garment patterns.
Well, my client has been using these CAD software where they would create a pattern which would be used to cut fabrics to create a garment. Well, one of the features of this software is to optimized the number of sizes of patterns that can be cut from a certain fabric. So the process is: 1. User draws a pattern for each of the parts of a garment by sizes. So if the sizes are S, M and L, there will be 3 patterns for the left sleeve of a polo shirt. 2. They will then leave the software running overnight so that it will come up with the best ratio and position of the patterns for a certain length and width of a fabric. 3. Print this pattern out and cut the fabric with it. I oversimplified it but I was thinking of maybe doing something similar using J. Well, I actually thinking of using J to compute for intersections between the patterns. The layout is 2D and the objects aren't squares. What I do have for data are the vectors of each points of the patterns and since its 2D, I just need to know if the patterns intersect and keep moving the patterns apart until there's no intersections. Well, since I am a total n00b ... can anybody suggest reading materials, related topics and theories (ex. Sweep Line Algorithm), ideas, concepts that I should look into? I would appreciate any help/pointers. Thanks. r/Alex ---------------------------------------------------------------------- For information about J forums see http://www.jsoftware.com/forums.htm
