|
Sorry. I am programming in SDK using 'IPicture' interface.
Priya Sundar
|
|
|
|
|
This article will help you 
Click here ->[^]
Yes U Can ...If U Can ,Dream it , U can do it ...ICAN
|
|
|
|
|
Well Shilpi, I have tried to display my picture in the same way only.
However, I have now located the actual problem. The function doesnt display the .jpg files with a CMYK(Cyan, Magenta, Yellow, KeyColour-Black) colur mode.
I want to display files with .jpg extension but in the colour mode of CMYK.
Priya Sundar
|
|
|
|
|
Hi All,
Can anyone suggest me best & simple way to use MySQL database in VC++6.0 environment ? I may move to Visual Studio 2005 or 2008 but at this point I want to start with VC6 to reduce dealing other issues. I have never used MySQL so I'm very new so looking some stable wrapper library for it and I heard about MySQL++ and don't see much people talking about it. I read on their FAQs that it's not well supported on VC6.0 due to STL issues so I can think about using 2005 then. Any comments are highly appreciated.
thanks.
modified on Monday, May 19, 2008 9:52 PM
|
|
|
|
|
1)[^]2)[^]3)[^]
these all will help you to sort your problem
Yes U Can ...If U Can ,Dream it , U can do it ...ICAN
|
|
|
|
|
hi Shilpi,
thx for reply. So you think using MySQL++ is good idea then ?
|
|
|
|
|
Hi,
I have created a new COM DLL and just wondering how to return a new COM object.
Here is my code (in COM DLL) to return a new object.
HRESULT __stdcall CMainTestClass::GetSamTest(IAdd **ppRetVal)
{
CAddClass *pAddClass = new CAddClass();
*ppRetVal = pAddClass;
return S_OK;
}
When I call this function in C#, it gave me this error:
The runtime has encountered a fatal error. The address of the error was at 0x7f628678, on thread 0x105c. The error code is 0xc0000005. This error may be a bug in the CLR or in the unsafe or non-verifiable portions of user code. Common sources of this bug include user marshaling errors for COM-interop or PInvoke, which may corrupt the stack.
My C# code:
MyTestLib.MainTestClass oMainObject = new MyTestLib.MainTestClass();
MyTestLib.AddClass addObject = (oMainObject .GetSamTest() as MyTestLib.AddClass );
MessageBox.Show(addObject.DoTheAddition().ToString());
Thanks for any help
|
|
|
|
|
I look for code in matrix calcs. Plz help find.
|
|
|
|
|
Please see this[^]
cheers,
Chris Maunder
CodeProject.com : C++ MVP
|
|
|
|
|
Or DO look for, there are tons of algebra algoritms in internet. Just google a bit
Greetings.
--------
M.D.V. 
If something has a solution... Why do we have to worry about?. If it has no solution... For what reason do we have to worry about?
Help me to understand what I'm saying, and I'll explain it better to you
“The First Rule of Program Optimization: Don't do it. The Second Rule of Program Optimization (for experts only!): Don't do it yet.” - Michael A. Jackson
|
|
|
|
|
Perhaps this[^] will be of use.
PS: Don't use the word "urgent" as you've done -- no one cares. More likely than not using it in this way will provoke anger and you'll get little if any help.
PPS: It wouldn't hurt if you were more descriptive!
Steve
|
|
|
|
|
poor idiot... even in the related tachnical forum, i doubt people will come and help you, looking as lazy as you are...
|
|
|
|
|
Why are you looking for code?
This kind of development maybe very amusing, try to code yourself.
If the Lord God Almighty had consulted me before embarking upon the Creation, I would have recommended something simpler.
-- Alfonso the Wise, 13th Century King of Castile.
This is going on my arrogant assumptions. You may have a superb reason why I'm completely wrong.
-- Iain Clarke
|
|
|
|
|
This has to be another troll surely. Kyle? Is this you again?
Morality is indistinguishable from social proscription
|
|
|
|
|
google
"Opinions are neither right nor wrong. I cannot change your opinion. I can, however, change what influences your opinion." - David Crow
Never mind - my own stupidity is the source of every "problem" - Mixture
cheers,
Alok Gupta
VC Forum Q&A :- I/ IV
Support CRY- Child Relief and You
|
|
|
|
|
Hi
I am looking for C++ code or algorithm to calculate the point in a surface and the minimum distance from the surface to a line segment. The line segment is not in the surface. It is assumed that the surface is defined as arrays:
x(i), y(i), z(i), i=1,2,...n
The line d=segment is defined as x0, y0, z0, l - starting point and length, and directional number - k, m, n
Thanks
|
|
|
|
|
"See Calculus and Analytical Geometry" George B. Thomas, (I had Third Edition, third printing, June 1962. That will give you the algorithm, the code is simple once the algorithm is known).
|
|
|
|
|
Thanks for your reply.
I know how to get the analytical solution. However, the problem here is a digital values.
It involves search, interplation, minimization, and etc. I am looking for some clever coding.
|
|
|
|
|
mrby123 wrote: I know how to get the analytical solution. However, the problem here is a digital values.
You don't think analytical solution being clever, do you?
If the Lord God Almighty had consulted me before embarking upon the Creation, I would have recommended something simpler.
-- Alfonso the Wise, 13th Century King of Castile.
This is going on my arrogant assumptions. You may have a superb reason why I'm completely wrong.
-- Iain Clarke
|
|
|
|
|
We need to use analytic geometry, which is easy part. Now we need to deal with this digital numerical problem, involving interpolation, extropalation, minimization, etc. I am looking for a algorithm for these.
|
|
|
|
|
You need to give us more information. Your description of the line segment only seems to give the XYZ coordinates of the start and the length, but you state that there is also a direction vector (a necessary evil) but do not list its parameters. For the surface, you give an array of XYZ points, but do not specify in what way the points are connected, i.e., in groups of 3 for triangular tiles?
Armed with this information, you can use the analytical method to determine the minimum distance from the line segment to a selected tile, save that distance and identification of which tile was selected, calculate the same information for the next tile, compare the two results and select the minimum distance and continue until all tiles have been checked.
You also have not specified what to do if more than one minimum distance are the same, which tile to select?
As Number 5 said in "Short Circuit", "I need more information!"
|
|
|
|
|
I listed: x0, y0, z0, length - l, directional number - k, m, n - this is sufficient.
You can connect the discrete points every three in a way you like. I think this is a part of algorithm
for best solution. The point which has minimum distance to the point in the segment can be interpolated.
Thanks
|
|
|
|
|
Ok. Your last statement brings up another question (since you can connect the points "in a way you like"). Does the solution need to determine the minimum distance to one of the discrete points, or to any point on the surface which these three points lie upon? A three dimensional convex hull could be constructed to enclose the points, but would not be correct if the surface were like a golf ball with dimples and one of the points was at the bottom of the dimple (a convex hull would skip over that point), some surface generating ordering of the points must be described, otherwise you do not have a "surface" but many intersecting "surfaces". Another view of the points could be that each two adjacent points are paired as an edge, and you have to scan the array looking for some point that matches either end to connect that edge with this edge to finally form a "surface".
Note further: If the discrete points are to be taken as a group of three to form a triangle, then if the line segment is parallel to that triangle and directly over it, then an infinite number of points on the surface would have the same distance to the line segment. If The line segment was not parallel to the surface, but to one of the edges, then the same condition exsists.
It all really all depend on the definition of the term "surface".
|
|
|
|
|
Does the solution need to determine the minimum distance to one of the discrete points - No, a point in the surface, coordinates of which need to be interpolated and calculated.
Note further: If the discrete points are to be taken as a group of three to form a triangle, then if the line segment is parallel to that triangle and directly over it, then an infinite number of points on the surface would have the same distance to the line segment. If The line segment was not parallel to the surface, but to one of the edges, then the same condition exsists.
Whatever, the minimum value is one value. In the above case we can pickup any one point or the point in the center of the region or line segment.
It is a complex problem. In fact, the point in the line segment which gives the minimum needs to find out. A search is required, too.
|
|
|
|
|
I'm not trying to put you off, but I have to get ready for a short trip. I'll be out of touch for a day or so, but I will get back to this problem.
Dave.
|
|
|
|
General 
News 
Suggestion 
Question 
Bug 
Answer 
Joke 
Praise 
Rant 
Admin 
Submit an article or tip
