In this project you are asked to find K nearest neighbors of all points on a 2D space. The distance metric that you are going to use is simply the Euclidean distance example;
inputs:
10 2
3.57 3.18
84.91 27.69
93.40 4.62
67.87 9.71
75.77 82.35
74.31 69.48
39.22 31.71
65.55 95.02
17.12 3.44
70.60 43.87
Outputs:
1 9 7
2 10 3
3 2 4
4 2 3
5 6 8
6 5 10
7 10 9
8 5 6
9 1 7
10 2 6
Lets say that i have the coordinates of a 2D space (x and y), I want to store the coordinates as x and y in a vector to find the nearest neighbor of given points like i have:
#3.57 3.18#
#84.91 27.69
#93.40 4.62
#67.87 9.71
#75.77 82.35
#74.31 69.48
#39.22 31.71
#65.55 95.02
#17.12 3.44
#70.60 43.87
Each coordinates is like x y and it shows points 1 to 10 (like 3.57 3.18 is point 1 in 2D space ). My question is that how i add all x and y coordinates in vector? I started like this;
`struct point{
int x;
int y;
[Code] ....
I have to do a project where a file with 60 rows and 17 columns is stored in an array. The purpose of the project is to find all the "peaks" and "valleys". A peak is considered a number that has a higher value than all 8 of its neighbors, while a valley is a number that has a lower value than all 8 of its neighbors. Here is an example where peaks are bolded and valleys are underlined.
2558632321342150
3245434041323027
3440383936283035
4045424832342932
3939404247492730
3131313232334435
I'm having trouble coming up with the code that will find values that are higher/lower than all 8 of their neighbors.
Example: In a 2-D space, point A=(a1,a2) is bigger than point B=(b1,b2), if a1>b1 and a2>b2.
How do I write a presudo code to find all the maximal points among the given n points?
I would like a to plot a 3d graph that connects with lines some points in 3d space.
I have tried with qwt3d but the problem is that I cannot add labels to the points. Furthermore i didnt achieve to find a good guide for qwt3d and there are very few qwt3d examples on the web. library for C++ plotting that has those options(3d plot with adding labels in every point (node) option)?
Currently I am working on a program that will find the actual distance between two points on a grid. It also determines the angle of the line segment in degrees. Now, i need it to be able to find any other points on or near the line. It will be running in a loop to find each additional point sequentially until all the points have been plotted. Unfortunately, I am not entirely sure how this is done. So far, I think that I could develop an algorithm that converts the angle into a ratio of vertical movements to horizontal ones.
View 7 Replies View RelatedHow do you find the amount of space in a char array?
View 11 Replies View RelatedI need to find out neighbors of a triangle and loop it over entire unstructured grid. How to do it?. Cell numbers are random so I am unable to loop over all cells.
View 9 Replies View RelatedI'm having trouble with rounding to the nearest cent in this program. It's the only thing that i need. The result i need is just off by one cent. I tried multiplying the interest amount by 100 and adding .5 then dividing all that by 100 but that just made it worse. Here's the code:
Code:
#include <stdio.h>
int main()
{
int count=0;
[Code]....
How do I round to the nearest half integer?
Example;
0 to 0.2 = 0
0.3 to 0.5 = 0.5
0.6-0.9 = 1
What's the formula for C++?
I found a way to do it in math but I want to know what I'd have to put in C++. It's (x*2+.5)remove decimal numbers and divide by 2. What do I put in place of "remove decimal"?
For ex; x = 8.4 using (x*2+.5)remove decimal then divide by 2.
8.4 * 2 = 16.8
16.8 + .5 = 17.3
17.3 - decimal = 17
17/2 = 8.5
I want to do something like;
cout << " Half number: << (x*2+.5)remove decimal/2 << endl;
What would I have to put in place of "remove decimal"?
Rounding a numerical figure up to the nearest hundred. E.G.:
256 >> 300
654 >> 700
15 >> 100
I would like to know the formula to enter into Visual Basic 2008. I'm making a calculator Program, and i need a function that rounds up to the nearest 100...
how I would easily round a double or a float to the nearest cent. It was easy enough to do it in visual basic or java, But i cannot figure out how to do it in C.
View 6 Replies View Relatedi'm working on a robotics project, to move the robot from it's current position to target position i need to calculate the angle first before i can move the robot.this the code I use to calculate the angle:
double cal_angle ( int current_x , int current_y , int tar_x , int tar_y )
{
return atan2(tar_y - current_y, tar_x - current_x);
}
int main ()
[code]....
as u can see the angle between x4,y4 to x1,y1 should be 3.14 (180)however , the result are correct as long as the distance from the current position to target position > 1 (not sure actually).
Write a program that creates the output shown in the Output Layout section below. The program should create 2 points with x and y coordinates as integers, prompt the user to input the x and y values for one of the points and randomly set the other (-99 to 99 range) and output the length of the radius line segment and the area of the circle that radius defines. The program should then end. Include an SDM for the program and any other appropriate documentation.
Special Calculations:
Distance between 2 points equation:
√((p0x – p1x)2 + (p0y – p1y)2) (This requires use of the math library)
Output Layout: (bold text represents user input)
Please enter the location of your first point.
Enter a value from -99 to 99 for your x coordinate: -2
Enter a value from -99 to 99 for your y coordinate: 17
The location of your second randomly set point.
Your x coordinate: 45
Your y coordinate: -89
The length of the radius line segment from point one to point two is 115.
The area of the circle with a radius of 115 is 41546.33.
Other:
int pAx;
int pAy;
int pBx;
int pBy;
I have 2D points written in {x1, y1, x2, y2, x3, y3, .....}
#include <iostream>
#include <vector>
#include <math.h>
#include <algorithm>
using namespace std;
int main() {
vector<double> vec;
vector<double> vec_ordered;
[Code] .....
Result.
6 4
6 3
6 2
6 1
5 5
5 1
4 4
4 1
3 3
3 1
2 2
2 1
1 1
which wrong result
I wanted to make
6 3
6 2
6 1
5 1
4 1
3 1
2 1
1 1
2 2
3 3
4 4
5 5
I am making a game and I am trying to rotate an image so that it is always pointing at the player. I have two lines, the first point of both of them is on the image and the second point of one line is on the last position of the player, and the second point of the other one is on the current position of the player. To rotate the image I need to get the angle between the two lines. how I can get that angle with only the points from the lines?
View 7 Replies View RelatedIt ougth to calculate the distance between two point (p1,p2)
"main.cpp"
#include "distancia.h"
void main () {
Point p1,p2;
[code]....
This is the source code.
--------------------------------------------------------------------------------
#include <iostream>
#include <windows.h>
using namespace std;
int main(){
[Code]....
When I type a word, it gives me the first letter of the word, then a symbol, or nothing.
In the following code I don't understand why am I splitting the y left and y right.
(closest distance between 2 points in 2D)
Am I splitting the y left and y right so that I can concatenate them afterwards and then build the strip,only according to these concatenated halves ?
PS : Finding the min. distance between sorted x right and x left works fine , only problem is with the strip.
#ifndef CLOSESTPAIR_H_
#define CLOSESTPAIR_H_
#include <float.h>
#include <math.h>
typedef struct Point2D {
double x;
double y;
[code].....
I'm implementing a quad tree for an assignment, and I'm not sure if every node should contain a list of pointers to every Point in its sub tree (implying the root node will contain all Points), or if only leaf nodes should contain the Points.
View 4 Replies View RelatedToday i am going find out solution of two ellipses intersection points using C programming, I solved using geometry equation substitute method but i am not unable to do same thing in C programming.I am talking example as following two ellipses (x^2)/4+y^2=1 , ((x-2)^2)/4+y^2=1
View 11 Replies View RelatedAs homework we were assigned to enter the following code to calculate the distance between two points on the x and y plane. The program should ask the user to enter two points then should calculate the distance between two points and print the distance on the screen.
My program will compile correctly but when attempting to run the actual program it doesnt do anything and some how completely skips over my main function...
Code:
#include <stdio.h>
#include <math.h>
struct point {
float x;
float y;
[Code] ....
Any class or library that can to calculate the center and radius of a sphere from 4 known points on its surface?
View 9 Replies View RelatedI have a program that is trying to find all factors of an integer given. It needs to be done in a recursion function. Right now i have code similar to just getting the prime factors of a integer.
unsigned int * find_factors_using_recursion(unsigned int x ) {
unsigned int * factor = new unsigned int[];//do i put x in here ?
for(unsigned int i = 2; i < x; ++i) {
if(x % i == 0) {
find_factors_using_recursion(x / i);
*factor = (factor[i] = i);
} }
return factor;
delete [] factor;
}
When i cout the *factor = (factor[i] = i) it gives me the prime numbers of the integer passed into the function but when I return the pointer it only returns one of the prime numbers. I'm new to c++, how to return pointers from functions that would be great with an example to go with it.
I'm creating a quick program to calculate midpoint and distance between two points. I'm having a little trouble. This is the program:
//This program is a start to solve basic coordinatre plane distances and midpoints
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
using namespace std;
int main(int nNumberofArgs, char* pszArgs[]){
cout << "This is a calculator to find distance and the midpoint between two points. " ;
[Code]...
the problem is that the output for both equations is wrong, it doesn't do the math properly and I assume it has to do with the variable types I'm using but am not sure. P.S. I am using the latest version of DEV-C++
I was wondering if there was a way to set up a code with an array of variable dimensions that removed random points on that array i.e.
1111
1111
1111
then randomly remove a point:
1101
1111
1111
and then be able to repeat this process until all points are removed.