Jump to content

DeWall's DT D & C algorithm, require some assitance with

AllAmericanBadAzz
in Computer Science

Featured Replies

I am implementing DeWall's DT algorithm. I am having a tough time determining just how some of the methods are supposed to go.

 

My first question: how would I represent a d-simplex in my code? I am using a game engine to generate a mesh with this and it requires a set of vertices and then a set of triangle mappings to those vertices to create the polygons. Is the d-simplex different from a poly/face?

 

Ive been reading this paper to figure it out: http://vcg.isti.cnr.it/publications/papers/dewall.pdf

So my questions are:

How are Extract(), MakeFirstSimplex(), MakeSimplex() supposed to work? A general (and specific) description of the methods would be fantastic!

 

Also how to represent said data. I am using Vectors for my points, int[ ]'s for my triangle mappings, and Lists of either for various uses.

 

Please no code though. I am aiming to do this myself.


 

Edited by AllAmericanBadAzz

Please sign in to comment

You will be able to leave a comment after signing in

Sign In Now
https://www.scienceforums.net/topic/124310-dewalls-dt-d-c-algorithm-require-some-assitance-with/
Go to topic listing

Important Information

We have placed cookies on your device to help make this website better. You can adjust your cookie settings, otherwise we'll assume you're okay to continue.

Configure browser push notifications
Chrome (Android)
  1. Tap the lock icon next to the address bar.
  2. Tap Permissions → Notifications.
  3. Adjust your preference.
Chrome (Desktop)
  1. Click the padlock icon in the address bar.
  2. Select Site settings.
  3. Find Notifications and adjust your preference.