Latest revision |
Your text |
Line 123: |
Line 123: |
| -First point should be a skip (for now I had assumed first point would never be one, without really thinking about it). | | -First point should be a skip (for now I had assumed first point would never be one, without really thinking about it). |
| | | |
− | -First bunch of points or last bunch of points' projections lay outside the segment. They should receive special consideration. | + | -First bunch of points or last bunch of points' projections lay outside the segment. Only the CLOSEST to inhit and outhit respectively should receive consideration, and the same rules as usual apply to check if it is a skip or not. |
| | | |
| '''23-9''' | | '''23-9''' |
| | | |
− | From today I will try to approach the final step of my code in a slightly different way, in order to correctly handle projections outside the segment, but who's boundaries actually lay inside. I will use intersections to compute a list of boundaries, and then just loop through them once to calculate avg density. I will not use the projection point in this stage (I will still use it to predict a skip).
| |
− |
| |
− | I know I should write complete code, but this overhaul will take some time. I will try to release in-progress working stages if I can. I really think this new version cleans up the mess quite a lot, simplifies the concepts, makes it all more readable, and most importantly, will support more situations than before, removing several flaws.
| |
− |
| |
− | The whole projection concept wasn't that good of an idea to begin with, I shouldn't have stuck to it for so long. It's only useful for predicting skips.
| |
− |
| |
− | '''24-9 to 1-10'''
| |
− | Holiday (trip).
| |
− |
| |
− | '''02-10'''
| |
− |
| |
− | Refactoring stage 1.
| |
− |
| |
− | '''03-10'''
| |
− |
| |
− | Desiging new algorithm for stage one.
| |
− |
| |
− |
| |
− | '''04-10'''
| |
− |
| |
− | Designed and published new algorithm and published it.
| |
− |
| |
− | '''05-10'''
| |
− |
| |
− | Starting with implementation.
| |
− |
| |
− | '''06-10'''
| |
− |
| |
− | Broke down implementation steps. Got rid of intersection function, replaced by a new, more complete function that tells us if a point's region will be crossed or not, directly. Computes the intersection, checks if it lays inside the segment and checks distances to evaluate if the boundary is crossed by the segment or not, returns a boundary_t struct.
| |
− |
| |
− | '''07-10'''
| |
− |
| |
− | Implementing new algorithm step 1.
| |
− |
| |
− | '''08-10'''
| |
− |
| |
− | Break
| |
− |
| |
− | '''09-10'''
| |
− |
| |
− | Finished and submitted new algorithm, tested for 0, 1 and 2 points.
| |
− |
| |
− | '''10-10'''
| |
− |
| |
− | Hunting for bugs and removing old/unused variables and code blocks.
| |
− |
| |
− | '''11-10 && 12-10'''
| |
− |
| |
− | University.
| |
− |
| |
− | '''13-10'''
| |
− |
| |
− | Testing more cases and making sure no more bugs are present.
| |
− |
| |
− | '''14-10'''
| |
− |
| |
− | Moving code over to rtweight (again).
| |
− |
| |
− | '''15-10'''
| |
− |
| |
− | Finished moving code over, and testing the implementation. Basic cases seem to work. Submitted code.
| |
| | | |
| | | |
| | | |
| Mario Meisner. | | Mario Meisner. |