Is there any algorithm for projecting images onto a non-flat surface?
Is there any algorithm for projecting images onto a non-flat (deformed) surface?
It is not deformed too much. It is a really glassy surface covered with high-quality, durable tracing paper. I have a 3-dimensional model of it. How can I texturise it with a projector? 
I want to write a program in C\C++\C# for Windows, which would be able to texturise any surface given by a 3-dimensional model using a projector.
I need an algorithm or open source libraries containing algorithms.
It's not at all clear what algorithm a standard texturing library would use, and it's probably not a true projection, so if accuracy is important, you many need to do this yourself (or do some research into what specific algorithms are being used for a given library).
The basic algorithm is simple. Basically you just need to find where line emanating from your projection point intersect your surface. In more detail:
- Decide on your projection point
- Decide on a bunch of lines emanating from your projection point that will give you resolution you need on your warped surface
- Determine where these lines intersect your surface (the exact method will depend on your surface representation)
- Assume that your flat image is placed somewhere between your projection point and warped surface and find the intersection of the line with the flat surface and assign this value to the location on the warped surface.
On the other hand, if your surface is described mathematically, there may be a simple equation for this, as would be the case, for example, if you were mapping a plane to a sphere.
- Storing revision changes of a message
- Reversing characters of string of parenthesis to achieve at max H string depth
- How do you detect Credit card type based on number?
- Efficiently determine the parity of a permutation
- In MS Access using VBA: I want to transfer records with less than N^2 time complexity
- Longest increasing subsequence
- Using ranking data in Logistic Regression
- How to generated N numbers in array that sum of these numbers is equal to 0
- Delete nodes in singly linked list (two implementations)
- The "guess the number" game for arbitrary rational numbers?
- Max Heap finding kth smallest elements
- Checking if a word in string contains a palindrome
- Generate read-address and write address for zig-zag scan of NxN matrix
- algorithm using recursive function
- graph_to_gdfs not working even with simple examples
- Single Source - Single Destination Shortest Path (DFS + DP) - Time complexity?
- Distribute Coins in Binary Tree
- Quicksort with Python
- Discrete mathematics: Simulate the probability question
- How can I create all combinations of this object's keys/values in JavaScript?
- Why does the xorshift random number generator always seem to use these specific shifts?
- Efficient algorithm for detecting cycles in a directed graph
- How does a 'diff' algorithm work, e.g. in VCDIFF and DiffMerge?
- Find minimum sum from given array
- Javascript twoSum algorithm: Given an array of integers, return indices of the two numbers such that they add up to a specific target
- Split String into smaller Strings by length variable
- Bubble sort does not sort as expected
- Shortening list of numbers with hyphens between consecutive numbers
- Adjacent items in Quicksort's output: Does the algorithm guarantee they have been directly compared?
- The simplest way to write a unit conversion program