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.
- Fastest Method for Find Multiplication Array ( by Minimum Number of Operations)
- Is there a hold value until condition function in numpy?
- Pseudocode for progressing a poker game
- Non-Recursive Merge Sort
- How to determine if a point is in a 2D triangle?
- What's the difference between `git diff --patience` and `git diff --histogram`?
- Is there a Binary Search method in the C standard library?
- Skip List vs. Binary Search Tree
- Binary Search advanced template explain
- Big O Notation for Algorithm
- Which is faster, Hash lookup or Binary search?
- Solving cycle in undirected graph in log space?
- Recursively rearrange a flat array into a multi dimensional array
- How do I iterate over a vector and also know the index of the element?
- How to construct a binary tree from Leetcode values list?
- Why does my A* algorithm expand nodes differently when using heapq vs. a set for the open set?
- Another Pollard Rho Implementation
- Commercial-grade randomization for Poker game
- Are interval, segment, Fenwick trees the same?
- B-Spline derivative using de Boor's algorithm
- How does XOR really works, and what is the magic behind it?
- Digit-increasing number test
- Is there a way to iterate through templated functions/class instances with non-type-template-parameter via std::iota?
- Range within an array in C
- Performance issue in Scala code - O(n log n) faster than O(n)
- Efficient Algorithm for Finding if the Numbers Represented by substrings of a Very Big Digit String are Divisible by 7
- What's a more efficient way to find sum of prime numbers?
- Is there a diff-like algorithm that handles moving block of lines?
- What is the time complexity for PriorityQueue added in .NET 6
- randomInt function that can uniformly handle the full range of MIN and MAX_SAFE_INTEGER