A d dimensional convex polyhedron is the intersection of a finite number m of non-redundant
halfspaces '1-l={kf], 172,... I-1~} of $? d. A bounded convex polyhedron is called a polytope …

We study several known volume computation algorithms for convex d-polytopes by
classifying them into two classes, triangulation methods and signed-decomposition …

With a low moving inertia, high payload-to-weight ratio, and large workspace, cable-driven
parallel robots (CDPRs) are relevant in many applications, especially redundant CDPRs. As …

Treetops volume information in groves is a key component of the perception process for
improving herbicide management, foliage density observation and a grove's canopy maturity …

In this thesis, we are concerned with multiobjective combinatorial optimization (MOCO)
problems. We attempt to fill the gap between theory and practice, which comes from the lack …

In this work we show how Binary Decision Diagrams can be used as a powerful tool for 0/1
Integer Programming and related polyhedral problems. We develop an output-sensitive …

In polyhedral studies of 0/1 polytopes two prominent problems exist. One is the vertex
enumeration problem: Given a system of inequalities, enumerate its feasible 0/1 points …

We design an algorithm to compute the Newton polytope of the resultant, known as resultant
polytope, or its orthogonal projection along a given direction. The resultant is fundamental in …

We develop an incremental algorithm to compute the Newton polytope of the resultant, aka
resultant polytope, or its projection along a given direction. The resultant is fundamental in …

The double description method is a simple but widely used algorithm for computation of
extreme points in polyhedral sets. One key aspect of its implementation is the question of …