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

Simple item page
dc.creatorFinkel, Alain
dc.creatorLeroux, Jérôme
dc.date2008-12-10
dc.date.accessioned2026-07-07T12:12:09Z
dc.date.available2026-07-07T12:12:09Z
dc.descriptionNumber 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.
dc.identifierhttps://arxiv.org/abs/0812.1951
dc.identifierhttp://arxiv.org/abs/0812.1951
dc.identifierInformation Processing Letters 96, 1 (2005) 30 - 35
dc.identifierdoi:10.1016/j.ipl.2005.04.004
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/210452
dc.subjectComputational Geometry
dc.subjectData Structures and Algorithms
dc.subjectLogic in Computer Science
dc.titleThe convex hull of a regular set of integer vectors is polyhedral and effectively computable
dc.typetext

Files

Collections

arXiv