Skip to content
Snippets Groups Projects
Select Git revision
  • main default
1 result
You can move around the graph by using the arrow keys.
Created with Raphaël 2.2.015Jan6543131Dec30291913121095421Question dans le mainmainmainProjet: binary img for questions 11 to 13Clean printQuestion13: OkQuestion 12: yokoi only on pixel on the border of the figureQuestion12 nommage fix manque + Rajout précision dans le rapport.mdQuestion 12: improve namingQuestion 12: Ok, valgrind OkQuestion 12: Test de structure pour les graph quasi connexe bug -> neighbor liste des graphes tjrs emptyQuestion12: Propal de structure de données pour le graphe dess composantes quasi connexeInit question12 call by main.cMise au propreQuestion 10 fix: for section and only compute yokoi number if pixel ins't in the backgroundQuestion10 debut repQuestion 7-10 fix debug car algo était casséQuestion 10 : OkQuestion 7-9 fixFix soeuil adaptatifInit question10Check tous les valgrind, OK sur plusieurs pgm + Revision rapport.md qquestion 8 et 9Readd rechoice with the histogram if value too high or too low + valgrind check OKQuestion 9: OK + partie theorique + valgrind OKQuestion 8 : fixQuestion 8 : propalQuestion 7: fix bug OKQuestion 7: pick another choice if T too low or too highQuestion 7 : OK mais resultat chelouExtension of bresenham segmentQuestion 7: Bresenham look like OKQuestion 4 to 6: circularityV2. Valgrind OKNew circularity compute OK : Same result as the older method, fast asfDebug circularité v2'Circularity v2Question7 : implementation bresenham bug pile retourner videDebut question 7 Ok -> test valgrind OK (giga long)Question 6 : OK valgrind, test soeuil min et max sur petite ppm-> OK parfaitQuestion 5 : OkQuestion 4 : Fix xmin et ymin init -> circularité pareil que l'ancien algo naif OKQuestion 4 : OKQuestion4 : debut implementation