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.'s user avatar
  • 159k
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 ...
Pseudonym's user avatar
  • 22.1k
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 ...
orezvani's user avatar
  • 1,944
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 ...
adrianN's user avatar
  • 5,951
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 ...
Kyle Jones's user avatar
  • 8,091
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 ...
Joey Eremondi's user avatar
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 ...
Evil's user avatar
  • 9,455
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 ...
ZeroUltimax's user avatar
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 ...
Evil's user avatar
  • 9,455
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 ...
orlp's user avatar
  • 13.4k
4 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 ...
Evil's user avatar
  • 9,455
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 ...
DirkT's user avatar
  • 991
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: ...
lahwran's user avatar
  • 141
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.'s user avatar
  • 159k
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. ...
Evil's user avatar
  • 9,455
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. ...
hgs3's user avatar
  • 253
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(...
gnasher729's user avatar
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 ...
Derek Elkins left SE's user avatar
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 ...
Evil's user avatar
  • 9,455
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 ...
Dinergoblin's user avatar
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 ...
DirkT's user avatar
  • 991
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 ...
Tolga Birdal's user avatar
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 ...
Steohan's user avatar
  • 141
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 ...
Peter's user avatar
  • 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 ...
John Forkosh's user avatar
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.'s user avatar
  • 159k
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 ...
Martin Kochanski's user avatar
2 votes
Accepted

How can I efficiently plot the inside of an ellipse?

Following @Evil's comment, I suggest two steps. For each ellipse $E$: (1) Computing a bounding box $B$ for $E$. (2) For each row of pixels in $B$, walk left-to-right until a pixel $p_1$ is ...
Joseph O'Rourke's user avatar
2 votes
Accepted

compute a gradient with "minimal" colorstops from a ordered set of RGB colors

What you want to do is fit a piecewise linear function to your data. No noise If the data is perfect and has no noise, this is easy: Form a line from the first points. Remember those two points as ...
D.W.'s user avatar
  • 159k
2 votes

Are there any hash functions/stateless RNGs that do not use XOR, but produce good quality visual randomness?

Low-discrepancy sequences might do what you want. Depending on what you want, they might be more useful than pseudo-random sequences. If you need more than one dimension, Halton sequences are popular. ...
Pseudonym's user avatar
  • 22.1k

Only top scored, non community-wiki answers of a minimum length are eligible