Skip to content
  • Categories
  • Recent
  • Tags
  • Popular
  • World
  • Users
  • Groups
Skins
  • Light
  • Cerulean
  • Cosmo
  • Flatly
  • Journal
  • Litera
  • Lumen
  • Lux
  • Materia
  • Minty
  • Morph
  • Pulse
  • Sandstone
  • Simplex
  • Sketchy
  • Spacelab
  • United
  • Yeti
  • Zephyr
  • Dark
  • Cyborg
  • Darkly
  • Quartz
  • Slate
  • Solar
  • Superhero
  • Vapor

  • Default (No Skin)
  • No Skin
Collapse
Code Project
J

jk chan

@jk chan
About
Posts
205
Topics
30
Shares
0
Groups
0
Followers
0
Following
0

Posts

Recent Best Controversial

  • Lead the Birds - My First game
    J jk chan

    Friends, I have just published my first game "Lead the Birds". All coding is done in java android, qt c++ (for game editor tool development..) Please find the game link https://play.google.com/store/apps/details?id=com.tms.rescuethebird If you are a developer and would like to know any technical things let us know. I welcomes all questions and suggestions. Cheers JkChan

    If u can Dream... U can do it http://cgmath.blogspot.com/

    The Lounge c++ java android com game-dev

  • Lead the Birds - My First game
    J jk chan

    Friends, I have just published my first game "Lead the Birds". All coding is done in java android, qt c++ (for game editor tool development..) Please find the game link https://play.google.com/store/apps/details?id=com.tms.rescuethebird If you are a developer and would like to know any technical things let us know. I welcomes all questions and suggestions. Cheers JkChan

    If u can Dream... U can do it http://cgmath.blogspot.com/

    The Lounge c++ java android com game-dev

  • C# XNA 4 AI for path
    J jk chan

    yes. I remember, I have seen some learning based algorithms .see http://gamesitb.com/pathgraham.pdf[^] jk chan http://cgmath.blogspot.com/[^]

    If u can Dream... U can do it http://cgmath.blogspot.com/

    Algorithms tutorial csharp question

  • C# XNA 4 AI for path
    J jk chan

    try using A* algorithm see links below. Very simple A* algorithm implementation[^] C# - Visualizing Path Finding With Dijkstra, AStar, Bi-directional Dijkstra's, and Bi-directional A* Algorithms[^] Hopes this helps jk chan http://cgmath.blogspot.com

    If u can Dream... U can do it http://cgmath.blogspot.com/

    Algorithms tutorial csharp question

  • c++ and directshow
    J jk chan

    Take a look at GraphEdit tool, where you can drag and drop several filters and test it. Or you can just drag and drop a Avi file into graphedit, immediately it will show the filters and connections. Also take a look at sample direct show filters (comes with dxsdk) . Start with simple BallFilter http://msdn.microsoft.com/en-us/library/windows/desktop/dd318194(v=vs.85).aspx[^] Hopes this helps jkchan http://cgmath.blogspot.com[^]

    If u can Dream... U can do it http://cgmath.blogspot.com/

    ATL / WTL / STL c++ question

  • ::__argv ist NULL, but ::__argc is correct, why?
    J jk chan

    did u try __targv, i am not sure. just give a try.

    If u can Dream... U can do it

    C / C++ / MFC c++ visual-studio question

  • structure to file [REMAIN UNSOLVED] [CLOSED]
    J jk chan

    Student st; WriteFile(file,&st,sizeof(st),&written,0); open file using Createfile API, or you can use fopen("file","wb"); and fwrite C run time APIS. is it so complicated? :)

    If u can Dream... U can do it

    C / C++ / MFC tutorial

  • encryption using VS C/C++
    J jk chan

    in Windows you can use Crypto APIs. see http://msdn.microsoft.com/en-us/library/aa382016(v=vs.85).aspx[^]

    If u can Dream... U can do it

    ATL / WTL / STL c++ visual-studio sysadmin security question

  • Android and PC
    J jk chan

    Your question is very vague. If your phone supports wifi, i think you can use normal network programmnig to communicate with pc. Which type of communication is you looking for ?

    If u can Dream... U can do it

    Mobile question android

  • Motion tracking algorythm from Pan and tilt video feed
    J jk chan

    Tell me If you got it working.am just curious. :)

    If u can Dream... U can do it

    Algorithms help algorithms

  • find Duplicate record in listView using C#
    J jk chan

    ok , in that case say you have an array of items , ITEM[] MyItems, for each item in the list you can count the frequency , like MyItems[itemid].freq++; in the next loop u can check for items whose freq is > 1 then,thats it You canfind the duplicate record in O(n) time complexity.

    If u can Dream... U can do it

    Mobile csharp tutorial

  • Android Phone Problem
    J jk chan

    make sure that your device is present : adb devices , if it not there , you may want to install drivers. nexus one(and some others too) will be present when u install the android package.

    If u can Dream... U can do it

    Mobile android help question

  • Best way to convert from std::wstring to std::string?
    J jk chan

    i think we need to set correct locale first (setlocale) , right ?

    If u can Dream... U can do it

    ATL / WTL / STL php com help question learning

  • [OpenGL/MFC/C++] backface transparency...
    J jk chan

    To achieve real transparency at a fast rate is hard. To get exact picture , you need to sort triangles from back to front , based your camera vector. Also sometiems , if triangles overlap , you need to splitup it. The best way to do this is by implementing BSP tree. Using that you can do both front-to back or back-to-front rendering. I would suggest you to look into that first. In general for a scene , i do like this ( for fake transparency ) 1. Render all opaque objects 2. Sort triangles based on their material transparency. 3. Draw triangles which having lesser transparency level first followed by others. :)

    If u can Dream... U can do it

    Graphics c++ graphics com game-dev help

  • Motion tracking algorythm from Pan and tilt video feed
    J jk chan

    I have worked on several tracking algorithm. In many algorithm we need to give the boundary of the object to track. So if its not possible in your case, first you need to do some motion segmentation, then you need to track. Tracking is definitely complicated, so if you have time i would suggest you to look into active contours and SIFT feature tracking , otherwise try to implement mean shift algorithm, the problem with mean shift is it is not scale invariant. You also need to predict the camera object movement ( using kallman filter ) Hopes this will give you a very high level introduction. :)

    If u can Dream... U can do it

    Algorithms help algorithms

  • how to create dynamically popupmenu?
    J jk chan

    In that case instead of using regular menu , create a WS_POPUP style window, and handle the drawing and messages for performance improvement.

    If u can Dream... U can do it

    C / C++ / MFC tutorial question

  • Font in CWnd
    J jk chan

    Just call GetFont immediately after SetFont, so that we can test whether the problem is with invalid window handle. For a valid window handle it must work.

    If u can Dream... U can do it

    C / C++ / MFC wpf question

  • Image Transparency saving but Not showing.
    J jk chan

    In which format you saved image ? 32 bpp bitmap or PNG ? in that case it is fine. which function you use to draw the image ? if you use DrawImage function in gdiplus with a 32bit bmp ,it will work for sure.

    If u can Dream... U can do it

    C / C++ / MFC question

  • Expanding items in CTreeCtrl
    J jk chan

    you can do it by calling the function CTreeCtrl::Expand function like ctrl.Expand( hCurrentParent,TVE_EXPAND ); if you have multiple items at the most outer level , you need to call Exapand function for each of the items. you can use GetNextItem in CTreeCtrl for getting items. http://msdn.microsoft.com/en-US/library/a1azz3kt(v=VS.80).aspx[^]

    If u can Dream... U can do it

    C / C++ / MFC data-structures tutorial

  • Finding index of an array element??
    J jk chan

    you can use std::find function.you need to include algorithm header file for example if you have a vector containing some integers you can call it like this vector::iterator the_index = std::find( vcNumbers.begin(),vcNumbers.end(), number_to_search ); you can check if the index is valid by checking it against vcNumers.end().Something like this. if( vcNumbers.end() != the_index) cout << *it; hopes this helps :)

    If u can Dream... U can do it

    ATL / WTL / STL database data-structures question
  • Login

  • Don't have an account? Register

  • Login or register to search.
  • First post
    Last post
0
  • Categories
  • Recent
  • Tags
  • Popular
  • World
  • Users
  • Groups