From BlenderWiki

Jump to: navigation, search
Note: This is an archived version of the Blender Developer Wiki. The current and active wiki is available on wiki.blender.org.

Schedule

Weekly Plan

Week 6: 27.6 - 1.7

  • Finish the recursive implementation of the algorithm for dense graph
    • Correct implementation of the recursive algorithm (1.5 days)
    • Handle separate parts of the mesh (2 days)
    • Add max recursion and 'combinatorial' as parameters to the operator (1 day)
    • Documentation (0.5 days)
  • Testing build

Week 7: 4.7 - 8.7

  • Improved handling of the algorithm termination
    • Unwrap the mesh automatically after seam generation (2 days)
    • write function to calculate current max and average stretch for the mesh and use this function to compare against a threshold (2 days)
  • Documentation, code cleanup and catch-up (1 day)

Week 8: 10.7 - 15.7

  • bugfixing
  • code cleanup
  • catch-up
  • support for compiling autoseam with SCons
  • code and design documentation
  • testing build

MIDTERM

Week 9: 18.7 - 22.7

  • Take decision on which library for the Lanczos Algorithm to use (1 day)
  • Write proof of concept function to calculate eigenvalues with the library (3 days)
  • Start on the wrapper functions to allow easier usage of the CARPACK/Lanczos library (1 days)

Week 10: 25.7 - 29.7

  • Write wrapper functions to allow easier usage of the CARPACK/Lanczos library (2 more days)
  • Integrate library into the seam generation algorithm (3 days)

Week 11: 1.8 - 5.8

  • Finish integration of library (2 days)
  • code cleanup, bugfixing, testing
  • create demo (video)
  • finish documentation
  • Test build

Week 12: 8.8 - 12.8

  • Straighten constraint tool (optional, if everything else is finished) (5 days)
  • otherwise finish necessary tasks
  • final bugfixing

PENCILS DOWN (August 15)

Week 13: 15.8-19.8

  • Documentation
  • Final Demo
  • Test build

FINAL EVALUATION (August 22)

Original Estimates (for the record)

These are the tentative plan for the coming days. This plan will be more detailed if necessary.

  • Finish the recursive implementation of the algorithm for dense graph : 6 days
  • Integration of eigen library: 12 days

The ABF++ algorithm is basically a constraint satisfaction type algorithm. To implement the following 2 tools we need to add some more constraints to the implementation of the algorithm. So, the implementation can take time in two steps. To understand the current implementation of ABF++ and to add the constraints in proper place. These are the estimations for the task -

  • Angle-on-border tool: 5 days
  • Straightenting constraint: 5 days

To do the next steps, I need to implement graph isomophism algorithm and integrate it with the current autoseam code and possibly link it to texture mapping system. The last part can be done later. The possible estimate is-

  • Symmetry aware parameterization : 12 days

If any portion of the above mentioned works remain uncomplete the remaining time will be utilized to do them. Otherwise, the remaining time will be spent in implementing the graphical use interfaces for the following tools