Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Posting-Version: version B 2.10.2 9/18/84; site ucsfcgl.UUCP
Path: utzoo!watmath!clyde!burl!ulysses!bellcore!decvax!ittatc!dcdwest!sdcsvax!ucbvax!ucsfcgl!conrad
From: conrad@ucsfcgl.UUCP (Conrad Huang%CGL)
Newsgroups: net.graphics,net.math
Subject: Polygonal Surface Approximation
Message-ID: <776@ucsfcgl.UUCP>
Date: Tue, 18-Feb-86 21:11:54 EST
Article-I.D.: ucsfcgl.776
Posted: Tue Feb 18 21:11:54 1986
Date-Received: Fri, 21-Feb-86 04:35:55 EST
Reply-To: conrad@ucsf-cgl.ARPA
Organization: UCSF Computer Graphics Lab
Lines: 11
Xref: watmath net.graphics:1468 net.math:2864

We are looking for an algorithm to divide a set of points into control
points for bicubic patches.  We'd like to use bicubic patches to
approximate the minimal surface enclosing a set of intersecting spheres.
We can generate the points on the sphere and make sure that they do not
lie inside any other sphere, but we haven't found a way to divide the
points into control points for patches.  Has anyone seen this problem
before or have any pointers as to how to proceed?  As usual, thanks in
advance,

					Conrad Huang
					conrad@ucsf-cgl.arpa