I have two coplaner triangles in a 3D world, and I need to find a polygon, which is the the intersection between them. However, the triangles are not always along the axes, but they will always be coplanar. What algorithm can I use to find that polygon? I am struggling to find a resource that gets this. C++ preferred.
3D Triangle-Triangle Intersection Polygon
326 views Asked by Mary Ellen Bench At
1
There are 1 answers
Related Questions in 3D
- Issues with a rotation gizmo and sign flips when converting back to euler angles
- coded one, but renderer renders two 3D models in three.js
- WorldToScreen function
- Sweep shape along 3D path in Python
- How to add another panel or window to the open3d.visualization.O3DVisualizer class? (In python open3d)
- How to estimate the memory size of a binary voxelized geometry?
- LibGDX Normal Textures Not Showing Up in 3D (Blender) Model Java
- A way to warp an image based on a map
- 3D surface won't show data on plotly
- Creating 3D python data from index sums of 2D data
- 3D graph in Rstudio (time vs intensity vs coefficient)
- Combining multiple plots with mayavi
- JavaFX 3D API does not work on all Android deivces
- Manual retargeting - How to compute target pose bone positions correctly?
- How do I dynamically change vertex colors using Direct3d 12 and Visual C++?
Related Questions in GEOMETRY
- WorldToScreen function
- Intersection of Cartesian Box and Polygon in 3D
- find point in inside polygon ..with mysql
- How do I find the line segments formed by the meeting of two sides of two polygons?
- How to create a pareto distribution prediction function?
- How to estimate the memory size of a binary voxelized geometry?
- Spacing out overlapping rectangles: how to translate pseudocode?
- Sympy manipulation of wedge products
- how to create a sector and check if some point is in it's area?
- Get third control point quadratic Bezier curve for parabola with given fucus and directrix, Lua
- CGSRegionRef: How is an arbitrary region represented as union of rects?
- Distribution of n number of equi-distant point in polygon
- Selecting suitable triangles to intersect with a line
- How to distribute n number of points into a svg polygon javascript
- How to offset a shaply polygon without chnaging corner shape
Related Questions in GRAPHICS3D
- Coloring the reverse side of mesh tiles in Scilab
- How can I rotate 3D object which I have Rotation matrix and translation matrix python
- is it possible to stop/kill Mathematica Frontend from wolframscript?
- Need help building a STL file
- Making a hemisphere that is not at the origin
- Intel graphics driver
- com.jogamp.opengl.GLException: Profile GL_DEFAULT is not available on WindowsGraphicsDevice
- Sphere doesn't show| Mathematica
- How to calculate whether the point in cube is Visibility in WPF 3D
- Trying to reproduce a 3D picture in R of a Rate or a Proportion with plot3D
- Maintain consistent plot region for Graphics3D in mathematica
- Mathematica's Shapes and GraphicsComplex data
- Rendering a image in java
- 3D Triangle-Triangle Intersection Polygon
- shadowmapping opengl glsl shader graphics math
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?
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)
If they are coplanar, they are all on a plane in 3d, like this:
p = p0 + p1*s + p2*t
All the triangle vertices on this plane can be expressed as just s and t. You can pick p0 as one of the triangle vertices and p1 and p2 as edges of one triangle. Then solve for s and t for every p that is a triangle vertex. Then do the problem in 2d with s,t coordinates. Once you are done, you can just use the result s and t coordinate to go back to 3d.