Description:
Algorithms used in producing computer graphics.
|
|
|
How to create solid version of model?
|
| |
...This is not a OpenGL related question. OpenGL just renders what you send to it, and that are flat finite primitives. However what you want to do is perfectly possible, but it's not "easy", and especially with triangulated meshes the process is hard to get robust, if you want to clip a mesh against... more »
|
|
|
Movie example of the use of B-spline or NURBS?
|
| |
Does anyone know some links to some cool creatures/objects/cars/airplan es made with B-spline or NURBS with a description on how they were applied? I have only been able to find a few pictures of T-1000000 TMeg from T2 3-D:Battle Across Time: [link] with this description:... more »
|
|
|
Blue sky problem with image based lighting
|
| |
I'm using image based lighting with spherical harmonics, produced from cubemap hdr images. However there is a big problem with my implementation: Outdoor images with blue sky cause top of the lighted object become blueish. The same problem with indoor cubemaps - color of the wall transfer to the object. We don't see any top-blue humans... more »
|
|
|
Blending Glyph Pixels???
|
| |
For the kind of sub pixel positioning that PDF and Apple OS X uses, how are overlapping glyph pixels blended together?
|
|
|
Traversing Doubly Linked N-Tree
|
| |
Hi, I am trying to traverse a doubly linked n-tree, where n is 4. One node has 4 neighbors say East, West, South and North, they are doubly linked. For e.g. one node's east linked node has information that its west link is the former. I need to traverse this tree by visiting each node only once. How will the algorithm for this look like? For my... more »
|
|
|
smooth surface approximation from unordered (x,y,z)
|
| |
I'm looking for a method to fit a smooth surface to a point cloud from a terrestrial laser scanner. The surface will be defined on regular (xi, yi) mesh. Usually the resolution of the grid will be coarser that the local density of points, except the no-data regions (holes). The surface need not go through the points, but in a piecewise local least-... more »
|
|
|
Contour Plot algorithm for curved contours
|
| |
I have been working on plotting contours for a set of 2d points with z- values. After some research here and on the web, I started with a Delaunay triangulation where the known points made up the vertices of each triangle. Using basic linear interpolation I divided each triangle into polygons for each of the contour lines that crossed the... more »
|
|
|
paint program
|
| |
If you are creating a Java paint program like Photoshop, is it smarter to represent the canvas as TYPE_INT_ARGB or TYPE_INT_ARGB_PRE (pre-multiplied alphas)? The program should be able to handle transparent and semi-transparent images correctly. Thanks.
|
|
|
Job: Software Engineer (3D Image Acquisition and Processing, OCR, OMR)
|
| |
Are you that one-in-a-million candidate with the unique technical expertise in Optical Character Recognition (OCR), Machine Vision, Marking Identification, Object/Pattern Recognition, 3D Image Acquisition and Processing, or 3D Surface Reconstruction? Do you have that burning desire to perform product-oriented R&D? Do you possess... more »
|
|
|
