Xref: utzoo comp.ai:7435 comp.misc:9886
Path: utzoo!utgpu!news-server.csri.toronto.edu!mailrus!wuarchive!usc!cs.utexas.edu!helios!wfsc4!hmueller
From: hmueller@wfsc4.tamu.edu (Hal Mueller)
Newsgroups: comp.ai,comp.misc
Subject: Re: The Dice face problem
Message-ID: <7580@helios.TAMU.EDU>
Date: 21 Aug 90 15:03:07 GMT
References: <1682@blackbird.afit.af.mil>
Sender: usenet@helios.TAMU.EDU
Followup-To: comp.misc
Distribution: usa
Organization: Dept. of Wildlife and Fisheries Sciences, Texas A&M University
Lines: 14

If you consider the points as vertices in a graph, and define the
graph such that there exists an edge from your desired center
to every other vertex, then the spring embedding of that graph
may be what you want.  Spring embedding models the graph as
like-charged points connected by springs.

Some code for computing this is contained in Steve Skiena's
"Combinatorica" extensions for Mathematica.

--
Hal Mueller            hmueller@cssun.tamu.edu          n270ca@tamunix (Bitnet)
Graduate Student, Department of Computer Science
Research Assistant, Department of Wildlife and Fisheries Sciences
Texas A&M University, College Station, TX 77843