http://iat.ubalt.edu/summers/math/platsol.htm and http://hyperfun.org/wiki/doku.php?id=frep:main
CSG on implicitly specified surfaces (F(r)=0) and volumes (F(r)>=0). Min(F,G) is a union, max(F,G) is an intersection. 2009/11/1 Tom Hawkins <tomahawk...@gmail.com>: >> Neat! What a cool idea. >>> data Solid = Solid (Vector -> Bool) >> With a type like this, how is it possible to make solids without hard edges? > Now the only way is to create a new primitive. In the future I want > to have blended versions of the set operations to apply fillets or > bevels at the joints. But I'm not sure how to do this yet. _______________________________________________ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe
