作者查詢 / VictorTom
作者 VictorTom 在 PTT [ C_and_CPP ] 看板的留言(推文), 共10783則
限定看板:C_and_CPP
看板排序:
全部C_and_CPP10783AntiVirus1060VideoCard420PC_Shopping277ToS260Fund107CFP103Gossiping72Insurance65WorkinChina55Instant_Mess48P2PSoftWare36CD-R27SFFamily27StupidClown26Bank_Service23Soft_Job23FLAT_CLUB13Programming13Ladies_Digi12Steam11DSLR10MIT10MP53-110Windows10Chinese8HCSHch13_3118MATLAB8Wrong_spell8Broad_Band7ECClab7NUU_CSIE7PCSH91_3057GreenParty6TA_AN6LCD5PDA5Rubiks5Stock5Tech_Job5About_Life4AndroidDev4customers4Education4FSHS-95-3084KS97-3104Linux4MCU_Talk4NKUTEE4NTPU-STAT954NTU-EM934NTUBIME-1024Prob_Solve4SYSOP4THUMath954YoungDotx34ASHS-93-li3Browsers3ck-talk3ck61st3213CSMU-CM-OP3CSMU-ST953CYSH97Y3183documentary3EE_DSnP3EMS3Finance3FJU-Law20063GameDesign3joke3KS96-3123media-chaos3NCTU_SP7073NDHU-His1003NTPU-CSIE973NTUIBMB973NYUST97_MBA3RESIT3Sony-style3XBOX3Army-Sir2ASHS-95RN2CodeJob2CSMU-MED952DJ_fightman2Economics2EZsoft2GVOnline2KHCHS-93-3092KS93-3132KS97-3162KS_PMAC2LAW2Math2MEMS424_95th2movie2NCCU_SEED2NIU-ECE94b2NKFUST-CCE902NTHU_STAT942NTU-MJ2NTUCL-BASKET2NTUGIPO_PNSL2NTUT_MMRE862NTUT_MMRE932NUK_AC982NUK_TALK2Orzhong97cl2OverClocking2PLT2SCU_BM_VB2Storage_Zone2TWSU2AD_NCCU_VB1AGEC931Ancient1ASIA-uni1ask1ASM1b974060XX1BadmintnClub1Bunco1C_Sharp1CCSH_91_3151CCSHwindband1Chan_Mou1Christianity1CHSH_98_3011CJCU_HCA981ck49th3101ck56th3151ck58th3041ck58th3121ck59th3061ck61st3241ckbc1cksh84th3121CLHS-50-141clsh-Chung941CMU_BST011CMU_CM43A1CMU_Guitar421CMU_M491CPU_FC7811CSGirl_Group1CSMU-D951CSMU-HSA961CT24th3371CTSH963021DC1DirectSales1Disabled1DPP1DummyHistory1DYU1Employee1ESP1FCU-PF20061FCU_ECON_93B1FCU_ME_99C1FHSH-89-3161FiremanLife1FJU-EE-2004A1FJU-EE-2006B1FJU-EE-COMM1FJU-EE-PIPO1FJU-STAT91B1FJU-STAT95B1Gintama1Hate1HatePolitics1HCHS593051HCHS901151HCHS923131HCU1HLHS_10thU1HRM1HSNU_10081HSNU_10651HSNU_10851HSNU_10911HSNU_10981HSNU_11081HSNU_11091HSNU_11101HSNU_11261HSNU_11671HSNU_9751ILSH-943131ILSH-963131InitialD1KingdomHuang1KMT1kochikame1KOU1KS91-3051KS92-3061KS96-3051KS96-3111KS97-3081KS98-3021KUAS_5880321KUAS_ME94A1LTK1LTSH-963111MartialArts1medstudent1MenTalk1Militarylife1Miracle1Modchip1Mudran1Nantou1nb-shopping1NCCU05_GIDS1NCCU08_Math1NCCU_KungFu1NCCUPHY981NCKU_DAA-991NCU91Finance1NCU_MATH861NCU_ME-94B1NCUECON961NCUT1NCYU_Fst_991NDHU-AIPhy1NDHU-LF981NDHU-PA961NDHU-phy941NDHU-phy991NDMC-M1081NFU-MDE98A1NSYSU-Chem991NSYSU_EE95-11NTHU_COM6071NTNU-HisSB1NTOU-EBFS931NTPU-ACC-BMT1NTPU-CSIE981NTPU-IIM981NTU-K51NTUCB1NTUE-CS991NTUE-DC991NTUE-EPC-971NTUGIEE_AMTG1NTUHorti961NTUICPSC1NTUMEB951NTUMEB961NTUmed911NTUphy961NTUST-EE-A971NTUST-TX-B921NTUST-TX-B951NTUST_ME1NTUST_Talk1NTUT_EE490A1NUTN_SSSS1NUU-EO-97A1NUU_Talk1Odoko-juku1Olympics_ISG1paranormal1Paul_59-1T1PCCU-CS1Pisces1PSJH5-3051PTGSH96-3161PublicIssue1PushDoll1Road1RSSH94_3061SAN-YanYi1San-Ying1SCU_Law101B1SCU_Talk1SCUG1scutran_city1Seiya1SSSH-16th3131SSSH_17th3141Starbucks1StraightMH1TCFSH67th3011TFG08Music1THU-CHE961THU_BA20001TKU_EE_92C1TNFSH98th1Tokusatsu1Transport981TryingTimes1TTU-AFL1TTU-Transfer1TWproducts1UFO1VET_961viatording971VictoryYouth1Warfare1Wine1WuLing46-3171WuLing50-3031WuLing50-3041XiangSheng1You_out1YP94-3101Yup01-041Zastrology1<< 收起看板(310)
10F→:想附註一下, 學程式語言不是看完書就算學會了喔....@_@"08/27 19:35
2F→:看不出來是想問Z-test還是Occlusion Query....@_@"08/12 18:18
5F→:你給好兩者的Z確定一前一後, 然後開好設好Z-Test, 這樣08/12 20:57
6F→:不管你先畫誰, 前後順序與遮蔽狀況自然會表現好@_@"08/12 20:58
7F→:不然就像1F提到的用Stencil test, 只是不覺得比較容易XD08/12 20:59
8F→:如果是要被遮住的object不要畫用Occlusion Query....08/12 21:00
9F→:如果是被遮住的三角形完全不要畫到, 那不是你寫App的人08/12 21:00
10F→:要煩惱的是, 是各家OpenGL的HW/SW實作在煩惱的事....:)08/12 21:01
13F→:是說vertex/object的data量很大? 現在實務上的作法是,08/14 02:26
14F→:把gen大量/細節vertex data的工作直接交給GPU去做, 做完08/14 02:27
15F→:直接丟進VRAM裡讓它繼續被使用 => 其實就是GS/TS的應用.08/14 02:28
16F→:以節省disk/system ram的traffic; 只是我不懂GS/TS...XD08/14 02:29
17F→:另外, Z-test對line或point應該都沒什麼問題....@_@"08/14 02:31
21F→:如果你介意的是被畫出來的primitive/pixel, 也許08/15 02:04
22F→:occlusion query可以幫你, 但是得到這個好處前, 你得額08/15 02:05
23F→:外生出更多簡易/概略/bounding object來套這個feature.08/15 02:06
24F→:如果你介意的是要讀出來的資料量, 基本上GL大概沒有任何08/15 02:06
25F→:辦法幫你; 想省這個大概全部要從你自己軟體/data來下手.08/15 02:07
26F→:是說說了這麼多還是不曉得你的瓶頸到底在哪裡....08/15 02:10
27F→:如果是可以share的東西就乾脆share出來看看吧, 說不定其08/15 02:11
28F→:他板友大大們一看就可以建議用什麼方式來解決:)08/15 02:11
6F推:推XD08/10 23:30
7F推:推精美的圖XD08/05 01:57
18F推:推:)07/29 22:04
1F推:試試用 ->Hide(); 就好:)07/21 12:39
1F推:int number[SIZE]; => number[]可用index為0~SIZE-107/19 22:12
2F→:你printf number[SIZE]根本印超過陣列了, 簡易的推斷為07/19 22:13
3F→:剛好印到了是變數i的地方, 所以印出了那樣的結果....07/19 22:13
4F→:不過也不用想預期超過array大小會變成什麼結果就是XD07/19 22:14
12F推:推:)07/17 00:23
12F推:worship~~06/30 01:30
5F推:1F露餡了XD06/19 09:00