I have the following function which plots a Circle given the centroid, but I want the coordinates to be In WGS84. var coords = new List<Tuple<double, double>>(); const double EARTH_RAD...

I'm searching for an algorithm for path simplification and smoothing for 2D trajectories. So I have a ordered list of 2D points. These points should be simplified, e.g. with the Ramer–Douglas–Peuck...

Standard convex hull algorithms will not work with (longitude, latitude)-points, because standard algorithms assume you want the hull of a set of Cartesian points. Latitude-longitude points are not...

Imagine you are given set S of n points in 3 dimensions. Distance between any 2 points is simple Euclidean distance. You want to chose subset Q of k points from this set such that they are farthest...

I am reading a TiledExr file as follows using C++ and OpenEXR std::vector<double> TiledExrDepthMapExtractor::extractDepthMap(const char* filePath, int& width, int& height, ProgressF...

I have number of simple polygons which do not intersect each other but some polygons may be embedded into others. For example: +--------------------------------------------+ | | | +--------------...

Is there any algorithm that can approximate the given polygon with n non overlapping rectangles that gives the maximum coverage? By maximum coverage I mean, the sum of the rectangle areas are maxim...

Dear fellow stackoverflow users, I face a problem as follows: I would like to fit a 3D ellipsoid to 3D data points within my python script. The starting data are a set of x, y and z coordinates (ca...

I would like to determine a polygon and implement an algorithm which would check if a point is inside or outside the polygon. Does anyone know if there is any example available of any similar algo...

I am trying to find the destination point, given a starting point lat/long, bearing & distance. The calculator from this website below gives me the desired results. http://www.movable-type.co....

Given a list rectangles [R1, R2, R3] defined by their lower left and upper right [(x1, y1), (x2, y2)] coordinates, and a value k. Is there an optimal way to find area where k rectangles overlap? ...

I have: - a set of points of known size (in my case, only 6 points) - a line characterized by x = s + t * r, where x, s and r are 3D vectors I need to find the point closest to the given line. T...

I would like an algorithm to calculate the convex hull of 4 2D points. I have looked at the algorithms for the generalized problem, but I wonder if there is a simple solution for 4 points.

I'm using the centroid of polygons to attach a marker in a map application. This works definitely fine for convex polygons and quite good for many concave polygons. However, some polygons (banana,...

I'm trying to find a more efficient way of determining which hexagon a point belongs to from the following: an array of points - for the sake of argument, 10000 points. an array of center points ...

So you have a sheet / area of a given dimension, and within this area are holes (their center point(x,y) and radius are given). The problem is you need to cover these holes with patches. These circ...

I'm trying to understand the algorithm that can be used to calculate the area of the union of a set of axis aligned rectangles. The solution that I'm following is here : http://tryalgo.org/en/geom...

I am new in python. I have two vectors in 3d space, and I want to know the angle between two I tried: vec1=[x1,y1,z1] vec2=[x2,y2,z2] angle=np.arccos(np.dot(vec1,vec2)/(np.linalg.norm(vec1)*np....

This looks like a repeated question but I tried the solution that already exists and none seems to work so far for me. . this solution gives a hint but it works only for a regular geometry. I have...

I have a problem in which I have to test whether the union of given set of rectangles forms a rectangle or not. I don't have much experience solving computational geometry problems. What my approac...

Given two 3d objects, how can I find if one fits inside the second (and find the location of the object in the container). The object should be translated and rotated to fit the container - but no...

I'm looking for an algorithm or data structure to solve the following problem: You are given a set of points S. And you are given Q queries in form of another point. For every query, find the farth...

There is an algorithm for triangulating a polygon in linear time due to Chazelle (1991), but, AFAIK, there aren't any standard implementations of his algorithm in general mathematical software libr...

I am using the Voronoi diagram-based approach outlined here to find midlines of binary masks of root images. I am using the Python code more or less exactly as described: import skimage.morphology...

I am extracting image features from 10 classes with 1000 images each. Since there are 50 features that I can extract, I am thinking of finding the best feature combination to use here. Training, va...