Arbitrary 3D contour convex partitioning heuristic

Hi all

before
Some time ago I’ve developed an automatic quad fill routine to tessellate an arbitrary 3D contour into quads, as even as possible. That algorithm is quite good indeed but suboptimal for L-shapes, T-shapes and in general for complex concave contours.
So these days I’m quite busy trying to figure out an algorithm for spatial splitting the contour. After squeezing my brain finally found a very nice heuristic to split the contour at corner feature points. I’m exited because is very powerful and works in any arbitrary 3D spatial shapes. This algorithm will serve beyond the QuadFill tool and Im figuring out few interesting new geometric tools for it!
Here are some screenshots of the intermediate process with visual debugging.

1
1
2
2

Getting betterGot it

Advertisements
Arbitrary 3D contour convex partitioning heuristic

4 thoughts on “Arbitrary 3D contour convex partitioning heuristic

  1. Great blog here! Also your website quite a bit up
    very fast! What web host are you the usage of?

    Can I get your affiliate hyperlink to your host? I desire my web site
    loaded up as fast as yours lol

    Like

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s