tags:

views:

104

answers:

1
+1  Q: 

What is the simplest algorithm for mesh generation of an arbitrary quadrilateral?

What is the simplest algorithm for decomposing a quadrilateral into an arbitrary number of triangles?

+2  A: 

Probably midpoint triangle subdivision. Cut your quad into two triangles, then use the midpoints of each triangle edge as vertexes for four new triangles.

genpfault  2010-03-22 21:04:54
A very simple and easy to implement tesselation system. Easy to do an arbitrary number of trinagles too. Keep subdividing until you have "n" triangles.
Goz  2010-03-23 19:45:11

related questions

Unsafe C# and pointers for 2d rendering, good or bad?
Pretty graphs and charts in Python
Rss feed for game programmer?
Graphics card memory usage in linux
How do I position one image on top of another in HTML?
Design crowd sourcing
How can I draw a curve that varies in thickness along its path?
How to find a normal vector pointing directly from virtual world to screen in Java3D?
Where can I get free Vista style developer graphics?
How to convert .ICO to .PNG?
What Are High-Pass and Low-Pass Filters?
Advice on how to be graphically creative
Version Control for Graphics
What could prevent OpenGL glDrawPixels from working on some video cards?
Simple Frameworks for Displaying Bitmaps and Handling Button Presses
Is OpenGL dead?
Suggested gaming platform to learn - Direct X (C++), Open GL or XNA
In a DDS file can you detect textures with 0/1 alpha bits?
Entity diagrams in ASP.NET MVC
.Net drawing clipping bug
Alpha blending colors in .NET Compact Framwork 2.0
Drawing Library for Ruby
Equidistant points across Bezier curves
Center text output from Graphics.DrawString()
What programs do you use to create graphic images?