Lolu hlelo lokusebenza likuvumela ukuthi uthole indlela entsha yokusebenzisana nokubona ngeso lengqondo i-algorithm elula ebizwa ngokuthi Unxantathu Algorithm.
Uhlelo lokusebenza libonakala lixazulula izinkinga ze-2D zenkinga enkulu ku-Computer Science: Ingabe iphoyinti 'ngaphakathi' leqoqo lesikhathi lamaphuzu athile? Uhlelo lokusebenza ngaleyo ndlela lisebenza njengendlela yemfundo nobuciko be-algorithmic.
Sebenzisa imodi eyisisekelo ukubona ngeso lengqondo lokho okwenzekayo ngeqoqo lamaphoyinti lapho i-algorithm isetshenziswa ngamaphuzu ahlukahlukene afakiwe womsebenzisi.
Sebenzisa imodi yokuqamba eyengeziwe yokuxhumana nemibala ehlukene futhi ubone ngamehlo engqondo wonke amathuba ahlukile lapho unikezwa iqoqo lama-vertices!
Ungagcina lezi zithombe njenge-high-res (4K) ocingweni lwakho futhi uziphrinte njengeziposta futhi / noma uzisebenzise njengobuciko bedijithali. Amathuba awapheli!
Iminyaka ayinandaba!
Izingane zizothola lolu hlelo lokusebenza lukhanga ngenxa yemvelo elula yohlelo lokusebenza ekunikezeni izithombe ezimibalabala nezimangazayo endabeni yemizuzwana embalwa.
Labo abanentshisekelo yokufaka imibala nobuciko bazothola uhlelo lokusebenza luthakazelisa ngoba lungakhiqiza izithombe eziningi ezihlukile, nokho ezinhle.
Othisha, kunoma yimaphi amazinga, bazokuthola kuthakazelisa ukukhombisa abafundi hhayi kuphela izinkinga ezibaluleke kakhulu nezijabulisayo ze-geometric nezesayensi yamakhompyutha, kepha i-algorithm elula nokho enamandla nokuthi ibaxazulula kanjani.
Abaphenyi bangaphefumulelwa ukubonwa kwe-2D kwe-algorithm engaphansi kokuxazulula izinkinga eziyinselele ngobukhulu bokuphikisana.
Nokho umakhi angaphefumulelwa ukuba enze izinhlobo ze-3D zezithombe abese uqhubeka nokuziphrinta kwe-3D.
I-algorithm engaphansi kohlelo lokusebenza yi "Triangle Algorithm", i-algorithm etholwe nguBahman Kalantari (https://www.cs.rutgers.edu/ ~kalantar/), uprofesa eRutgers University, eMnyangweni weSayensi yeKhompyutha.
I-algorithm ichazwe esihlokweni nguProfesa Kalantari: "A Characterization Algorithm and An Algorithm for A Convex Hull inkinga," Annals of research Research, uMqulu 226, Issue 1, pp 301-349, 2014. (bona i-http: // link .springer.com / i-athikili / 10.1007 / s10479-014-1707-2).
Lolu hlelo lokusebenza ukuqaliswa kwe-Triangle Algorithm ku-2D, eklanyelwe futhi yaqaliswa yiVarun Shah (varun.shah@rutgers.edu), umfundi othweswe iziqu eRutgers University.
Kunelayisense ngaphansi kwelayisense le-Apache, i-Version 2.0 (le 'License'). I-copyright 2017 Varun Shah.
Kubuyekezwe ngo-
Dis 30, 2019