Part of the Khronos Group
OpenGL.org

The Industry's Foundation for High Performance Graphics

from games to virtual reality, mobile phones to supercomputers

Results 1 to 4 of 4

Thread: Vertex Question

  1. #1
    Junior Member Newbie
    Join Date
    Feb 2004
    Posts
    2

    Vertex Question

    Hi there,

    I have a series of vertices that aren't ordered, is there an algorithm that will sort them into a list, calculating which vertices should connected, allowing me to create a surface.

    Thanks Rohan

  2. #2
    Intern Contributor
    Join Date
    Sep 2003
    Location
    Jersey, Channel Islands
    Posts
    68

    Re: Vertex Question

    That should be part of model definition. If you try to do the same thing by hand (in 2-d, for the shake of argument), you end up with multiple possible solutions, all of them valid. How would you know which one to choose?

    You need some extra bit of information there, just the vertices won't do. For instance, if you know the surface you're after, that helps. Or may be a set of rules that the surface should satisfy.

    Potentially, this could be a minimization problem as well.

    So there, a vague answer to a vague question

    mad

  3. #3
    Intern Contributor
    Join Date
    Feb 2004
    Posts
    98

    Re: Vertex Question

    The algorthm is called Convex Hull, try a Computational Geometry website or book.

  4. #4
    Junior Member Newbie
    Join Date
    Feb 2004
    Posts
    2

    Re: Vertex Question

    Thanks guys, i have found some good tutorials about Convex Hull.

Posting Permissions

  • You may not post new threads
  • You may not post replies
  • You may not post attachments
  • You may not edit your posts
  •