Computing Convex Hulls with a Linear Solver

Details Computing Convex Hulls with a Linear Solver Computing Convex Hulls with a Linear Solver

2003-11-04

arxiv.org/abs/cs/0311002v1

Computer Science

Programming Languages

13 pages, 1 figure

Scientific paper

A programming tactic involving polyhedra is reported that has been widely applied in the polyhedral analysis of (constraint) logic programs. The method enables the computations of convex hulls that are required for polyhedral analysis to be coded with linear constraint solving machinery that is available in many Prolog systems. To appear in Theory and Practice of Logic Programming (TPLP)

Affiliated with

Also associated with

No associations

Rating

Computing Convex Hulls with a Linear Solver 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 Computing Convex Hulls with a Linear Solver, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Computing Convex Hulls with a Linear Solver will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-264571