Re: Algorithm to fit rectangles with different areas inside a matrix with lowest complexity
- From: "jacko" <jackokring@xxxxxxxxx>
- Date: 11 Jul 2006 15:44:23 -0700
place all objects in a place where they are smallest. then jiggle for
smallest overlap
if collision of location occurs, relocate object with smallest growth
impact to second size. then jiggle
in this way all objects go through go through scaling.
jiggleing is best don through genetic algorithms a la PCB optimization.
cheers
.
- Follow-Ups:
- References:
- Prev by Date: Re: Algorithm to fit rectangles with different areas inside a matrix with lowest complexity
- Next by Date: lists/unions/intersections:
- Previous by thread: Re: Algorithm to fit rectangles with different areas inside a matrix with lowest complexity
- Next by thread: Re: Algorithm to fit rectangles with different areas inside a matrix with lowest complexity
- Index(es):