Constructive Solid Geometry

Discuss interdimensional programming, Java applets and so forth.

Constructive Solid Geometry

Postby bo198214 » Fri Feb 23, 2007 9:41 am

Thanks, quickfur, for the link to ADSODA.
I didnt know about that people really deal with this stuff.
(But I always guessed that I could not be the only one ;) )
So then we can just dive into the details.
Basicly I do exactly what is described on that site, but some essential details are unclear to me yet:
Lets start with the subtraction algorithm pictures of that page:
ImageImage
ImageImage
ImageImage
My problem is when I draw the 3 green pieces, then I also have to draw their intersections/adjacency lines. So I developed a model where two (adjacent) faces can be "snapped" to each other and thereby become invisible during painting because they are internal. This would complicate the given algorithm in the following way:
Image
I mean I know that one can solve the problem by adjacency tests, but I wanted to go the "discrete way", i.e. where I only need the actual point coordinates for slicing an edge, but not to determine adjacency. Thats only because my deep mistrust to the exactness of floating point computations ;) But as you see that make things not especially easier.
bo198214
Tetronian
 
Posts: 690
Joined: Tue Dec 06, 2005 11:03 pm
Location: Berlin - Germany

Return to Programming

Who is online

Users browsing this forum: No registered users and 1 guest

cron