What is the best way in C++ to calculate the coordinate of a rectangle (hyper-rectangle) in n-dimension? I have dimensions of the rectangle in a 1d vector like {1d_min , 1d_max ,2d_min,2d_max, ...., nd_min,nd_max}. For example, in 2d the dimensions are {1d_min,1d_max ,2d_min,2d_max}. And the coordinates will be {1d_min,2d_min},{1d_min,2d_max},{1d_max,2d_min},{1d_max,2d_max}. However, I want it for n-dimension.
For people with even minimal background in geometry, it’s obvious the OP wants coordinates of all vertices of an axis aligned hyper-rectangle. A good question in my book, and it has very simple and elegant answer which I wrote there (using bits from an integer vertex index to select min or max coordinates).
What is the best way in C++ to calculate the coordinate of a rectangle (hyper-rectangle) in n-dimension? I have dimensions of the rectangle in a 1d vector like {1d_min , 1d_max ,2d_min,2d_max, ...., nd_min,nd_max}. For example, in 2d the dimensions are {1d_min,1d_max ,2d_min,2d_max}. And the coordinates will be {1d_min,2d_min},{1d_min,2d_max},{1d_max,2d_min},{1d_max,2d_max}. However, I want it for n-dimension.
For people with even minimal background in geometry, it’s obvious the OP wants coordinates of all vertices of an axis aligned hyper-rectangle. A good question in my book, and it has very simple and elegant answer which I wrote there (using bits from an integer vertex index to select min or max coordinates).