# Re: Algorithm to fit rectangles with different areas inside a matrix with lowest complexity

*From*: iatsonios@xxxxxxxxx*Date*: 13 Jul 2006 02:37:02 -0700

it might be not pretty obvious ,but you have to minimize not the total

area of an object,but it's perimeter.in case you don't believe me(even

for me it was not convincing) you have to search about database data

structures such as R+ trees,because the problem that you try to solve

is nearly associated with these structures(some of them are quite

useful for GIS application).

I will send a reply that i am going to have reference for this,or a

mini sketch of the proof.

cheers

Yannis

.

**References**:**Algorithm to fit rectangles with different areas inside a matrix with lowest complexity***From:*danicamps81

**Re: Algorithm to fit rectangles with different areas inside a matrix with lowest complexity***From:*jacko

**Re: Algorithm to fit rectangles with different areas inside a matrix with lowest complexity***From:*Dani Camps

- Prev by Date:
**Re: solving #SAT in poly(number of vars) and exp(number of clauses)?** - Next by Date:
**Re: Mapping rationals to binary strings while preserving order** - Previous by thread:
**Re: Algorithm to fit rectangles with different areas inside a matrix with lowest complexity** - Next by thread:
**solving #SAT in poly(number of vars) and exp(number of clauses)?** - Index(es):