Is it possible to calculate the volume of a sphere with a given radius value using the Riemann sum? The use of Pi is strictly prohibited. I would be glad to see a C++ listing. Source: Windows Que..

#### Category : geometry

the program must do: Create the following graphical application. With the help of which to draw a concentric circle as in the text fields indicates the thickness of the line, the number of squares and the color in the textBoxes Source: Windows Que..

I am trying to implement dual contouring, I have issue with the code, I extracted the part that contain the error and integrated it with luna frank code to visualize it, the function I created is called CreateCubeGrid() in GeometryGenerator.cpp the error can be seen here the way I implemented dual contouring, I need to ..

I’m working on a problem of inscribing largest circle in convex polygon. The algorithm should be O(nlogn) time complexity. I know that it’s been discussed on this forum, that the possible solution is using straight skeletons. I found simple algorithm, which find radius of the largest circle in O(nlogn). Link to page with algorithm http://e-maxx.ru/algo/inscribed_circle ..

I have a circle class having members centerX, centerY, and radius. I have to write a function isTangent(int x1,int y1, int x2,int y2) where it checks that the given line is tangent to the circle or not. Source: Windows Que..

So say that I have some game objects in a std::vector. Each object has its own sensory range. If there is an object in another objects sensory range, it needs to do something. Right now, I have something like this. std::vector<SomeGameObject> objects; for (int i = 0; i < objects.size(); i++) for (int j = ..

polygons I want to use boost::geometry::union_ with polygons on picture, but it cannot see point E (says, that polygon ABCDE has area as ABCD). How can I fix it? Source: Windows Que..

I am trying to use boost geometry algorithms with my own custom polygon type. But I getting compiler errors (in Visual Studio 2019 Windows 10). I have simplified what I am trying to do into the following code. In my_custom_polygon.hpp #include <boost/geometry.hpp> #include <boost/geometry/geometries/geometries.hpp> using point = boost::geometry::model::d2::point_xy<double>; using ring = boost::geometry::model::ring<point>; struct MyPoly { ..

I am trying to create a program in C to check if the lines of rectilinear polygon intersect each other at any point. I only need simple rectilinear polygons that do not intersect at any point. It can be counter-clockwise or clockwise. The inputs being passed are in the form of direction from an input ..

I am trying to understand the best approach to converting an 3D object defined by a series of vector coordinates into a .fbx file in within a c++ language environment. Lets use a simple example: say I have a simple wire-frame cube which exists as a series of 12 vectors (a cube has 12 vertices) ..

## Recent Comments