2000 character limit reached
The convex hull of a regular set of integer vectors is polyhedral and effectively computable
Published 10 Dec 2008 in cs.CG, cs.DS, and cs.LO | (0812.1951v1)
Abstract: Number Decision Diagrams (NDD) provide a natural finite symbolic representation for regular set of integer vectors encoded as strings of digit vectors (least or most significant digit first). The convex hull of the set of vectors represented by a NDD is proved to be an effectively computable convex polyhedron.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.