This week I continued work on PR#13082. The last implementation left for the 3D case is the hyperplane representation. For example, the user can express the list of facets of the polytope by a list of points for each facet or a list of hyperplane parameters(a tuple for each facet). p1 = [(0, 1, 0),… Continue reading Week 10 Report(August 4 – August 10) : More functionality for 3D case.
This week I returned to college and quite some time was spent in setting up the room, registering for courses, etc. Also, I have 27 hours a week of classes from now on which is okay considering that some of my batch-mates have 31 – 32 hours/week. The good thing is that the major part… Continue reading Week 9 Report(June 27 – August 3) : Basic 3D prototype.
So, I wrapped up PR#12931 on handling implicit intersections. I’ve to clean it up a bit more as suggested by Christopher. I plan to implement the Bentley-Ottmann Algorithm and the case with intersecting polygons with more than two sides passing through same point in separate PRs. Now, about the 3D case I initially thought about… Continue reading Week 8 Report(July 18 – July 26): Beginning 3D case
I had initially planned to begin implementing the 3D case this week. But I wanted closure for the 2D case. Currently there is no support for implicit intersections for polygons. One could make the failing tests pass by not raising an error when such a polygon is encountered, but obviously that wouldn’t be a good… Continue reading Week 7 Report(July 11 – July 17) : Implicit Intersections
I finished the 2D implementation this week. I’m very thankful to Gaurav Dhingra(a fellow senior GSoC student) for taking the time to review the pull request and suggest some really good changes. This is the link to it –> #12673. The last issue with the 2D case was the case of implicit intersecting polygons not… Continue reading Week 6 Report(July 4 – July 11) : 2D complete, time to begin 3D
Note : If you’re viewing this on Planet SymPy and the Latex looks weird view it on WordPress instead. Unfortunately the dynamic algorithm was much faster only on a regular hexagon. Why that particular figure ? The reason still eludes me. But I did use the same idea to implement the multiple polynomial case. That… Continue reading Week 5 Report(June 25 – July 3) : Finalizing 2D case.
Note : If you’re viewing this on Planet SymPy and Latex looks weird, go to the WordPress site instead. Prof. Sukumar came up with the following optimization idea : Consider equation 10 in Chin et. al . The integral of the inner product of the gradient of and need not be always re-calculated. This is… Continue reading Week 4 Report(June 18 – 24) : Dynamic Programming