Math Algorithm QS

  • Thread starter Thread starter Tamir Khason
  • Start date Start date
T

Tamir Khason

I know that this group not exactly the place to ask this question, but
anyway:
I have Array of Rectangles, grouped in number of groups (see right:
http://www.dotnet.us/imgs/vmf.jpg ) I need to make Point[][] of all groups
(their edge point coordinates) in this certain example I'll recieve
Point[4][12] array of 4 groups with max 12 points each one (the biggest
number of points ever)
The number of rectangles and number of groups vary and it might be "holes"
inside each group.

TNX
 
Hi Tamir,

I'm not quite sure what you need to do. Could you explain it in a more
detailed way? Thanks!

Kevin Yu
=======
"This posting is provided "AS IS" with no warranties, and confers no
rights."
 
You must log in or register to reply here.

Ask a Question

Want to reply to this thread or ask your own question?

You'll need to choose a username for the site, which only take a couple of moments. After that, you can post your question and our members will help you out.

Ask a Question

Similar Threads

request help on enumeration/numbering algorithm 6
Lookup algorithm 3
not sure if there is an easy way to do this! 25
Drawing smaller than 1 pixel (how do people fool the eye?) & infinitegrids 6
ArrayList ToArray() throwing exception (concatenate double[]) 3
Conditional Formatting from a group 6
Indexing of IntPtr 10
Globarlly use var (from linq) or anything equivalent ? 8

Back
Top