Beefy Boxes and Bandwidth Generously Provided by pair Networks
Clear questions and runnable code
get the best and fastest answer
 
PerlMonks  

Re: Efficient Assignment of Many People To Many Locations?

by Roy Johnson (Monsignor)
on Feb 25, 2005 at 13:39 UTC ( [id://434458]=note: print w/replies, xml ) Need Help??


in reply to Efficient Assignment of Many People To Many Locations?

Partitioning: divide the reps in half based on (say) east-west location; divide the cities similarly. Continue subdividing the rep and city cells, keeping the same number of reps and cities in corresponding cells, until you have one rep corresponding to one city. Each division should cut across the longer dimension of the cell (or the dimension which has the greatest range of either cities or reps, but corresponding cells should be divided in the same direction).

This is based on Heckbert's "median cut" color quantization method.


Caution: Contents may have been coded under pressure.
  • Comment on Re: Efficient Assignment of Many People To Many Locations?

Log In?
Username:
Password:

What's my password?
Create A New User
Domain Nodelet?
Node Status?
node history
Node Type: note [id://434458]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this?Last hourOther CB clients
Other Users?
Others taking refuge in the Monastery: (7)
As of 2024-04-18 02:59 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    No recent polls found