I\'m trying to use GLUtesselator to produce 3D extruded text in OpenGL. Here is the relevant code: private boolean createText(final String displayText)
I am using the gluTess* functions to draw non-convex polygons. To avoid redoing the tesselation at every step, I store the result in an array and use the vertex array capabilities of OpenGL to draw.
I have data in the form (x, y, z) where x and y are not on a regular grid. I wish to display a 2D colormap of these data, with intensity (say, grey scale) mapped to the z variable. An obvious solution
I am working on a piece of software which generated a polygon mesh to represent a sphere, and I want to cut a hole through the sphere. This polygon mesh is only an overlay across the surface of the sp
I\'m looking for a packing algorithm which will reduce a regular polygon into re开发者_StackOverflow社区ctangles and right triangles. The algorithm should attempt to use as few such shapes as possible
I\'m working on a spatial stacking problem... at the moment I\'m trying to solve in 2D but will eventually have to make this work in 3D.
I need to fill an arbitrary polygon using a near-uniform tiling of triangles. How would I do this? You may provide either references to existing algorithms or even simply ideas or hints of your own.
I 开发者_JAVA百科wanted to create TINs from 3D points (about 7 million in every file) using qhull.
加载中,请稍侯......