I want to randomly generate polyhedrons which need not be convex. What is the most efficient way for doing so?

I can think of an algorithm for generating random convex polyhedrons, but am unable to figure out a way for generating non-convex ones. How to generate a general polyhedron?

Taking it a step further, generalising my question to an n dimension space, how to randomly generate bounded finite polytopes?

  • $\begingroup$ Do you have a requirement that all possible polyhedra have a non-zero probability of being generated? Do you require equal probability for each possible polyhedron? Your specific requirements may affect the range of solutions that are applicable. $\endgroup$ – trichoplax Jun 23 '19 at 8:24
  • $\begingroup$ For example, would combining 2 or more convex polyhedra to give a non-convex one be sufficient for your purposes? $\endgroup$ – trichoplax Jun 23 '19 at 8:26

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Browse other questions tagged or ask your own question.