Jump to content
  • Advertisement

Ravana

Member
  • Content Count

    8
  • Joined

  • Last visited

Community Reputation

101 Neutral

About Ravana

  • Rank
    Newbie
  1. Yes. If the containing primitive is concave, the things are not the same. Thanks for the reply.
  2. even for concave objects this works, isnt it? basically if all the vertices are inside, you can not have a segment which goes from one vertice to the other making the object concave be outside sphere as the segments are linear.
  3. Hi All,   Say I want to check if some linear geom object (segment, tetrahedron,.. ) is fully inscribed by the sphere.    I am thinking of testing if all the vertices of the linear object lies inside sphere and if so the object itself  is inside the sphere.    Is there a possibility that this test fails for linear objects?   Also, is there a fast algorithm to do this.    Thank you.   Ravana
  4. Ravana

    AABB Tree dEMO

    thnks alot. that will be sufficient. :)
  5. Ravana

    AABB Tree dEMO

    This group sucks in big time. no reply and moderator did not allow me to cross post. 
  6. Ravana

    AABB Tree dEMO

    Hello Guys,   I am working on a Axis Align Bounding Box project. This works in both 2D and 3D.    I want to do a cool demo for the 2D package.    Basically I want to demonstrate the AABB tree for distance and intersection queries, not the performance.    I want something cool but not complex. :)   For an example something like,   user can open a file with geometric segments of a large quantity. and he can query with  rays for intersection. then in the demonstration I show the intersected  segments from the original primitives.   This is not cool. So, could anybody tell me something simple and cooL.   Really appreciate your ideas.   Cheers, Ravana+
  7. Hello Guys,   I am working on a Axis Align Bounding Box project. This works in both 2D and 3D.    I want to do a cool demo for the 2D package.    Basically I want to demonstrate the AABB tree for distance and intersection queries, not the performance.    I want something cool but not complex. :)   For an example something like,   user can open a file with geometric segments of a large quantity. and he can query with  rays for intersection. then in the demonstration I show the intersected  segments from the original primitives.   This is not cool. So, could anybody tell me something simple and cooL.   Really appreciate your ideas.   Cheers, Ravana+
  8. Ravana

    AABB Tree dEMO

    Hello Guys,   I am working on a Axis Align Bounding Box project. This works in both 2D and 3D.    I want to do a cool demo for the 2D package.    Basically I want to demonstrate the AABB tree for distance and intersection queries, not the performance.    I want something cool but not complex. :)   For an example something like,   user can open a file with geometric segments of a large quantity. and he can query with  rays for intersection. then in the demonstration I show the intersected  segments from the original primitives.   This is not cool. So, could anybody tell me something simple and cooL.   Really appreciate your ideas.   Cheers, Ravana+
  • Advertisement
×

Important Information

By using GameDev.net, you agree to our community Guidelines, Terms of Use, and Privacy Policy.

GameDev.net is your game development community. Create an account for your GameDev Portfolio and participate in the largest developer community in the games industry.

Sign me up!