Click here to Skip to main content
15,563,228 members

Articles by YvesDaoust (Articles: 2, Tip/Tricks: 10)

Articles: 2, Tip/Tricks: 10

RSS Feed

Average article rating: 4.92

Programming Languages
C++
21 Apr 2012   Updated: 23 Apr 2012   Rating: 4.91/5    Votes: 13   Popularity: 5.47
Licence: CPOL    Views: 25,383     Bookmarked: 27   Downloaded: 0
Please Sign up or sign in to vote.
We study the problem of computing R cos(a + k b) and R sin(a + k b) for increasing k
Visual Basic
26 Oct 2013   Updated: 26 Oct 2013   Rating: 4.93/5    Votes: 10   Popularity: 4.93
Licence: CPOL    Views: 37,828     Bookmarked: 10   Downloaded: 1,700
Please Sign up or sign in to vote.
Short study of the perspective projection of a rectangle in space; homography opposed to bilinear transform

Average blogs rating:

No blogs have been submitted.

Average tips rating: 4.27

General Programming
Algorithms
23 Dec 2013   Updated: 24 Dec 2013   Rating: 4.64/5    Votes: 7   Popularity: 3.92
Licence: CPOL    Views: 44,599     Bookmarked: 11   Downloaded: 0
Please Sign up or sign in to vote.
Yet another home-made implementation of the floor function
Programming Languages
C
9 Aug 2011   Updated: 9 Aug 2011   Rating: 5.00/5    Votes: 1   Popularity: 0.00
Licence: CPOL    Views: 10,320     Bookmarked: 0   Downloaded: 0
Please Sign up or sign in to vote.
What about this, using SSE2 assembly (32 bits):void Zero(void* Buffer, int Count){ char* Cur= (char*)Buffer; char* End= (char*)Buffer + Count; // Clear the initial unaligned bytes while (Cur < End && (Cur - (char*)0) & 0xf) { *Cur++= 0; } // Clear...
C#
16 May 2011   Updated: 16 May 2011   Rating: 0.00/5    Votes: 0   Popularity: 0.00
Licence: CPOL    Views: 4,090     Bookmarked: 0   Downloaded: 0
Please Sign up or sign in to vote.
// A faster solutionreturn (value & mask) == 0;// Where mask == ~ (None | One | Eight)// This constant can be precomputed at compile-time or run-time (like in Alternate 1)
13 Dec 2011   Updated: 13 Dec 2011   Rating: 1.80/5    Votes: 2   Popularity: 0.54
Licence: CPOL    Views: 6,860     Bookmarked: 0   Downloaded: 0
Please Sign up or sign in to vote.
array= new int[4][] { new int[] { 5, 1, 0, 0, 0 }, new int[] { 6, 2, 0, 1, 0 }, new int[] { 7, 3, 0, 0, 0 }, new int[] { 0, 4, 0, 0, 0 },};1341 keystrokes spared.
13 Dec 2011   Updated: 13 Dec 2011   Rating: 5.00/5    Votes: 1   Popularity: 0.00
Licence: CPOL    Views: 7,050     Bookmarked: 0   Downloaded: 0
Please Sign up or sign in to vote.
http://msdn.microsoft.com/en-us/library/h5e7chcf.aspx[^]
17 Jan 2012   Updated: 17 Jan 2012   Rating: 0.00/5    Votes: 0   Popularity: 0.00
Licence: CPOL    Views: 13,250     Bookmarked: 1   Downloaded: 0
Please Sign up or sign in to vote.
You shouldn't rely on methods from the .NET classes (Bitmap::SetPixel, Bitmap::GetPixel, Color::FromArgb) in the inner loop as these are called intensively, million times per image, and their implementation are opaque to you.If their implementation is opaque to the compiler too, no code...
17 Jan 2012   Updated: 17 Jan 2012   Rating: 5.00/5    Votes: 1   Popularity: 0.00
Licence: CPOL    Views: 8,920     Bookmarked: 2   Downloaded: 0
Please Sign up or sign in to vote.
You should be delighted by the CORDIC approach to elementary functions computation.http://drdobbs.com/184404244[^]log10(x){ z = 0; for ( i=1; i= 1) x = x - x*2^(-i); z = z - log10(1-2^(-i)); else x = x + x*2^(-i); ...
18 Jan 2012   Updated: 18 Jan 2012   Rating: 0.00/5    Votes: 0   Popularity: 0.00
Licence: CPOL    Views: 7,260     Bookmarked: 1   Downloaded: 0
Please Sign up or sign in to vote.
A piece of warning, though: the LockBits method is not a transparent one, it does image format conversion before returning a pointer to the bitmap (this is why it has a PixelFormat argument). And conversely, the UnlockBits method converts back to the original format. My best guess is that when...
C++
9 Nov 2010   Updated: 9 Nov 2010   Rating: 4.00/5    Votes: 1   Popularity: 0.00
Licence: CPOL    Views: 6,350     Bookmarked: 2   Downloaded: 0
Please Sign up or sign in to vote.
// Real solutions of the quadratic equation A x^2 + B x + C = 0// Returns two roots (possibly identical) in increasing order, or nonebool Quadratic(double A, double B, double C, double R[2]){ if (A == 0) { // Linear, impossible or degenerate, cannot find two roots ...
Python
2 Jul 2014   Updated: 2 Jul 2014   Rating: 4.47/5    Votes: 5   Popularity: 3.12
Licence: CPOL    Views: 16,752     Bookmarked: 6   Downloaded: 2
Please Sign up or sign in to vote.
Computation of the Faulhaber polynomials coefficients

Average reference rating:

No reference articles have been posted.

Average project rating:

No projects have been posted.
CEO VISION fOr VISION
Belgium Belgium
I fell into applied algorithmics at the age of 16 or so. This eventually brought me to develop machine vision software as a professional. This is Dreamland for algorithm lovers.