computational-geometry

相关标签：javascript jquery android 多少钱 iPhone

Finding the area of a 2-D data set

I have a .txt file with about 100,000 points in the 2-D plane.When I plot the points, there is a clearly defined 2-D region (think of a 2-D disc that has been morphed a bit).[详细]

2023-03-26 06:00 分类：问答
Rotating caliper in Haskell

I am trying to implement rotating calipers in Haskell from Wikipedia . The only difference with Wikipedia is ,i am calculating square of maximum width of convex polygon rather than minimum width to te[详细]

2023-03-26 05:44 分类：问答
shortest paths & geodesics

given a mesh made entirely of quads, where every vertex has valence n (with n >= 3), and does not lie on the same plane, I need to find the distance of every vertex in the 开发者_JAVA技巧mesh from a c[详细]

2023-03-26 00:18 分类：问答
Is there an efficient algorithm to generate random points in general position in the plane?

I need to generate n random points in general position in the plane, i.e. no three points can lie on a same line. Points should have coordinates that are integers and lie inside a fixed square m x m[详细]

2023-03-25 03:47 分类：问答
Error creating geography element using "STGeomFromText( 'LINESTRING(..." - SQL 2008

I am getting the following error when trying to create geography elements in sql 2008: NET Framework error occurred during execution of user-defined routine[详细]

2023-03-24 17:51 分类：问答
parallel convex hull algorithm in gpu

I am implementing a divide and conquer approach to convex hull in CUDA. This is my approach: Bottom up:[详细]

2023-03-24 04:20 分类：问答
Calculating surface fragments (continents) on an expanding sphere (Earth)

Let\'s suppose plate tectonics is wrong and our planet Earth has expanded over time, the continents being the remnants of a crust that once covered the entire surface of a smaller planet, the oceans f[详细]

2023-03-22 13:37 分类：问答
GPU-friendly 2D line segment intersection algorithm

I\'m looking for an algorithm that tests whether 2 line segments are intersecting in a GPU-friendly way.The line segments are in 2D.While there are many algorithms discussed on the web for doing this,[详细]

2023-03-22 05:40 分类：问答
How to detect if a polygon has self-intersections?

Imagine you have a 2D polygon (a 2D closed polygonal chain to be more precise). How do you check if it contains self-intersections? It can be convex or concave, oriented clockwise or counter-clockwise[详细]

2023-03-22 04:31 分类：问答
efficient algorithm to find nearest point in a graph that does not have a known equation

I\'m asking this questions out of curiostity, since my quick and dirty implementation seems to be good enough.However I\'m curious what a better implementation would be.[详细]

2023-03-22 01:49 分类：问答