Comments (2)
When two 3D triangles intersect, the top-level of the query needs to determine whether or not the triangles are coplanar. If the intersecting triangles are not coplanar, they can intersect in a point or a line segment. There is no "closed-polygon-line-loop." May I assume you are referring to the coplanar case? In this case, the triangles can overlap in a convex polygon. Are you looking for code that computes these polygons (if any)? If this is what you want, you can transform the triangle vertices from 3-tuples to 2-tuples. If the common plane contains point P, has normal vector N, and U and V are vectors in the plane so that {U,V,N} is a right-handed orthonormal set (unit-length vectors, mutually perpendicular, N = Cross(U,V)), you can write a vertex Q = P + xU + yV, where x = Dot(U,Q-P) and y = Dot(V,Q-P). Now you have two triangles in 2D. The file IntrTriangle2Triangle2.h has a find-intersection query, FIQuery<Real,Triangle2,Triangle2>, that computes the point, segment or polygon of the intersection (if there is an intersection).
from geometrictools.
Many thanks for your help here.
from geometrictools.
Related Issues (20)
- question 3D mesh CSG (boolean operations) HOT 2
- Question about MovingAlongCurveSpecifiedSpeed integral equation 5 on page 3 HOT 5
- Installation and Release Notes page not loading HOT 1
- IntrArc2Arc2 wrong case HOT 1
- Infinite loop in ETManifoldMesh::GetBoundaryPolygons() HOT 21
- MinimumVolumeBox3 sometimes misses large parts of the required volume HOT 9
- glt Multiarray error HOT 2
- Typo in Hyperplane::operator< - wrong comparison HOT 1
- An error occurred when I ran the 'PolygonBoolean Operations DX11' sample program HOT 5
- bug Arc2 Segment2 intersection HOT 3
- is a bug? HOT 1
- Visible vertex algorithm appears to be incorrect. HOT 5
- Segment3-Rect3/Square3 intersection finding HOT 10
- Minimal cycle basis filament extraction needs modification. HOT 1
- Does a continuous mapping from the matrices to the eigenvectors exist? HOT 11
- There seems to be something wrong with the results of Line3 and circle3's nearest distance algorithms HOT 8
- Why did the LInfinityNorm function M [0] of Matrix not take an absolute value HOT 2
- Largest Fixed-Aspect, Axis-Aligned Rectangle? HOT 2
- IntrSegment2Segment2 precison problem HOT 6
- Compiling methods to webassembly HOT 4
Recommend Projects
-
React
A declarative, efficient, and flexible JavaScript library for building user interfaces.
-
Vue.js
🖖 Vue.js is a progressive, incrementally-adoptable JavaScript framework for building UI on the web.
-
Typescript
TypeScript is a superset of JavaScript that compiles to clean JavaScript output.
-
TensorFlow
An Open Source Machine Learning Framework for Everyone
-
Django
The Web framework for perfectionists with deadlines.
-
Laravel
A PHP framework for web artisans
-
D3
Bring data to life with SVG, Canvas and HTML. 📊📈🎉
-
Recommend Topics
-
javascript
JavaScript (JS) is a lightweight interpreted programming language with first-class functions.
-
web
Some thing interesting about web. New door for the world.
-
server
A server is a program made to process requests and deliver data to clients.
-
Machine learning
Machine learning is a way of modeling and interpreting data that allows a piece of software to respond intelligently.
-
Visualization
Some thing interesting about visualization, use data art
-
Game
Some thing interesting about game, make everyone happy.
Recommend Org
-
Facebook
We are working to build community through open source technology. NB: members must have two-factor auth.
-
Microsoft
Open source projects and samples from Microsoft.
-
Google
Google ❤️ Open Source for everyone.
-
Alibaba
Alibaba Open Source for everyone
-
D3
Data-Driven Documents codes.
-
Tencent
China tencent open source team.
from geometrictools.