Solved

Diagonal elements

Posted on 2002-06-14
8
234 Views
Last Modified: 2010-04-02
Hi,

I have to set all the diagonal elements of a 2D matrix to a given value (i.e. zero). This is easy if the matrix is square, but I'm having problems with non-square matrices.

This is what I've tried so far:

int N , M; //Number of rows and columns

float* fData = new float [N * M];

float fValue = 0.0f;




float fSlope  = (float)M / (float)N;



for (register int i = 0; i < M; i++)
{
     
     
     int j = (int) floor( i / fSlope + 0.5);
     
     *fData = fValue;
     
     int nOffset = (int)floor (nCols * slope + 0.5) +1;
     
     fData += nOffset;
     
}

This works fine if the matrix is square but fails in the non-square case

Thanks for your help,
elito
0
Comment
Question by:elito
8 Comments
 
LVL 23

Expert Comment

by:Roshan Davis
ID: 7077882
Please make clear How the selection criteria

Actually, Only square matrix have only diagonal elements.

If you want this is a particular application, so you have a criteria right...

Please mention that...

Roshmon
0
 
LVL 86

Expert Comment

by:jkr
ID: 7078022
As you are allocating the matrix as a linear array, you could just

int N , M; //Number of rows and columns
int size = N * M;
float* fData = new float [size];

float fValue = 0.0f;

for (register int i = 0; i < size; i++) {

 *(fData + i) = fValue;
}

0
 
LVL 1

Expert Comment

by:Pavlik
ID: 7079463
Explain for example what do you want to have in case of 3x4 matrix.

Something like this?
#000
0##0
000#
0
 
LVL 2

Expert Comment

by:LoungeLizard
ID: 7079593
The problem is that a non-square matrix, by definition, does not have a diagonal. The best you can do is an approximation of the diagonal. So first decide how you would estimate this diagonal, let us know, and then we can help you with the code.

Just a question (out of curiosity): Why do you need to do that? I am not aware of any matrix operations/calculations that need that for
0
Is Your Active Directory as Secure as You Think?

More than 75% of all records are compromised because of the loss or theft of a privileged credential. Experts have been exploring Active Directory infrastructure to identify key threats and establish best practices for keeping data safe. Attend this month’s webinar to learn more.

 
LVL 4

Accepted Solution

by:
jos010697 earned 200 total points
ID: 7080307
The projection of two coordinate (x,y) onto a one dimensional array f[N*M] is easy: f[M*y+x]. Your
'diagonal' traversal is equivalent to a raster graphics
line drawing problem, i.e. which pixels to choose when
there is no exact match. Have a look at the Bresenham
line drawing algorithm (google is your friend here).

kind regards
0
 
LVL 49

Expert Comment

by:DanRollins
ID: 7082159
It seems to me that there are many diagonals:
    #00000
    0#0000
    00#000
and
    0#0000
    00#000
    000#00
and
    00#000
    000#00
    0000#0
and
    000#00
    0000#0
    00000#
But I am one of few people I know who enjoy playing tick-tack-toe in a rectagular grid, so please shoot me.

-- Dan

0
 

Author Comment

by:elito
ID: 7082160
sorry for the late response. I tried Bresenham algorithm and yes, that was exactly what I needed.
Thanks for the help,
elito
0
 

Author Comment

by:elito
ID: 7082168
Dan,
I meant the main diagonal of the matrix, the one that connects point (0,0) with point (M, N).
0

Featured Post

Is Your Active Directory as Secure as You Think?

More than 75% of all records are compromised because of the loss or theft of a privileged credential. Experts have been exploring Active Directory infrastructure to identify key threats and establish best practices for keeping data safe. Attend this month’s webinar to learn more.

Question has a verified solution.

If you are experiencing a similar issue, please ask a related question

Written by John Humphreys C++ Threading and the POSIX Library This article will cover the basic information that you need to know in order to make use of the POSIX threading library available for C and C++ on UNIX and most Linux systems.   [s…
This article shows you how to optimize memory allocations in C++ using placement new. Applicable especially to usecases dealing with creation of large number of objects. A brief on problem: Lets take example problem for simplicity: - I have a G…
The goal of the video will be to teach the user the concept of local variables and scope. An example of a locally defined variable will be given as well as an explanation of what scope is in C++. The local variable and concept of scope will be relat…
The viewer will learn additional member functions of the vector class. Specifically, the capacity and swap member functions will be introduced.

867 members asked questions and received personalized solutions in the past 7 days.

Join the community of 500,000 technology professionals and ask your questions.

Join & Ask a Question

Need Help in Real-Time?

Connect with top rated Experts

19 Experts available now in Live!

Get 1:1 Help Now