Category : intersection

I am attempting to find the intersections of many polygons_with_holes to check the topology of a map. However, when using the CGAL::intersection() defined here (under 2D Regularized Boolean Set-Operations), the run time for one check exceeds 1 minute, sometimes reaching close to 2 minutes. I have about 60-70 polygons with holes, with a total of ..

Read more

I have a frustum made of six planes, normals all pointing inwards. I can check if a point is inside the frustum with this function: char ClassifyPoint(float x, float y, float z, char thePlane) { Vector& aPos=mPlane[thePlane].mPos; Vector& aNorm=mPlane[thePlane].mNormal; float aD=(aPos.mX-x)*aNorm.mX+(aPos.mY-y)*aNorm.mY+(aPos.mZ-z)*aNorm.mZ; if (aD<-0.0005f) return 1;if (aD>0.0005f) return -1;return 0; } Which gives me -1, 0, ..

Read more

I am trying to use floats instead of doubles with standard Boost.Geometry Intersection method. But this code crashes, if I just change everything to floats already in the first loop. With double it works without problem. This is the error and the code: Unhandled Exception: System.AccessViolationException: Attempted to read or write protected memory. This is ..

Read more