|
Alan,
Thank you for the answer.
I did start to try the link. First it wanted to install a plugin in FF, OK, I'll go with that. That failed, and the next thing it wanted to do was install a Sun DLL. I decided to quit at that point because the next thing it would want to do would be enable Java Script which I have disabled.
I'm happy that that solution will work if I ever need it.
Dave.
|
|
|
|
|
Depends on your situation. You should probably do a bounding box check first since it's simple, quick and will eliminate a lot of lines.
There's an entire book essentially on this subject:
http://www.amazon.com/Real-Time-Collision-Detection-Interactive-Technology/dp/1558607323/ref=sr_1_1?ie=UTF8&s=books&qid=1227945892&sr=1-1[^]
Some of the things you need to think about:
Are your polygons convex or can they be concave?
Are you testing fixed polygons against a series of lines or does the polygon change with each test?
Are your lines more likely to miss than not?
BSP trees are worth looking into if you really want to squeeze every last drop of performance. They're a bit complex, though and mostly good for lots of lines testing against a single polygon.
|
|
|
|
|
Iam student have aproject about retreiving image
,so Iwant agood algorithm about analysis images to find the signature of it and uses this step to retreive...
plz plz plz help me in a shortest possible time ..
thanks alot..
|
|
|
|
|
luna2010 wrote: plz plz plz help me in a shortest possible time ..
Done.
BTW: Google & CodeProject's article search engine are your best friends (reading the forum guidelines will be a plus).
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
[My articles]
|
|
|
|
|
Sendme ur codez, plz. Urgent!
"If only God would give me some clear sign! Like making a large deposit in my name in a Swiss bank."
|
|
|
|
|
luna2010 wrote: plz plz plz help me in a shortest possible time ..
No. It might be more time efficient for you to google it 
"The clue train passed his station without stopping." - John Simmons / outlaw programmer
"Real programmers just throw a bunch of 1s and 0s at the computer to see what sticks" - Pete O'Hanlon
"Not only do you continue to babble nonsense, you can't even correctly remember the nonsense you babbled just minutes ago." - Rob Graham
|
|
|
|
|
Google is ur best friend. Google it.
|
|
|
|
|
I need to figure out the formula/pattern/algorithm needed to convert the number on the left into a checksum on the right. Here are a few examples
6789542137 ; 53426
7274707623 ; 13890
7608909976 ; 21097
7866018419 ; 46204
8185833863 ; 59982
8052724826 ; 68535
Please help
Thanks
|
|
|
|
|
Please give us some hints, for instance: will this help to understand the origin of the Universe? 
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
[My articles]
|
|
|
|
|
Can you supply any more information? A bunch of numbers and their checksum isn't much to go on...
"If only God would give me some clear sign! Like making a large deposit in my name in a Swiss bank."
|
|
|
|
|
unfortunately that is all the information I have. What i am trying to do is find out what formula/algorithm when applied to the 10 digit number will get me the 3-5 digit code. Any help would be great
|
|
|
|
|
hdsouza1 wrote: unfortunately that is all the information I have. What i am trying to do is find out what formula/algorithm when applied to the 10 digit number will get me the 3-5 digit code. Any help would be great
I'm afraid that's near-impossible. It's equivalent to trying to decrypt an encrypted message given no information about the encryption. You have to have some idea how it functions otherwise it could, quite literally, be among hundreds of thousands of possible algorithms. For all I know, these could be nothing but randomly generated numbers...
"If only God would give me some clear sign! Like making a large deposit in my name in a Swiss bank."
|
|
|
|
|
Good luck.
"The clue train passed his station without stopping." - John Simmons / outlaw programmer
"Real programmers just throw a bunch of 1s and 0s at the computer to see what sticks" - Pete O'Hanlon
"Not only do you continue to babble nonsense, you can't even correctly remember the nonsense you babbled just minutes ago." - Rob Graham
|
|
|
|
|
a * x ^ 6 + b * x ^ 5 + c * x ^4 + d * x ^ 3 + e * x ^ 2 + f * x = y
use you data you can solute a、b、c、d、e、f.
|
|
|
|
|
Hi Shrewdlin, Thanks for your reply. Need a little more help. What is
1) x and y
2) Does x^5 mean x to the power of 5
Thanks
|
|
|
|
|
1) x and y is variable
2) yes, it means x to the power of 5
yan can use your data to make six equation for example:
a * 6789542137 ^ 6 + b * 6789542137 ^ 5 + c * 6789542137 ^ 4 + d * 6789542137 ^3 + d * 6789542137 ^ 2 + f * 6789542137 = 53426 (this is the first one, you can do the other)
six equation to solve six variable can you calculate the a、b、c、d、e、f
then use the known a、b、c、d、e、f to rebuild the equation
the data is very big you can use maple software for you!!!good luck!!
|
|
|
|
|
The problem will arise with the seventh line of the sequence.
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
[My articles]
|
|
|
|
|
Hi Shrewdlin,
Thanks for the detailed explanation. I guess I will have to buy the maple software. before I buy I was wondering how you got to this formula. Did you run the numbers through some program of yours to get this formula
Thanks
|
|
|
|
|
You can solve it in a spreadsheet, for the theory see Polynomial Interpolation[^], but unless you know that the answer you are looking for is a polynomial it is almost certainly wrong.
A 5th order polynomial can be fitted to your data:
a * x ^ 5 + b * x ^ 4 + c * x ^3 + d * x ^ 2 + e * x ^ 1 + f = y
but so can a 6th
a * x ^ 6 + b * x ^ 4 + c * x ^3 + d * x ^ 2 + e * x ^ 1 + f = y
a 7th
a * x ^ 7 + b * x ^ 4 + c * x ^3 + d * x ^ 2 + e * x ^ 1 + f = y
or a different 7th
a * x ^ 7 + b * x ^ 6 + c * x ^3 + d * x ^ 2 + e * x ^ 1 + f = y
or a Fourier series
a * sin(x) + b * sin(2*x) + c * sin(3*x) + d * sin(4*x) + e * sin(5*x) + f = y
or basically a linear combination of any collection of 6 functions (some collections of 6 functions will fail, but most will succeed). There are also a wide range of possible solutions that don't fall into these categories.
So unless you can state why any of the above solutions should or shouldn't be the one you are looking for, you don't know enough about the problem to solve it.
Peter
"Until the invention of the computer, the machine gun was the device that enabled humans to make the most mistakes in the smallest amount of time."
|
|
|
|
|
Wait! Don't buy Maple! You need to tell us something about what you expect out of this "decoder". If you just want any function that will match up at these points, sure, the polynomial will work but it will go crazy outside of these points. I'm assuming you're trying to "reproduce" some other function which spat out these values, in which case the polynomial is pretty much guaranteed to be the wrong thing. On the other hand, if you're just looking for a rule that takes on those values, you can use the function which takes on those specific values at those specific points and is zero everywhere else. It's about as likely as the polynomial and you don't have to buy Maple to compute it.
In general, if you are trying to reproduce the function that somebody else carefully chose to produce these values you're probably out of luck. There are an infinite number of functions that will do that. If you're looking for any function at all, then either take the one I mentioned above or explain whatever other details you've got that keep that one from working. You see these sort of questions in "brainteasers" where you have a chance of solving them, but if this was designed to prevent cracking, you're not likely to chance across the right answer.
|
|
|
|
|
The question as you have posed it is nonsense. There are an infinite number of solutions. For example, I guess this is not useful, but the formula f(n) defined by:
f(6789542137) = 53426
f(7274707623) = 13890
f(7608909976) = 21097
f(7866018419) = 46204
f(8185833863) = 59982
f(8052724826) = 68535
f(n) = 0 for all other n
actually answers your question.
Perhaps you could explain what you are trying to do?
Peter
"Until the invention of the computer, the machine gun was the device that enabled humans to make the most mistakes in the smallest amount of time."
|
|
|
|
|
why is it assumed that f(n) = 0 for all other n
|
|
|
|
|
Because based on the finite sample population he posted, it is a valid assumption.
"If only God would give me some clear sign! Like making a large deposit in my name in a Swiss bank."
|
|
|
|
|
But he has just given you few samples of input and output of a function.
all the remaining output cannot be assumed to be zero
what you are saying is this:
if i say
f(100) = 10
f(81) = 9
f(64) = 8
f(49) = 7
f(36) = 6
f(25) = 5
here its a simple example in which output is just square root of input
now based on your assumption
f(n) = 0, does that mean square root of all remaining numbers are zero
|
|
|
|
|
f(100) = 10
f(81) = 9
f(64) = 8
f(49) = 7
f(36) = 6
f(25) = 5
f(n) = 0 for all other n values
It is a perfect legal (and admittely beautiful) function. It satisfies all your requirements until you don't specify the 'square root' one.
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
[My articles]
|
|
|
|
General 
News 
Suggestion 
Question 
Bug 
Answer 
Joke 
Praise 
Rant 
Admin 
Submit an article or tip
