Culling points from a polygon.
Forum Reply
12ย years, 1ย month ago
Highlights
Community contributions featuredI have solved problems very similar to this by using the "Signed triangle area" formula. http://geomalgorithms.com/a01-_area.html All you need to do is loop over tโฆ
12ย years, 1ย month ago
12ย years, 9ย months ago
Are the references actually circular or are you just talking about a node which may belong to multiple entities? To handle the latter you can use a std::shared_ptr wrapper for yโฆ
12ย years, 9ย months ago
13ย years, 7ย months ago
You have your old and new direction vectors, so the problem is simply a matter of building the rotation matrix to rotate the first vector onto the second. You use the cross andโฆ
13ย years, 7ย months ago
Latest Activity
See all in DiscussionsI have solved problems very similar to this by using the "Signed triangle area" formula. http://geomalgorithms.com/a01-_area.html All you โฆ
12ย years, 1ย month ago
Are the references actually circular or are you just talking about a node which may belong to multiple entities? To โฆ
12ย years, 9ย months ago
You have your old and new direction vectors, so the problem is simply a matter of building the rotation matrix โฆ
13ย years, 7ย months ago
Badges
Contributor
Conversation Opener
Regular
Rare
Decade Member
5-Year Veteran
Visionary
Rare
1-Year Veteran
Spotlight
View all badges โ