I have two sets of points - say A and B and both are the same size. I triangulate each of these sets using Delaunay triangulation in OpenCV with Subdiv2D class. The points in each set represent facial features of each face and I'm trying to sample texture within each triangle from set A and warp it to corresponding triangle from set B. Effectively, this would give me a kind of morphing one facial expression into another effect (just by warping the textures). Unfortunately, it turns out, that when I call getTriangleList method for set A and then for set B, triangle A_i does not correspond to triangle B_i. In other words, the triangle order is not the same as the order at which the points were added to each of the sets. I actually made a very simple test and I created set B as a copy of A and added constant value to x coordinate of each point in B, effectively shifting each point in B to the right. After triangulation, the order was broken again. Is there any way to keep track on which triangle is which? Without that, I am unable to properly warp from one shape to anohter (unless there's some other way to do that)
Matching results of Delaunay triangulation in OpenCV
1.1k Views Asked by Max Walczak At
1
There are 1 best solutions below
Related Questions in OPENCV
- segmentation fault: 11, extracting data in vector
- Disable OpenCL in OpenCV completely
- Python - Writing your own function with opencv giving an error
- Opengl Augmented Reality in Android from solvepnp
- OpenCv Multispectral Image openCV
- Displaying bitmap image on Android (OpenCV)
- Applying homography on non planar surface
- BackgroundSubtractor getBackgroundImage() function return empty Image
- How to choose good SURF feature keypoints?
- opencv python error: Assertion failed (size.width>0 && size.height>0)
- CIDetector to filter rectangle and get cropped image
- How to detect squares in video with OpenCV?
- Python OpenCV error: (-215) size.width>0 && size.height>0 in function imshow
- OpenCV algorithm of contours searching and creation of bounding rectagle
- OpenCV Opening/Closing shifts the positions of the pixels
Related Questions in TRIANGULATION
- Delaunay triangles point connectivity?
- Integrating Velocity Over a Complex 2-D Surface
- What is the best initial shape for 3D Delaunay incremental algorithm?
- Correct use of polygon triangulators in LibGDX
- Drawing filled polygon with libGDX's earclippingtriangulator and PolygonSpriteBatch
- Matching results of Delaunay triangulation in OpenCV
- Increasing mesh details (additional tesselation)
- How do I access the original point in periodic 2 D Triangulation in CGAL?
- How to generate a triangulation for FEM 1D - MATLAB?
- Triangulating a planar 2D concave polygon in 3d space - Help checking concavity?
- Delaunay triangulation
- How do you pin point the location of a user with 3 nodes, using Triangulation?
- Triangulates all objects in Autocad
- Creat mesh from point cloud on a 2D grid
- How to convert binary tree to polygon triangulation and vice versa
Related Questions in DELAUNAY
- Bowyer-Watson algorithm: how to fill "holes" left by removing triangles with super triangle vertices
- What is the best initial shape for 3D Delaunay incremental algorithm?
- How to include all points into error-less triangulation mesh with scipy.spatial.Delaunay?
- Matching results of Delaunay triangulation in OpenCV
- python matplotlib plot_trisurf polygon data
- Euclidean Minimal Spanning Tree and Delaunay Triangulation
- How can I obtain Voronoi diagram on a Red Blood Cell using XYZ coordinate of points and face connectivity data from Delaunay triangulation?
- Randomly Incremental Approach for Delaunay Triangulation degenerated case 4 don't behave properly
- bad triangles in triangulation of CGAL
- what do I get from scipy.spatial.Delaunay.convex_hull
- Does the Delaunay triangulation contain all triangles with empty circumcircle?
- How to generate delaunay by some 3D coplanar vertices By CGAL
- Mesh generation from points with x, y and z coordinates
- Finding near neighbors
- how can i do delaunay triangulation of simple polygon and find it's neighbors for any triangles in cgal
Trending Questions
- UIImageView Frame Doesn't Reflect Constraints
- Is it possible to use adb commands to click on a view by finding its ID?
- How to create a new web character symbol recognizable by html/javascript?
- Why isn't my CSS3 animation smooth in Google Chrome (but very smooth on other browsers)?
- Heap Gives Page Fault
- Connect ffmpeg to Visual Studio 2008
- Both Object- and ValueAnimator jumps when Duration is set above API LvL 24
- How to avoid default initialization of objects in std::vector?
- second argument of the command line arguments in a format other than char** argv or char* argv[]
- How to improve efficiency of algorithm which generates next lexicographic permutation?
- Navigating to the another actvity app getting crash in android
- How to read the particular message format in android and store in sqlite database?
- Resetting inventory status after order is cancelled
- Efficiently compute powers of X in SSE/AVX
- Insert into an external database using ajax and php : POST 500 (Internal Server Error)
Popular Questions
- How do I undo the most recent local commits in Git?
- How can I remove a specific item from an array in JavaScript?
- How do I delete a Git branch locally and remotely?
- Find all files containing a specific text (string) on Linux?
- How do I revert a Git repository to a previous commit?
- How do I create an HTML button that acts like a link?
- How do I check out a remote Git branch?
- How do I force "git pull" to overwrite local files?
- How do I list all files of a directory?
- How to check whether a string contains a substring in JavaScript?
- How do I redirect to another webpage?
- How can I iterate over rows in a Pandas DataFrame?
- How do I convert a String to an int in Java?
- Does Python have a string 'contains' substring method?
- How do I check if a string contains a specific word?
The question I asked above simply has no answer because there is no guarantee that two similar sets (A and B) with the same number, meaning and order of points will have the same topology after each of them is treated with Delaunay triangulation. In other words, if 3 points A_0 to A_2 make a triangle in A, points B_0 to B_2 don't neccesarily have to make a triangle in B (they can belong to two or more different triangles).
The solution I found is to create a map M(triangleId, pointIds) which correlates triangle id from A with vertexIds belonging to that triangleId from A. Next, I don't triangulate B at all - since the point order and meaning in B is the same as in A, I can apply the map M to B as well to triangulate B in exactly the same way, maintaining the topology. After that, the problem simply disappears. This obviously does not ensure that B will be properly triangulated according to Delaunay rule, however it solves my problem.