The problem of finding minimal volume boxes circumscribing a given set of three-
dimensional points is investigated. It is shown that it is not necessary for a minimum volume …

An m× n matrix C is called Monge matrix if cij+ crs⩽ cis+ crj for all 1⩽ i< r⩽ m, 1⩽ j< s⩽ n. In
this paper we present a survey on Monge matrices and related Monge properties and their …

Object classification often operates by making decisions based on the values of several
shape properties measured from an image of the object. This paper describes several …

We survey the state of the art of computational geometry, a discipline that deals with the
complexity of geometric problems within the framework of the analysis of algorithms. This …

We present efficient parallel algorithms for several basic problems in computational
geometry: convex hulls, Voronoi diagrams, detecting line segment intersections …

Approximation of convex sets by polytopes | Journal of Mathematical Sciences Skip to main
content Springer Nature Link Account Menu Find a journal Publish with us Track your research …

In this paper we present a joint sender/receiver optimization algorithm and a seamless rate
adjustment protocol to reduce the total number of packets over different paths in a streaming …

With significant progress being made toward improving endoscope technology such as
capsule endoscopy and robotic endoscopy, the development of advanced strategies for …

The potato-peeling problem asks for the largest convex polygon contained inside a given
simple polygon. We give an O (n 7) time algorithm to this problem, answering a question of …

In the agricultural industry, an evolutionary effort has been made over the last two decades
to achieve precise autonomous systems to perform typical in‐field tasks, including …