Convex polygon triangulation problems. Given a convex polygon, each edge of the right to set a value, called convex polygon divided into a triangle, making all the right triangle and the smallest value.

Packet : 75448173polysplit.rar filelist
PolySplit\main.cpp
PolySplit\PolySplit.dsp
PolySplit\PolySplit.dsw
PolySplit\PolySplit.ncb
PolySplit\PolySplit.opt
PolySplit\PolySplit.plg
PolySplit

• We are an exchange download platform that only provides communication channels. The downloaded content comes from the internet. Except for download issues, please Google on your own.
• The downloaded content is provided for members to upload. If it unintentionally infringes on your copyright, please contact us.
• Please use Winrar for decompression tools
• If download fail, Try it againg or Feedback to us.
• If downloaded content did not match the introduction, Feedback to us，Confirm and will be refund.
• Before downloading, you can inquire through the uploaded person information

Nothing．