15
votes
How to generate stereo image pair from a stationary mono camera?
You can't. You have video of the scene from a single vantage point. Without depth information, you can't infer what the scene would look like from another vantage point.
D.W.♦
- 156k
14
votes
What is the difference between luma and luminance?
There are actually three related terms:
Luminance is a physical measure which represents the luminous intensity per unit area of light travelling in some direction. The units are candela per square ...
- 21.6k
11
votes
Accepted
What is the difference between a R-tree and a BVH?
Note that we want to be able to retrieve, for any query range, the points that are inside, or sometimes the points that are closest to that query range. That's why a bounding-volume hierarchy is ...
- 1,934
9
votes
How to generate stereo image pair from a stationary mono camera?
The terms you probably want to google for are "inferring depth maps". Just like your brain tricks you into seeing 3d if you close one of your eyes, you can heuristically recover depth maps from single ...
- 5,931
9
votes
Accepted
What's the point of 48 bit colour?
Some reasons for using more bits per color channel:
Tetrachromats. There are rare humans with four types of cone receptors in their retinas instead of the usual three. These people can distinguish ...
- 8,051
7
votes
Accepted
How Is a Computer Able to Store and Quickly Manipulate All the Data Required For A Computer Display?
You're confusing the number of possible values that a pixel can display with the amount of data being shown at any given instance. The number you give is the number of possible pixel states that your ...
- 29.7k
4
votes
Point in Polygon Problem: Has anybody invoked the line integral?
Summing the angles around a point is equivalent to calculating the winding number around that point. It will give you a correct answer in the general case.
Going more in depth, I'll try to show that ...
- 780
4
votes
What's the point of 48 bit colour?
The 10 million you gave - something about that, but we do not know which one exactly because it differs per person.
So there is the case that some range of blue is not fully seen by some person, but ...
- 9,425
4
votes
Algorithm for antialiasing thin lines
You can use Xiaolin Wu algorithm, but the concept is not restricted to straight lines, it handles circles, ellipses, any kind of functions. Moreover this is concept of fast antialiasing, if you need ...
- 9,425
4
votes
Accepted
How curves are represented in a computer
A curve can be quantized (also known as rasterized) to a certain precision after which it is discrete, and the issue is gone. If you see a picture that contains a curve on a modern computer, there's a ...
- 12.7k
4
votes
Detecting if an edge is "inside" a polygon?
If you already have a constrained triangulation, to test if it contains the line segment $(a,b)$, You can do the following:
Find the triangle $(p,q,r)$ that contains $a$. If it does not exist, return ...
- 632
3
votes
Finding all faces in a wireframe mesh
After conducting more research I did find a solution, but first I will examine solutions suggested by posters and considered by myself and review why they didn't work.
...
- 253
3
votes
Accepted
Segmenting a human body point cloud into limbs
Suggestion: for each point $P$ in the point cloud, find which bone it is nearest to, and associate it with that bone. In other words, find which point $Q$ on the skeleton is closest to $P$, and ...
D.W.♦
- 156k
3
votes
An algorithm to find the area of intersection between a convex polygon and a 3D polyhedron?
You have a 2D convex polygon $G$, and a 3D polyhedron $H$. Let $P_G$ denote the plane that the polygon is contained in. The following should work:
Their intersection is a 2D polygon. You can find ...
D.W.♦
- 156k
3
votes
Are there any hash functions/stateless RNGs that do not use XOR, but produce good quality visual randomness?
Found a solution here, as glsl, which at one time had near exactly the same restrictions I wanted:
...
- 141
3
votes
Labeling a limited number of points on the screen
Aggregate your data, the setting is in 2D, the number of points is small for clustering, and it will solve the task.
You can use k-means, where $k$ will denote number of labels shown on the screen. ...
- 9,425
3
votes
Accepted
How to solve a polynomial of the form y = ax^3 + bx^2 + cx + d using the incremental algorithm in computer graphics
You have f(x). Let g(x) = f(x+1) - f(x). Let h(x) = g(x+1) - g(x). Let k(x) = h(x+1) - h(x). It turns out that k(x) is a constant.
Calculate f(x), g(x), h(x) and k(x) for x = 1. Then you calculate f(...
- 28.4k
3
votes
Accepted
Is Phong shading a pixel-first computational model?
I agree that it is a bit superfluous to have the "[i]f a mesh covers more pixels in screen space than it has vertices". Basically, if it doesn't then no interpolation is needed since the color of a ...
3
votes
Accepted
Is z-buffering the same as rasterization?
Z-buffering is easy to implement depth-buffering, where you check whether pixel is visible or not (in case of transparency, it is handled separately). This is optimisation to avoid calculating color ...
- 9,425
3
votes
Accepted
Convert NURBS curve into Cubic Bezier Curve
I assume that your cubic spline is non-rational, meaning $w$ = 1, then this is in general true that exact conversion is not possible. NURBS are rational, so you can model conics, say circle whereas ...
- 9,425
3
votes
Accepted
Complexity of "Fast Poisson Disk Sampling in Arbitrary Dimensions"
I have just implemented this algorithm, generalized for an arbitrary number of dimensions. You are absolutely correct in your suspicions about the exponential growth with $n$, as far as I see.
Each of ...
- 46
3
votes
Accepted
Detecting if an edge is "inside" a polygon?
To find all the edges inside a polygonal constraint inside of a larger constrained triangulation, You can do the following:
Find a single triangle inside the polygonal constraint
Use flood fill to ...
- 632
2
votes
Algorithms to convert 2D videos to 3D ones
Sure, there are many algorithms for this:
Some works, which directly work on H264 domain, such as:
Real-Time 2D to 3D Conversion from H.264
Video Compression, Nir Shabat, Gil Shabat and Amir ...
- 527
2
votes
What is the worst case time complexity for intersection tests with BVHs?
Worst time complexity is $O(n)$: If all triangles are identical the bounding boxes are the same as well and every triangle needs to be intersected.
Btw.: The triangles do not need to be identical for ...
- 141
2
votes
Accepted
Image Comparison tuned to Human Perception
Unfortunately there is not likely to be any good general algorithm for this. Human perception is extremely complex. The best you can do is find algorithms that will sometimes recognize two images as ...
D.W.♦
- 156k
2
votes
How to generate stereo image pair from a stationary mono camera?
You might be able to do some creative hackery by having different color light sources from different directions, and then do some intense processing (don't ask me how) to figure out the shapes of ...
- 121
2
votes
Algorithm for antialiasing thin lines
Not really an answer, but I've had an ongoing similar problem with my gpl'ed program http://www.forkosh.com/mimetex.html and tried several solutions, all of them variations on low-pass filter ...
- 305
2
votes
Hyperplane through origin which goes through most number of points
I suspect your problem might be hard, for the following reason: The corresponding problem when working over a finite field is NP-hard.
Your problem is equivalent to the following:
Inputs: a $M \...
D.W.♦
- 156k
2
votes
Amount of information in scaled-down images
Averaging-and-truncation certainly loses more information. It is not because you are not preserving any specific pixel: it is because you are taking an even probability distribution and giving it a ...
- 1,064
Only top scored, non community-wiki answers of a minimum length are eligible