#### Archived

This topic is now archived and is closed to further replies.

# Polygon Problem

This topic is 5522 days old which is more than the 365 day threshold we allow for new replies. Please post a new topic.

## Recommended Posts

Assume that i got a face with x vertices, how do i know how to store the vertices to create enough polygons(tris) to cover the whole face, but not creating to unwanted polygons Are there any good techniques or theory for that!

##### Share on other sites
if the polygons are planar... then its very straightforward. You can use the Fortune (line sweep) method, for delaunay triangulation, to make a convex hull, which in this case will contain only those triangles you need. If they are not planar, you use the generalisation, called plane sweep. This will make a convex hull of the figure (triangulation). An intellegent combination of these methods can be used to generate what you are looking for. Remember that if the points are not planar, they don''t make a unique figure. This method will make a tringulation that is the outer surface of a concave figure. In general it is unwise to render non planar polygons, due to this ambiguity.

1. 1
2. 2
Rutin
19
3. 3
khawk
18
4. 4
A4L
14
5. 5

• 12
• 16
• 26
• 10
• 44
• ### Forum Statistics

• Total Topics
633767
• Total Posts
3013737
×