ajb@grebyn.com (Alan J. Broder) (12/21/90)
Some time ago, within the last 3-4 years, there was an interesting article in Byte Magazine. I believe the article was about relaxation techniques for solving problems with multiple constraints. As the primary example, the article discussed the case of automatic map layout; i.e. say you have a list of distances between pairs of some cities. Then the algorithm given in the article was able to determine the relative placement of the cities on the map, using those distance constraints alone. My problem is that I can't find the issue of Byte that had this article. Does anyone remember this article, or can you point me to a good source of information on this topic ? Thanks Alan Broder ajb@grebyn.com