I have been scouting around the net for an algorithm that enables you to create level of detail (LOD) representations of 2D polygons, but am unable to find ANY decent reference. Maybe I am using the w
Given a concave polygon (with no self-intersections), with its nodes in clockwise order, how can we determine all of its inner diagonals (those that are inside the polygon)?
I\'m looking for any algorithm or source code which can find whole or partial simple 3-D shapes (sphere, cylinder, cone, etc) in a 3-D triangulation mesh.
I\'m interested in efficiently keeping track of the center of mass of a large box on the integer lattice from which orthant-shaped regions are repeatedly carved out.I\'ve been poking around in the com
I need an algorithm for calculating the convex hull of a set of points from the Voronoi Diagram of the points in O(n).The Voronoi diagram is contained in a bounding box and is stored as a doubly conne
I have n open geometric lines in 3D. which need to be joined into a single line based upon the criteria开发者_运维技巧 that minimum length of additional lines between the end points of the lines. Plea
i am making a geometry library and i am confused, what should be the return type of a function which calculates the intersection of a segment with another segment. The returned value would sometimes b
Suppose you have a general shape defined by a bunch of coordinate points that form something that looks like a circle, ellipse, or general closed curve - how do you find the a开发者_Python百科rea boun
Hi I know that blind convex hull has o(n^4) but I hav开发者_StackOverflow社区e never seen its code! Is there any site that has its code?
The problem: N poin开发者_如何学Pythonts are given on a 2-dimensional plane. What is the maximum number of points on the same straight line?
加载中,请稍侯......