Rubik's cube scanning algorithm

Question

I'm working on an augmented reality rubik's cube solving project. We want the user to be able to use an smartphone application for collecting hints on to solving a rubiks cube.

For this we need to rebuild the cube in the smartphone memory. We were unable to find scanning algorithms which can rebuild a rubik's cube with only scanning ONE side of the cube.

Does somebody know a rubik's cube scanning algorithm which can do this, or could at least mention if this algorithm could be mathematically possible?

Answer 1

there's no way you can deduce the cubic's position after scanning only one side. most solvers scan all 6 sides, though, you might get away with scanning only 5 of them, but i really doubt it.

in other words, you need only 5 scans to prove the cube is completely solved. not sure if 5 scans give you enough information to recreate the full state for any random cube position.

Answer 2

You might wanna check this for grabing all edges within a scaned pic.

http://www.codeproject.com/Articles/93642/Canny-Edge-Detection-in-C

This is a problem being solved with Hough transformation using matrix.

On the other side, you have to compare those 2 images to detect color of each field.

Answer 3

I don't know what is cube scanning algorithm. But you are talking about algorithm which finds, is cube solved or not?

To check this you need to scan four sides of the cube out of 6( Only for 3 by 3 cube) Even, you have to select 4 side like in manner that remaining 2 side must be beside of each other.( Remaining sides shouldn't be opposite to each other)

As I'm also cuber. And doing cubing since 5 years. I can guarantee you the above scanning is optimal.