Path: utzoo!utgpu!news-server.csri.toronto.edu!cs.utexas.edu!sdd.hp.com!hplabs!hpfcso!hpfcdq!olsen
From: olsen@hpfcdq.HP.COM (John Olsen)
Newsgroups: comp.misc
Subject: Re: The Dice face problem
Message-ID: <470001@hpfcdq.HP.COM>
Date: 22 Aug 90 16:34:40 GMT
References: <1682@blackbird.afit.af.mil>
Organization: Hewlett-Packard - Fort Collins, CO
Lines: 19

efrethei@blackbird.afit.af.mil (Erik J. Fretheim) writes:

>   Given a discrete two dimensional array of points (l by m) and a set
>   of n objects, place the objects uniformly distributed on the array
>   in such a manner that the distance from any given point on the array 
>   to any one of the objects is minimized.  This is similar to deciding
>   where the dots on a die should be placed, but they must be put in 
>   descrete locations and the sides of the die may not be equilateral.

If you remove the square grid and specify a desired distance between
points, then it looks like it would degrade to a hexagonal grid for the 
larger numbers.

Could your result be obtained by maximizing the distance between each point
and it's neighbors as well as between the point and the edge?

John M. Olsen, Graphics Technology Division  (303)229-6746
olsen@hpfcjo.HP.COM, olsen@hpfcdq.HP.COM
Hewlett-Packard, Mail Stop 73, 3404 E. Harmony Road, Ft Collins, CO 80525