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

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

2008-12-10

arxiv.org/abs/0812.1951v1

Information Processing Letters 96, 1 (2005) 30 - 35

Computer Science

Computational Geometry

Scientific paper

10.1016/j.ipl.2005.04.004

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.

Affiliated with

Also associated with

No associations

Rating

The convex hull of a regular set of integer vectors is polyhedral and effectively computable does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with The convex hull of a regular set of integer vectors is polyhedral and effectively computable, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The convex hull of a regular set of integer vectors is polyhedral and effectively computable will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-528135