3D Computer Vision algorithms are a subject of research and application for several
industrial processes. The Volume of Interest (VOI) usually refer to sub-objects with basic …

We revisit the following problem: Given a convex polygon $ P $, find the largest-area
inscribed triangle. We show by example that the linear-time algorithm presented in 1979 by …

This work presents a novel method to keep stable contact and balance while stepping over
partial footholds for biped humanoid robots with flat feet. We exploit plantar tactile feedback …

Given a convex polygon P of n vertices in the plane, we consider the problem of finding a
maximum area parallelogram (MAP) inside P. Previously, the best algorithm solves this …

We study the problem of finding the largest inscribed histogon and the smallest
circumscribed histogon for a convex polygon. A histogon is an axis-aligned rectilinear …

We consider an optimization problem of inscribing a unit rectangle in a convex polygon. An
axis-aligned unit rectangle is an axis-aligned rectangle whose horizontal sides are of length …

We consider two optimization problems of approximating a convex polygon, one by a largest
inscribed histogon and the other by a smallest circumscribed histogon. An axis-aligned …

This study develops a new algorithm which automatically inscribes a convex polygon in a
star shaped object ̆ O. Starting at ̆ O's mass center, our active contour (E-AC) expands …

Die vorliegende Dissertation ist motiviert durch eine praktische Aufgabenstellung: der
Verwertung von Edelsteinen. Dabei gilt es, einen mit Gesteinsresten versehenen und …

Given a convex polygon with n vertices, we study the problem of identifying a triangle with its
smallest side as large as possible among all the triangles that can be drawn inside the …