I am interested in finding software to compute the exact medial axis (or your term of choice!) of a 3D polyhedra.I imagine the output would be a list of triangular faces, possibly edges, and vertices,
I\'m hoping for the equivalent of CGAL (in C++)--I want convex partitioning of poly开发者_运维技巧gons or at least triangulation. It also has to be free. A previous question suggested JTS, but it does
I have a quaternion camera written in C# (shamelessly taken from an online tutorial). I\'m trying to translate the position of the camera in world space, which is represented as a Vector3, in the dire
You are given a set U开发者_开发百科 of n points on the plane and you can compute distance between any pair of points in constant time. Choose a subset of U called C such that C has exactly k points i
I seek for a method/algorithm for uniform sampling of the surface of 3D models in C++. I have found methods for uniform sampling of unit sphere such as
I have a constraint delaunay triangulation (CDT) algorithm, and I have a polygon ( it could be concave or convex) as input. How can I use that constraint delaunay triangulation algorithm to break the
As an extension and partial answer to my thread I wrote a simple algorithm that given a set of points(with xy coordinates) can form a non self-intersecting polygon.
Given a convex polygon as a counter-clockwise list of n vertices, give O(lgn) algorithm to determine if a given point is inside the polygon. Assume the basic operations take O(1).
I have a few planes (3-10 of them) in 3d defined by their equations (three coefficients and the offset). These planes are the edges of a convex polyhedron. I need to draw that polyhedron. How can I do
I am creating a 2D sprite game in Unity, which is a 3D game development environment. I have constrained all translation of objects to the XY-plane and rotation to the Z-axis.
加载中,请稍侯......