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 3 of 3

Thread: Find an edge shared by two specific triangles

  1. #1
    Intern Contributor
    Join Date
    Mar 2000
    Location
    England
    Posts
    57

    Find an edge shared by two specific triangles

    Hi...

    How could I flag visible or not an edge shared by two specific triangles?

    Does it depends on the structure of my objects...

    I have a simple structure: object[3][x]

    Many thanks

  2. #2
    Member Regular Contributor
    Join Date
    Feb 2000
    Location
    milano, italy
    Posts
    288

    Re: Find an edge shared by two specific triangles

    autoedgeing... there is something about into foley/van dam computer graphics PnP.

    basically you have to make a edge list, each node should have references to the faces it uses.
    make a cycle and check the dot product between the two normals of the faces: if it is > than a threshold value, make it visible or invisible.

    Dolo/\/\ightY
    Dolo/\/\ightY

  3. #3
    Intern Contributor
    Join Date
    Mar 2000
    Location
    England
    Posts
    57

    Re: Find an edge shared by two specific triangles

    Thanks for the answer...

    How do I do an edge list?

    Many thanks

Posting Permissions

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