Sponsored Content
Top Forums UNIX for Dummies Questions & Answers How to get data only inside polygon created by points which is part of whole data from file? Post 302411845 by reva on Friday 9th of April 2010 02:33:52 PM
Old 04-09-2010
Thanks for the help...
As you said me After looping what should i do..i realy am not getting how to do...
Help me out
i checked out the link You had posted & the function..But I Dont know hoe\w to use that nor perl even little so i cant use that ..So if you can tel me in awk or simpler program i would be much more thankful...I actu got a function which tests if a point is inside polygon or not.But i dont know how to use it in unix..If you can check out & implement it in unix & tell me..
the link is posted below.
HTML Code:
http://local.wasp.uwa.edu.au/~pbourke/geometry/insidepoly/
OR if this is too complicated Please just tel me how to check if a point exist inside or outside a polygon & the to print the points which are inside the polygon.SmilieSmilie
 

10 More Discussions You Might Find Interesting

1. Shell Programming and Scripting

to extarct data points

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)
Discussion started by: cdfd123
5 Replies

2. Shell Programming and Scripting

Comparing data inside file

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)
Discussion started by: email-lalit
4 Replies

3. Shell Programming and Scripting

how to omit data from a file created in a script

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)
Discussion started by: krisarmstrong
3 Replies

4. Shell Programming and Scripting

recoding data points using SED??

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)
Discussion started by: doobedoo
7 Replies

5. Shell Programming and Scripting

Writing an algorithm to recode data points

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)
Discussion started by: doobedoo
10 Replies

6. Shell Programming and Scripting

Calculate difference between consecutive data points in a column from a file

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)
Discussion started by: malandisa
5 Replies

7. UNIX for Dummies Questions & Answers

Finding data value that contains x% of points

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)
Discussion started by: ida1215
4 Replies

8. UNIX for Dummies Questions & Answers

Copying part of a data file into another

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)
Discussion started by: latsyrc
8 Replies

9. Shell Programming and Scripting

Grabbing data between 2 points in text file

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)
Discussion started by: Mikey
6 Replies

10. Shell Programming and Scripting

Reducing the decimal points of numbers (3d coordinates) in a file; how to input data to e.g. Python

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
math::geometry(n)						 Tcl Math Library						 math::geometry(n)

__________________________________________________________________________________________________________________________________________________

NAME
math::geometry - Geometrical computations SYNOPSIS
package require Tcl ?8.3? package require math::geometry ?1.1.2? ::math::geometry::+ point1 point2 ::math::geometry::- point1 point2 ::math::geometry::p x y ::math::geometry::distance point1 point2 ::math::geometry::length point ::math::geometry::s* factor point ::math::geometry::direction angle ::math::geometry::h length ::math::geometry::v length ::math::geometry::between point1 point2 s ::math::geometry::octant point ::math::geometry::rect nw se ::math::geometry::nwse rect ::math::geometry::angle line ::math::geometry::calculateDistanceToLine P line ::math::geometry::calculateDistanceToLineSegment P linesegment ::math::geometry::calculateDistanceToPolyline P polyline ::math::geometry::findClosestPointOnLine P line ::math::geometry::findClosestPointOnLineSegment P linesegment ::math::geometry::findClosestPointOnPolyline P polyline ::math::geometry::lengthOfPolyline polyline ::math::geometry::movePointInDirection P direction dist ::math::geometry::lineSegmentsIntersect linesegment1 linesegment2 ::math::geometry::findLineSegmentIntersection linesegment1 linesegment2 ::math::geometry::findLineIntersection line1 line2 ::math::geometry::polylinesIntersect polyline1 polyline2 ::math::geometry::polylinesBoundingIntersect polyline1 polyline2 granularity ::math::geometry::intervalsOverlap y1 y2 y3 y4 strict ::math::geometry::rectanglesOverlap P1 P2 Q1 Q2 strict ::math::geometry::bbox polyline ::math::geometry::pointInsidePolygon P polyline ::math::geometry::rectangleInsidePolygon P1 P2 polyline ::math::geometry::areaPolygon polygon _________________________________________________________________ DESCRIPTION
The math::geometry package is a collection of functions for computations and manipulations on two-dimensional geometrical objects, such as points, lines and polygons. The geometrical objects are implemented as plain lists of coordinates. For instance a line is defined by a list of four numbers, the x- and y-coordinate of a first point and the x- and y-coordinates of a second point on the line. The various types of object are recognised by the number of coordinate pairs and the context in which they are used: a list of four ele- ments can be regarded as an infinite line, a finite line segment but also as a polyline of one segment and a point set of two points. Currently the following types of objects are distinguished: o point - a list of two coordinates representing the x- and y-coordinates respectively. o line - a list of four coordinates, interpreted as the x- and y-coordinates of two distinct points on the line. o line segment - a list of four coordinates, interpreted as the x- and y-coordinates of the first and the last points on the line seg- ment. o polyline - a list of an even number of coordinates, interpreted as the x- and y-coordinates of an ordered set of points. o polygon - like a polyline, but the implicit assumption is that the polyline is closed (if the first and last points do not coincide, the missing segment is automatically added). o point set - again a list of an even number of coordinates, but the points are regarded without any ordering. PROCEDURES
The package defines the following public procedures: ::math::geometry::+ point1 point2 Compute the sum of the two vectors given as points and return it. The result is a vector as well. ::math::geometry::- point1 point2 Compute the difference (point1 - point2) of the two vectors given as points and return it. The result is a vector as well. ::math::geometry::p x y Construct a point from its coordinates and return it as the result of the command. ::math::geometry::distance point1 point2 Compute the distance between the two points and return it as the result of the command. This is in essence the same as math::geometry::length [math::geomtry::- point1 point2] ::math::geometry::length point Compute the length of the vector and return it as the result of the command. ::math::geometry::s* factor point Scale the vector by the factor and return it as the result of the command. This is a vector as well. ::math::geometry::direction angle Given the angle in degrees this command computes and returns the unit vector pointing into this direction. The vector for angle == 0 points to the right (up), and for angle == 90 up (north). ::math::geometry::h length Returns a horizontal vector on the X-axis of the specified length. Positive lengths point to the right (east). ::math::geometry::v length Returns a vertical vector on the Y-axis of the specified length. Positive lengths point down (south). ::math::geometry::between point1 point2 s Compute the point which is at relative distance s between the two points and return it as the result of the command. A relative dis- tance of 0 returns point1, the distance 1 returns point2. Distances < 0 or > 1 extrapolate along the line between the two point. ::math::geometry::octant point Compute the octant of the circle the point is in and return it as the result of the command. The possible results are [1] east [2] northeast [3] north [4] northwest [5] west [6] southwest [7] south [8] southeast Each octant is the arc of the circle +/- 22.5 degrees from the cardinal direction the octant is named for. ::math::geometry::rect nw se Construct a rectangle from its northwest and southeast corners and return it as the result of the command. ::math::geometry::nwse rect Extract the northwest and southeast corners of the rectangle and return them as the result of the command (a 2-element list contain- ing the points, in the named order). ::math::geometry::angle line Calculate the angle from the positive x-axis to a given line (in two dimensions only). list line Coordinates of the line ::math::geometry::calculateDistanceToLine P line Calculate the distance of point P to the (infinite) line and return the result list P List of two numbers, the coordinates of the point list line List of four numbers, the coordinates of two points on the line ::math::geometry::calculateDistanceToLineSegment P linesegment Calculate the distance of point P to the (finite) line segment and return the result. list P List of two numbers, the coordinates of the point list linesegment List of four numbers, the coordinates of the first and last points of the line segment ::math::geometry::calculateDistanceToPolyline P polyline Calculate the distance of point P to the polyline and return the result. list P List of two numbers, the coordinates of the point list polyline List of numbers, the coordinates of the vertices of the polyline ::math::geometry::findClosestPointOnLine P line Return the point on a line which is closest to a given point. list P List of two numbers, the coordinates of the point list line List of four numbers, the coordinates of two points on the line ::math::geometry::findClosestPointOnLineSegment P linesegment Return the point on a line segment which is closest to a given point. list P List of two numbers, the coordinates of the point list linesegment List of four numbers, the first and last points on the line segment ::math::geometry::findClosestPointOnPolyline P polyline Return the point on a polyline which is closest to a given point. list P List of two numbers, the coordinates of the point list polyline List of numbers, the vertices of the polyline ::math::geometry::lengthOfPolyline polyline Return the length of the polyline (note: it not regarded as a polygon) list polyline List of numbers, the vertices of the polyline ::math::geometry::movePointInDirection P direction dist Move a point over a given distance in a given direction and return the new coordinates (in two dimensions only). list P Coordinates of the point to be moved double direction Direction (in degrees; 0 is to the right, 90 upwards) list dist Distance over which to move the point ::math::geometry::lineSegmentsIntersect linesegment1 linesegment2 Check if two line segments intersect or coincide. Returns 1 if that is the case, 0 otherwise (in two dimensions only). list linesegment1 First line segment list linesegment2 Second line segment ::math::geometry::findLineSegmentIntersection linesegment1 linesegment2 Find the intersection point of two line segments. Return the coordinates or the keywords "coincident" or "none" if the line segments coincide or have no points in common (in two dimensions only). list linesegment1 First line segment list linesegment2 Second line segment ::math::geometry::findLineIntersection line1 line2 Find the intersection point of two (infinite) lines. Return the coordinates or the keywords "coincident" or "none" if the lines coincide or have no points in common (in two dimensions only). list line1 First line list line2 Second line See section References for details on the algorithm and math behind it. ::math::geometry::polylinesIntersect polyline1 polyline2 Check if two polylines intersect or not (in two dimensions only). list polyline1 First polyline list polyline2 Second polyline ::math::geometry::polylinesBoundingIntersect polyline1 polyline2 granularity Check whether two polylines intersect, but reduce the correctness of the result to the given granularity. Use this for faster, but weaker, intersection checking. How it works: Each polyline is split into a number of smaller polylines, consisting of granularity points each. If a pair of those smaller lines' bounding boxes intersect, then this procedure returns 1, otherwise it returns 0. list polyline1 First polyline list polyline2 Second polyline int granularity Number of points in each part (<=1 means check every edge) ::math::geometry::intervalsOverlap y1 y2 y3 y4 strict Check if two intervals overlap. double y1,y2 Begin and end of first interval double y3,y4 Begin and end of second interval logical strict Check for strict or non-strict overlap ::math::geometry::rectanglesOverlap P1 P2 Q1 Q2 strict Check if two rectangles overlap. list P1 upper-left corner of the first rectangle list P2 lower-right corner of the first rectangle list Q1 upper-left corner of the second rectangle list Q2 lower-right corner of the second rectangle list strict choosing strict or non-strict interpretation ::math::geometry::bbox polyline Calculate the bounding box of a polyline. Returns a list of four coordinates: the upper-left and the lower-right corner of the box. list polyline The polyline to be examined ::math::geometry::pointInsidePolygon P polyline Determine if a point is completely inside a polygon. If the point touches the polygon, then the point is not completely inside the polygon. list P Coordinates of the point list polyline The polyline to be examined ::math::geometry::rectangleInsidePolygon P1 P2 polyline Determine if a rectangle is completely inside a polygon. If polygon touches the rectangle, then the rectangle is not complete inside the polygon. list P1 Upper-left corner of the rectangle list P2 Lower-right corner of the rectangle list polygon The polygon in question ::math::geometry::areaPolygon polygon Calculate the area of a polygon. list polygon The polygon in question REFERENCES
[1] Polygon Intersection [http:/wiki.tcl.tk/12070] [2] http://en.wikipedia.org/wiki/Line-line_intersection [3] http://local.wasp.uwa.edu.au/~pbourke/geometry/lineline2d/ BUGS, IDEAS, FEEDBACK This document, and the package it describes, will undoubtedly contain bugs and other problems. Please report such in the category math :: geometry of the Tcllib SF Trackers [http://sourceforge.net/tracker/?group_id=12883]. Please also report any ideas for enhancements you may have for either package and/or documentation. KEYWORDS
angle, distance, line, math, plane geometry, point CATEGORY
Mathematics COPYRIGHT
Copyright (c) 2001 by Ideogramic ApS and other parties Copyright (c) 2004 by Arjen Markus Copyright (c) 2010 by Andreas Kupries Copyright (c) 2010 by Kevin Kenny math 1.1.2 math::geometry(n)
All times are GMT -4. The time now is 07:40 PM.
Unix & Linux Forums Content Copyright 1993-2022. All Rights Reserved.
Privacy Policy