Let G = (S, E) be a plane straight-line graph on a finite point set S ⊂ R2 in general position. The incident angles of a point p ∈ S in G are the angles between any two edges ...
Oswin Aichholzer, Thomas Hackl, Michael Hoffmann, ...
We solve the problem of minimizing the number of critical points among all functions on a surface within a prescribed distance from a given input function. The result is achieved...
We present a competitive strategy for walking into the kernel of an initially unknown star-shaped polygon. From an arbitrary start point, s, within the polygon, our strategy find...
The plenoptic function (Adelson and Bergen, 91) describes the visual information available to an observer at any point in space and time. Samples of the plenoptic function (POF) a...
In this paper we will consider tight upper- and lower-bounds on the weight of the optimal matching for random point sets distributed among the leaves of a tree, as a function of it...