Jump to content

  • Log In with Google      Sign In   
  • Create Account


Triangulation with maximum triangle size


Old topic!
Guest, the last post of this topic is over 60 days old and at this point you may not reply in this topic. If you wish to continue this conversation start a new topic.

  • You cannot reply to this topic
3 replies to this topic

#1 Axiverse   Members   -  Reputation: 343

Like
0Likes
Like

Posted 18 February 2013 - 11:56 AM

Hey, I'm trying to triangulate a country on the surface on the earth. I want to limit the size of the triangles so that when I convert it from 2d points to 3d points they aren't too long/big so that when I overlay it on the surface of the parent sphere it doesn't get clipped under the surface. Is there any way to do this? The shapes are also concave as well.

Attached Thumbnails

  • Screen Shot 2013-02-18 at 2.22.47 AM.png


Sponsor:

#2 Jason Z   Crossbones+   -  Reputation: 4683

Like
1Likes
Like

Posted 18 February 2013 - 05:20 PM

Are you triangulating the surface covered by the country, or only the outline?  Really in either case you can simply tessellate the object using whatever scheme you want, and then just iterate over the list of triangles and split it up until you go below a particular size metric.  For example, any edge that is longer then epsilon would get split, forming two triangles out of one.  This can be done recursively until all the triangles meet your criteria...



#3 LorenzoGatti   Crossbones+   -  Reputation: 2511

Like
0Likes
Like

Posted 19 February 2013 - 02:56 AM

Assuming the "triangle size" you want to limit is actually edge length, you can immediately split any long edge into enough equal pieces to respect the limit, introducing new vertices along the original edge; after splitting the given boundary edges you can split long edges as soon as triangulation creates them. If you triangulate by ear clipping, triangles can turn into fans of 2 triangles; other approaches might create longer edges with more splits.


Produci, consuma, crepa

#4 Vexal   Members   -  Reputation: 416

Like
0Likes
Like

Posted 20 February 2013 - 07:09 PM

http://en.wikipedia.org/wiki/Delaunay_triangulation

A triangulation which attempts to give you the best quality triangles by enforcing a rule that a circle drawn through the vertices of a triangle cannot contain the vertices of any other triangle.






Old topic!
Guest, the last post of this topic is over 60 days old and at this point you may not reply in this topic. If you wish to continue this conversation start a new topic.



PARTNERS