Jump to content

  • Log In with Google      Sign In   
  • Create Account

Banner advertising on our site currently available from just $5!


1. Learn about the promo. 2. Sign up for GDNet+. 3. Set up your advert!


help ! Constructive solid geometry!


Old topic!
Guest, the last post of this topic is over 60 days old and at this point you may not reply in this topic. If you wish to continue this conversation start a new topic.

  • You cannot reply to this topic
1 reply to this topic

#1 flutey   Members   -  Reputation: 124

Like
0Likes
Like

Posted 14 May 2005 - 10:23 PM

i am working on making a 3d modeling tool, and i reached the point in whcih i should be able to perform inter-polygonal mesh related operation, basicaly, i should be able to find the intersecti0on, difference and unsion polygonal mesh, between an input of 2 polygonal meshes, i know this is CSG problem, i just wanna find a good resource on how to implement it, or if there is a C++ class or a tutorial about that, any help??

Sponsor:

#2 grhodes_at_work   Moderators   -  Reputation: 1365

Like
0Likes
Like

Posted 15 May 2005 - 07:11 AM

Its not a totally straightforward problem, and can be extremely difficult to implement in a robust way.

One resource is David Eberly's site, which has a document describing constructive planar geometry, the 2D version of CSG. He has an implementation as well, and as I understand it is working on a 3D version.

His site is Geometric Tools

You might be able to glean some good information from docs describing the various BSP compilers for content creation for the various Quake and Unreal engines. The 3D BSP tree can be used to generate Boolean operations on polyhedra.
Graham Rhodes Moderator, Math & Physics forum @ gamedev.net




Old topic!
Guest, the last post of this topic is over 60 days old and at this point you may not reply in this topic. If you wish to continue this conversation start a new topic.



PARTNERS