The convex hull of a regular set of integer vectors is polyhedral and effectively computable

2Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.
Get full text

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. © 2005 Elsevier B.V. All rights reserved.

Cite

CITATION STYLE

APA

Finkel, A., & Leroux, J. (2005). The convex hull of a regular set of integer vectors is polyhedral and effectively computable. Information Processing Letters, 96(1), 30–35. https://doi.org/10.1016/j.ipl.2005.04.004

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free