Is there an algorithm to generalize the forms for BoundingRegion?

The function BoundingRegion supports the following two-dimensional regions:

  • Possible form specifications in 2D:
  • Min area axis-aligned rectangle
  • Min Area Oriented Rectangle and fast oriented rectangle
  • Min Area Convex Polygon
  • Min area disk and fast disk
  • Min Area ellipse and fast ellipse
  • fast stadium
    arbelos
    L beam shape
    I beam shape
    I am wondering if there is a way to generalize this function for example to annulus with two different radii with an angle between 0 and 360 degrees, not including 0 degrees and not including 360 degrees.
    I am also wondering if there is a way to generalize the function to accept the following inputs in 3D:
    truncated cone where the top is cut off
    torus
    dodecahedron
    icosahedron
    octahedron
    tetrahedron
    a specific case of a uniform Polyhedron such as Kepler-Poinsot or Johnson polyhedron
    hexahedron
    pyramid
    prism,
    parallepiped,
    a disk segment
    I looked at the guide guide/GeometricSpecialRegions and the documentation for BoundingRegion and the Wikipedia pages
    Minimum bounding box algorithms - Wikipedia.
    Minimum bounding rectangle - Wikipedia
    Bounding sphere - Wikipedia
    and Bounding volume - Wikipedia
    Would adding these require a whole another alogorithm of the function BoundingRegion be adopted to target other specific shapes?
1 Like