I have an array of CGPoints (basic struct with two floats: x and y). I want to use OpenGL ES to draw a textured curve using these points. I can do this fine with just two points, but it gets harder when I need to make a line from several points. Currently I draw a line horizontally, calculate its angle from the points given, and then ro...
I need to display a graph with thousands of nodes so that the user can scroll and zoom to view it. The nodes need to behave like dimensionless points, and the edges, like one-dimensional lines. That is, zooming in, the circles representing the nodes move farther apart but each one stays the same size, and the lines connecting them get ...
Hello, I have page with UpdatePanel, ListView, ScriptManager and Navigate event. It shows a list of companies depending on the country selected. I've added HistoryPoint with the selected country. When I try to load this page with history point in new browser window (i.e. country/browse.aspx#&&location=1) Page Load event fires before...
Hi all, I think I may have stumbled onto a limitation of Flot, but I'm not sure. I'm trying to represent a single data series over time. The items' "State" is represented on the Y-Axis (there are 5 of them), and time is on the X-Axis (items can change states over time). I want the graph to have points and lines connecting those points f...
The standard DLL entry point is called DllMain. The second param is DWORD ul_reason_for_call. I have looked up on the MSDN to find all the values this can have, the following are obvious: DLL_PROCESS_ATTACH: DLL_THREAD_ATTACH: DLL_THREAD_DETACH: DLL_PROCESS_DETACH: But what about : DLL_PROCESS_VERIFIER When will the entry point be...
So lets say I have 10,000 points in A and 10,000 points in B and want to find out the closest point in A for every B point. Currently, I simply loop through every point in B and A to find which one is closest in distance. ie. B = [(.5, 1, 1), (1, .1, 1), (1, 1, .2)] A = [(1, 1, .3), (1, 0, 1), (.4, 1, 1)] C = {} for bp in B: closest...
Hi everyone, I have a function that takes longitude and latitude and converts it to x and y to be plotted. The conversion to X and Y is working fine and that is not what I have the problem with. I want to ensure that two points are not plotted in the same place. In one set of results there are about 30 on top of each other (because the...
Good morning. I would like to know how do I add kilometers to a map point (latitude / longitude). For example: The city Jaraguá do Sul is in latitude -26.462049, longitude -49.059448. I want to add 100 kilometers up, down, and on the sides. I want to do a square and get the new points. How do I do that? I tried it: <?php $distance =...
In Python, how would one find all integer points common to two circles? For example, imagine a Venn diagram-like intersection of two (equally sized) circles, with center-points (x1,y1) and (x2,y2) and radii r1=r2. Additionally, we already know the two points of intersection of the circles are (xi1,yi1) and (xi2,yi2). How would one gene...
Hi, A friend to me made a flash game for my website. The game makes a request to /game/p00ints.php with the points in $_POST['points']. But, a hacker can easy find out how to get more points I guess, so, how can my friend or I fix this security hole? Best regards, Erik Persson ...
I need to list the service connection points on various windows servers. Ex. When I set up Kerberos for Sql Serve Analysis Services, the documentation says to use: Setspn.exe -S MSOLAPSvc.3/Fully_Qualified_domainName OLAP_Service_Startup_Account Apparently, however, Sql 2008 R2 may have incremented the MSOLAPSvc.3 to MSOLAPSvc.4, wh...
I am trying to sort a List of 2D Points first by x co-ordinate and then by y co-ordinate. I implemented the IComparer interface as follows: class PointComparer : IComparer<Point> { public int Compare(Point x, Point y) { if (x.Y != y.Y) { return x.Y - y.Y; } else { r...
Hi All I've heard and read that Google's Ranking System is like a points system, and that certain things such as Backlinks, properly-formatted html and many other things are each worth a certain amount of points. Can somebody please provide some sources on this? I have Google'd for this, but just came across a whole bunch of... nothing...
Hi, I'm trying to compute clusters on a set of points in Python, using GeoDjango. The problem: Given a set of points, output a set of clusters of those points. (i'm fine specifying # of clusters/cluster size/distance in advance to simplify) There are a few solutions on the web to do clustering, so it's a well known problem. I thought ...
In my application I need to check a collection of 2D coordinates (x,y) to see if a given coordinate is in the collection, it needs to be as fast as possible and it will only be accessed from one thread. ( It's for collision checking ) Can someone give me a push in the right direction? ...
How can I do this on a grid with several "centers", and therefore, having coincident points that I want to count only once? What is the most efficient way to do this? ...
Hi, I need to paint the line which links two points. I am doing it, in Java. I receive two points as parameters and I have to calculate if the straight line between them, is inside the black figure. I developed my own solution using the straight line equation, but my results are different than using the "professional" programs (such a...
Hey I am currently reading in a XML file which contains bullet list in the following container i.e. the average pension contribution rate for executive directors . I am having a problem with symbol directly before the text of each bullet point I want to remove it i.e Replace(text,"old","new") but i cant seem to find what value that b...
Let's imagine we have a plane with some points on it. We also have a circle of given radius. I need an algorithm that determines such position of the circle that it covers maximal possible amount of points. If there are many such positions, the algorithm should return one of them. Precision is not important and algorithm may do small mi...
I have few Cartesian points of the form : (x,y) where x and y both are non-negative integers. For e.g. (0,0) , (1,1), (0,1) I need an algorithm to arrange the above points in such a way that going from one point to other changes either x or y by 1. In other words, I would like to avoid diagonal movement. So, the above mentione...