computational-geometry
Find biggest possible polygon of group of points
How to find the biggest possible polygon of a group of points? E.g. the following points are given: 0 | 3[详细]
2023-02-07 23:11 分类：问答Find the projection of a vector on the icosahedron or on its unfolded surface
Consider a sphere with center in coordinates\' origin, and an inscribed icosahedron, oriented such that the two most distant vertices lay on Z coordinate axis, and one of the edges emerging from any o[详细]
2023-02-07 07:19 分类：问答How to triangulate a polygon without random inner points?
I would like to create triangles a predefined polygon. My requirement is that I don\'t want to create random points inside of this polygon for processing it with a Delaunay Triangulation algorithm.[详细]
2023-02-05 22:47 分类：问答Optimizing spacing of mesh containing a given set of points
I tried to summarize the this as best as possible in the title. I am writing an initial value problem solver in the most general way possible. I start with an arbitrary number of initial values at arb[详细]
2023-02-04 18:06 分类：问答How to take (N)-simplex edges?
In quickhull algo, there\'s need to build a cone upon set of edges. An edge is thought as subsimplex with one vertex removed.[详细]
2023-02-04 08:22 分类：问答Detecting arbitrary shapes
Greetings, We have a set of points which represent an intersection of a 3d body and a horizontal plane. We would like to detect the 2D shapes that represent the cross sections of the body. There can[详细]
2023-02-03 22:39 分类：问答How can I determine the width of the visible side of a 3d box from a centered fixed distance camera?
I have a 2.5d viewport wherein I am trying to express a visualization of the depth of a box with 45 degree 2D lines inwards as if it had no front and you were staring inside from a central point, like[详细]
2023-02-02 18:54 分类：问答3d width and cross-sections
Greetings, We have a horn-shaped 3d body, which is represented as a list of vertices and faces. Each face is a triangle represented by 3 vertices. The body is positioned along the Z-axis (height). We[详细]
2023-02-01 18:59 分类：问答Construct polygons out of union of many polygons
Supposed that I have many polygons, what is 开发者_JAVA技巧the best algorithm to construct a polygon--maybe with holes- out of the union of all those polygons?[详细]
2023-01-31 21:41 分类：问答Asymptotically optimal algorithm to compute if a line intersects a convex polygon
An O(n) algorithm to detect if a line intersects a convex polygon consists in checking if any edge of the polygon开发者_运维问答 intersects the line, and look if the number of intersections is odd or[详细]
2023-01-31 19:24 分类：问答
![Interactive visualization of a graph in python [closed]](https://www.devze.com/res/2023/04-10/09/92d32fe8c0d22fb96bd6f6e8b7d1f457.gif)
加载中,请稍侯......