I have a detailed 2D polygon (representing a geographic area) that is defined by a very large set of vertices. I\'m looking for an algorithm that will simplify and smooth the polygon, (reducing the nu
Hi :) i have the following python code that generates points lying on a sphere\'s surface from math import sin, cos, pi
I am looking for some quick metrics to take to measure the similarity between two sets of points, such as distance between centroids, amount of overlap etc
This qu开发者_如何转开发estion already has an answer here: Closed 11 years ago. Possible Duplicate:
I have a movie clip which has two frames. On the first frame I have the front side and on the second I have the back. I am rotating the MovieClip by rotationX,rotationY,rotationZ properties.
If I have a graph of a reasonable size (e.g. ~100 nodes, ~40 edges coming out of each node) and I want to represent it in R^3 (i.e. map each node to a point in R^3 and draw a straight line between any
There are many algorithms run inO(n {log n}^k)-time, where k>1. It would be very helpful if you could provide me some reference about any problem
I have a set of (X,Y,Z) points representing different planar features. I need to calculate the slope of each plane using normal vectors.
What is the simplest way to test if a point P is inside a convex hull formed by a set of points X? I\'d like an algorithm that works in a high-dimensional space (say, up to 40 dimensions) that doesn
Problem: What is the smallest possible diameter of a circle which covers 开发者_StackOverflow社区given N points on a 2D plane?
加载中,请稍侯......