Editing User:3bhady
From BRL-CAD
Warning: You are not logged in. Your IP address will be publicly visible if you make any edits. If you log in or create an account, your edits will be attributed to your username, along with other benefits.
The edit can be undone.
Please check the comparison below to verify that this is what you want to do, and then save the changes below to finish undoing the edit.
Latest revision | Your text | ||
Line 50: | Line 50: | ||
* Implement the geometry utility functions.(C) | * Implement the geometry utility functions.(C) | ||
=== Activity Log For This Period === | === Activity Log For This Period === | ||
− | + | # Started trimming the translation vectors. | |
− | # Started | ||
# Wrote a skeleton code for a function to calculate the maximum distance a polygon can slide in a given direction without intersecting with another polygon. | # Wrote a skeleton code for a function to calculate the maximum distance a polygon can slide in a given direction without intersecting with another polygon. | ||
# Created a function that takes two edges and finds the maximum distance one edge can travel in a given direction without intersection. | # Created a function that takes two edges and finds the maximum distance one edge can travel in a given direction without intersection. | ||
Line 57: | Line 56: | ||
# Created a function to calculate the maximum distance a vertex can travel in a given direction. | # Created a function to calculate the maximum distance a vertex can travel in a given direction. | ||
# Finished calculating the maximum sliding distance for each translation vector. | # Finished calculating the maximum sliding distance for each translation vector. | ||
− | + | * All the previous functions are utility functions used in the NFP function which is the core of the packing algorithm this was supposed to be implemented next month but it makes sense to start with it and porting each helper function along the way. | |
== June 28-July 4 == | == June 28-July 4 == | ||
Line 63: | Line 62: | ||
* Writing unit test skeleton for placement algorithm.(T) | * Writing unit test skeleton for placement algorithm.(T) | ||
=== Activity Log For This Period === | === Activity Log For This Period === | ||
− | + | N/A | |
− | |||
− | |||
− | |||
− | |||
== July 4- July 21 == | == July 4- July 21 == | ||
=== Required === | === Required === | ||
Line 74: | Line 69: | ||
* Parallelizing the placement algorithm.(C) | * Parallelizing the placement algorithm.(C) | ||
=== Activity Log For This Period === | === Activity Log For This Period === | ||
− | + | N/A | |
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
== July 21-July 26 == | == July 21-July 26 == | ||
=== Required === | === Required === | ||
* Design skeleton code for unit testing optimization algorithm.(T) | * Design skeleton code for unit testing optimization algorithm.(T) | ||
=== Activity Log For This Period === | === Activity Log For This Period === | ||
− | + | N/A | |
− | |||
− | |||
− | |||
− | |||
== July 26-Aug 9 == | == July 26-Aug 9 == | ||
=== Required === | === Required === |