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, ...
Let S be a finite set of n + 3 points in general position in the plane, with 3 extreme points and n interior points. We consider triangulations drawn uniformly at random from the...
A spherical -design on Sn-1 is a finite set such that, for all polynomials f of degree at most , the average of f over the set is equal to the average of f over the sphere Sn-1 . ...
Abstract. Besides topological relations and approximate relations, cardinal directions have turned out to be an important class of qualitative spatial relations. In spatial databas...
Tao Chen, Markus Schneider, Ganesh Viswanathan, We...
We study the worst-case performance of the maximal matching heuristic applied to the Minimum Vertex Cover and Minimum Maximal Matching problems, through a careful analysis of tigh...