computational geometry problem

Question

1.00/5 (2 votes)

See more:

C++

C#

VB

how can I get executable code for minimum area triangulation?

Posted 2-Dec-11 5:07am

minooshi

Add a Solution

3 solutions

Add a Solution

Add your solution here

Treat my content as plain text, not as HTML

Preview 0

…

Existing Members

Sign in to your account

...or Join us

Download, Vote, Comment, Publish.

Your Email
Password
Forgot your password?

Your Email
This email is in use. Do you need your password?
Optional Password

I have read and agree to the Terms of Service and Privacy Policy
Please subscribe me to the CodeProject newsletters

When answering a question please:

Read the question carefully.
Understand that English isn't everyone's first language so be lenient of bad spelling and grammar.
If a question is poorly phrased then either ask for clarification, ignore it, or edit the question and fix the problem. Insults are not welcome.
Don't tell someone to read the manual. Chances are they have and don't get it. Provide an answer or move on to the next question.

Let's work to help developers, not make them feel stupid.

This content, along with any associated source code and files, is licensed under The Code Project Open License (CPOL)

JackDingler · Answer 1 · 2011-12-02T05:14:00

Solution 1

Find it on google, then steal it...

Posted 2-Dec-11 5:14am

JackDingler

Comments

Albert Holguin 2-Dec-11 11:16am

That's our top secret method! ...how dare you divulge!? lol ;D

Paul M Watt · Answer 2 · 2011-12-02T05:27:00

Solution 2

First, how would you solve this on paper with basic algebra and trigonometry?

If you can present that, we can help you get started converting it into code if you have issues at that point.

Posted 2-Dec-11 5:27am

Paul M Watt

Comments

Mohibur Rashid 2-Dec-11 23:26pm

That what I say to most learner,

Do it yourself first, then you might find a way about how your computer will do it

JackDingler · Answer 3 · 2011-12-02T05:45:00

Can you define what 'minimum area triangulation'

Is it the minimum number of triangles needed to cover the surface of a flat mesh?

With a flat mesh, find the outside lines. These will be your starting polygon.

Traverse the edges of the polygon, and everytime you find an inside acute angle, draw a line, connecting the the two non-joined points. Then use the second point as your starting point, and continue the process until the polygon is filled. As you do this, take care not to cross any existing lines. If connecting the points, causes you to cross an existing line, then continue around the inner edge until you find another acute angle that you can connect without crossing.

You can do this easily with pen and paper to seee how it works.

Draw some random polygon, and start at any intersection and work around it as described above.