Basically almost all of the respondents suggested dividing up the set of discrete points into a set of triangles and then computing the intersection of these rectangles with planes representing the contour levels. This way we can process all the levels at once instead of the "crawler" type algorithms which is what I had originally been trying to get to work.

shuli.txt

• 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．