Computational Complexity of VERTICES_IN_FACETS
Posted: 03 Jan 2023, 16:32
Here is a question that I received:
I was wondering what computational complexity I can expect from
VERTICES_IN_FACETS for m vertices on the d sphere. Does it rely on a convex
hull algorithm? If yes, on which? As I am using this wonderfully
practicable function as a non-specialist in convex geometry, I apologize if
this is a naive question.