Chain of overlapping rectangles

Cancelado Publicado Sep 4, 2012 Pagado a la entrega
Cancelado Pagado a la entrega

I have a list of rectangles. I need to find a list of lists in which all the overlapping rectangles are returned. For example, in a list of 7 rectangles, if 4 rectangles are overlapped and rest are separate then a list of lists should look like this:

[0]: r1, r2, r3, r4

[1]: r5

[2]: r6

[3]: r7

Again, it will create a chain. For example, if r1, and r2 are hitting and r2 and r3 are hitting and r1 and r4 are hitting then it will give the list[0].

Please concentrate again, it is only returning the grouped list of list and the returned list's count is not equal to the supplied list count.

I will only except elegant solution. That is, you should not use arrays to store intersection values. And it should be done with recursion.

It should be done in C#.

Thanks

Programación en C# Consolas de juegos Diseño de juegos Instalación de scripts Shell Script Arquitectura de software Windows Desktop

Nº del proyecto: #2773869

Sobre el proyecto

9 propuestas Proyecto remoto Activo Sep 6, 2012

9 freelancers están ofertando un promedio de $57 por este trabajo

vano101

See private message.

$12.95 USD en 1 día
(507 comentarios)
6.6
schungur

See private message.

$100.3 USD en 1 día
(12 comentarios)
4.1
mfran

See private message.

$100.3 USD en 1 día
(3 comentarios)
4.0
aravindsr

See private message.

$100.3 USD en 1 día
(5 comentarios)
3.5
XaCaHaa

See private message.

$30.6 USD en 1 día
(13 comentarios)
2.7
sergevalsse

See private message.

$20.4 USD en 1 día
(2 comentarios)
2.3
mutichip

See private message.

$42.5 USD en 1 día
(0 comentarios)
0.0
kjalowiecki

See private message.

$10 USD en 1 día
(0 comentarios)
0.0
yeste

See private message.

$100 USD en 1 día
(1 comentario)
0.0