I don't have a simple program for you. It's not even a simple problem. Furthermore just considering this a polygon may not be strictly correct since we're concerned with points on a sphere not a plane; if you just consider latitude as "Y" and longitude as "X" your polygon would need curved lines. You'd have to map it into mercator projection or something to get a correct representation. But if a naive solution will do, you could do it in a similar way to how they draw polygons. Please excuse my awful ASCII art:
So you loop through your list of edges left to right, stopping at the segment following it, starting again at the next segment, stopping at the next, etc, etc until you run out of edges, checking if your data point exists between any of the spans you'd be "drawing" in. Note that the order of segments left to right can change depending on the latitude of the data point in question, you have to keep re-sorting the list!
To speed this up you could first check the data points against a bounding box of [min, min]-[max,max] which your polygon fits inside. If it's outside that box you can skip it without the bother of re-sorting your list of edges and trawling them one by one.
Last edited by Corona688; 04-08-2010 at 01:52 PM..
suppose u have a file which consist of many data points separated by asterisk
Question is to extract third part in each line .
0.0002*0.003*-0.93939*0.0202*0.322*0.3332*0.2222*0.22020
0.003*0.3333*0.33322*-0.2220*0.3030*0.2222*0.3331*-0.3030
0.0393*0.3039*-0.03038*0.033*0.4033*0.30384*0.4048... (5 Replies)
Hi Everyone,
I will try to explain my question please forgive my english here.
I am looking for shell script or command that can compare data in the files.
I have 50 files in one directory test1 test2 test3 ....so on.
I want to compare data in each files with each other and output each... (4 Replies)
I am using the fallowing script. this script seems to work fine except the file has data I do not wish to have. Is there away to omit that data. I will first provide the scrip and then a sample of the data the way it looks and then a sample of how I would like the data to look. Thanks for any... (3 Replies)
Hello all,
I have a data file that needs some serious work...I have no idea how to implement the changes that are needed!
The file is a genotypic file with >64,000 columns representing genetic markers, a header line, and >1100 rows that looks like this:
ID 1 2 3 4 ... (7 Replies)
I have a file that has been partially recoded so that data points that were formerly letter combinations are now -1, 0, or 1. I need to finish recoding the GG and CC data points. The file looks like this:
ID 1 2 3 4 5 6 7 8
83845676 0 0 0 0 CC -1 CC CC
838469. -1 -1 1 GG CC 0 CC 1
83847041... (10 Replies)
Hi,
I have a file with one column data (sample below) and I am trying to write a shell script to calculate the difference between consecutive data valuse i.e
Var = Ni -N(i-1)
0.3141
-3.6595
0.9171
5.2001
3.5331
3.7022
-6.1087
-5.1039
-9.8144
1.6516
-2.725
3.982
7.769
8.88 (5 Replies)
Hi, I need help on finding the value of my data that encompasses certain percentage of my total data points (n). Attached is an example of my data, n=30. What I want to do is for instance is find the minimum threshold that still encompasses 60% (n=18), 70% (n=21) and 80% (n=24).
manually to... (4 Replies)
Hi,
I have a large number of data files each containing simple integers from 1 to around 25000 in ascending order. However, they are not in a specific progression; some numbers are missing in each file.
For ex. datfile1 may have the numbers in order 1 2 4 6 7 8 12 ... 24996 24999
while datfile2... (8 Replies)
I have a text file that shows the output of my solar inverters. I want to separate this into sections. overview , device 1 , device 2 , device 3. Each device has different number of lines. but they all have unique starting points. Overview starts with 6 #'s, Devices have 4#'s and their data starts... (6 Replies)
I have a file full of coordinates of the form:
37.68899917602539 58.07500076293945 57.79100036621094
The numbers don't always have the same number of decimal points. I need to reduce the decimal points of all the numbers (there are 128 rows of 3 numbers) to 2.
I have tried to do this... (2 Replies)
Discussion started by: crunchgargoyle
2 Replies
LEARN ABOUT DEBIAN
polygon3d
polygon3d(3alleg4) Allegro manual polygon3d(3alleg4)NAME
polygon3d, polygon3d_f - Draws a 3d polygon onto the specified bitmap. Allegro game programming library.
SYNOPSIS
#include <allegro.h>
void polygon3d(BITMAP *bmp, int type, BITMAP *texture, int vc, V3D *vtx[]);
void polygon3d_f(BITMAP *bmp, int type, BITMAP *texture, int vc, V3D_f *vtx[]);
DESCRIPTION
Draw 3d polygons onto the specified bitmap, using the specified rendering mode. Unlike the regular polygon() function, these routines don't
support concave or self-intersecting shapes, and they can't draw onto mode-X screen bitmaps (if you want to write 3d code in mode-X, draw
onto a memory bitmap and then blit to the screen). The width and height of the texture bitmap must be powers of two, but can be different,
eg. a 64x16 texture is fine, but a 17x3 one is not. The vertex count parameter (vc) should be followed by an array containing the appropri-
ate number of pointers to vertex structures: polygon3d() uses the fixed point V3D structure, while polygon3d_f() uses the floating point
V3D_f structure. These are defined as:
typedef struct V3D
{
fixed x, y, z; - position
fixed u, v; - texture map coordinates
int c; - color
} V3D;
typedef struct V3D_f
{
float x, y, z; - position
float u, v; - texture map coordinates
int c; - color
} V3D_f;
How the vertex data is used depends on the rendering mode:
The `x' and `y' values specify the position of the vertex in 2d screen coordinates.
The `z' value is only required when doing perspective correct texture mapping, and specifies the depth of the point in 3d world coordi-
nates.
The `u' and `v' coordinates are only required when doing texture mapping, and specify a point on the texture plane to be mapped on to this
vertex. The texture plane is an infinite plane with the texture bitmap tiled across it. Each vertex in the polygon has a corresponding
vertex on the texture plane, and the image of the resulting polygon in the texture plane will be mapped on to the polygon on the screen.
We refer to pixels in the texture plane as texels. Each texel is a block, not just a point, and whole numbers for u and v refer to the top-
left corner of a texel. This has a few implications. If you want to draw a rectangular polygon and map a texture sized 32x32 on to it, you
would use the texture coordinates (0,0), (0,32), (32,32) and (32,0), assuming the vertices are specified in anticlockwise order. The tex-
ture will then be mapped perfectly on to the polygon. However, note that when we set u=32, the last column of texels seen on the screen is
the one at u=31, and the same goes for v. This is because the coordinates refer to the top-left corner of the texels. In effect, texture
coordinates at the right and bottom on the texture plane are exclusive.
There is another interesting point here. If you have two polygons side by side sharing two vertices (like the two parts of folded piece of
cardboard), and you want to map a texture across them seamlessly, the values of u and v on the vertices at the join will be the same for
both polygons. For example, if they are both rectangular, one polygon may use (0,0), (0,32), (32,32) and (32,0), and the other may use
(32,0), (32,32), (64,32), (64,0). This would create a seamless join.
Of course you can specify fractional numbers for u and v to indicate a point part-way across a texel. In addition, since the texture plane
is infinite, you can specify larger values than the size of the texture. This can be used to tile the texture several times across the
polygon.
The `c' value specifies the vertex color, and is interpreted differently by various rendering modes. Read the beginning of chapter "Polygon
rendering" for a list of rendering types you can use with this function.
SEE ALSO triangle3d(3alleg4), quad3d(3alleg4), polygon(3alleg4), clip3d(3alleg4), cpu_capabilities(3alleg4), excamera(3alleg4)Allegro version 4.4.2 polygon3d(3alleg4)