HPSC

Member
  • Content count

    5
  • Joined

  • Last visited

Community Reputation

142 Neutral

About HPSC

  • Rank
    Newbie
  1. I looks like you are linking the vs2010 lib. You say you built the other one fine, when using that demo that is for 2010 in 2012 are the compiler settings still using the 2010 compiler? Project properties->General->Platform toolset try setting it to v100 (use the 2010 tools) and see if it works.
  2. I found a different solution that meets my needs, just pass the Scan0 pointer over and memcpy from one bitmap to another. Though if anyone have a better solution I am all ears.
  3. I am creating a gdiplus bitmap then a graphics object and getting an HDC from teh graphics object. I pass the HDC into a DLL to be drawn on (it used gdiplus in the dll to draw lines, polygons etc) [CODE] Gdiplus::Bitmap mem_dc(Width, Height, PixelFormat32bppARGB ); Gdiplus::Graphics g(&mem_dc); HDC hDC = g.GetHDC(); DllObject->Render(hDC); g.ReleaseHDC(hDC); [/CODE] In the DLL I have a 3rd party sdk that can use the hDC or a gdiplus bitmap, I have tried both ways but I have having a problem rendering transparency. [CODE] Gdiplus::Bitmap mem_dc(m_CanvasWidth, m_CanvasHeight, PixelFormat32bppARGB ); m_pView->Render(mem_dc); Gdiplus::Graphics g(hDC); g.DrawImage(&mem_dc, 0.0f, 0.0f); [/CODE] The sdk draws an blended overlay that I draw on top of another image, but when I render with these methods it seems to have already blended with black. Using the sdk directly rather than in a DLL and a bitmap works as I want it. You might ask why I don't do that, well I am doing terrible things... The sdk is old so I am wrapping it in a DLL with a pure virtual interface so I can use it a different compiler, my test set up for this seems to work (this is based on a codeproject article http://www.codeproject.com/Articles/28969/HowTo-Export-C-classes-from-a-DLL#CppMatureApproach ), and that is why I am passing a HDC across the boundary. If anyone knows if this is somehow possible with gdiplus objects that would be great. Thanks
  4. I have a collection of what I will call attributes. (thetype, value) Based on what is contained in that collection I want to find the best match in another collection of (thetype, value). If a collection I am trying to match against contains thetype but a different value it is not a match. It will match empty if there is no better match. Example: MyCollection = {(1,2), (4,2), (5,6)} Matchiing Collections c1 = {} //empty c2 = {(1,1)} c3 = {(1,2)} c4 = {(1,2), (4,3), (5,6)} c5 = {(1,2), (5,6)} So in this case it would match c5 thetype will be int, value at the moment is a string, but I kind of want to make it a variant since it could be several types, I know what it is based on thetype, but I am ignoring this for now. Is there a non brute force method I could do here using some sort of data structure and sort mycollection a specific way that would speed this up? Thanks. PS: I tagged it c++ since it is what the actual solution is in, so if there is already a library that does this or something similar feel free to point me in that direction
  5. I have an ordered set of polygons and I am intersecting them with a rectangle, how do I tell when the rectangle is filled so I can stop checking? This is in 2D. I am trying to get the minimal set of polygons with cover the rectangle. The order of the set is the priority of use and the polygons are simple (don't have holes or self intersecting). So if my set is {A,B,C,D} and A B D intersect the rectangle but A contains B than I want a the set that contains just {A, D}. Tried googling but wasn't sure what to google really, I was thinking it would fall under polygon coverage but that didn't seem to produce results of what I was looking for. Thanks