Fast parallel algorithm for the classical algorithm is a good thinning algorithm, but its inherent defects, the potential loss of information. In order to overcome this shortcoming, a coincidence algorithm, the final order to reduce the computing time and redundancy of information, the reservation-based algorithm for template.

基于模板保留的快速并行细化算法.caj

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