|
|
This might actually be approximated in the following manner:
Given a sphere (A) and a cube(B) in CSG, normalise them at <0,0,0>.and
construct a mesh equivilent for each. Create an alogrithm that, for each
vertice in A, finds an equivelant vertice (or set of vertices) in B and
builds a new mesh using these results. If I am visualing this properly,
this might give the effect of a 'rounded cube' for this example.
--
Alan Walkington
Technical Staff
United Defense, San Jose
"Achill" <ach### [at] matumde> wrote in message
news:web.3ea6ac9f97d4f590e54f3efb0@news.povray.org...
> Is there a (CSG-like?) possibility to create the vector sum of objects or
at
> least of simple solids?
>
> Thanks for your help.
>
> Achill
>
>
Post a reply to this message
|
|