Abstract. We show that there is a matching between the edges of any two triangulations of a planar point set such that an edge of one triangulation is matched either to the identic...
Oswin Aichholzer, Franz Aurenhammer, Michael Tasch...
: In a previous work, the authors introduced the class of graphs with bounded induced distance of order k, (BID(k) for short) to model non-reliable interconnection networks. A netw...
Following results are sketched in this extended abstract: (1) Datalog recursive programs where each rule has at most one subgoal called unit recursions are shown to be bounded, wit...
In communication networks, a large number of alarms exist to signal any abnormal behavior of the network. As network faults typically result in a number of alarms, correlating the...
We present new techniques for computing illumination from non-diffuse luminaires and scattering from non-diffuse surfaces. The methods are based on new closed-form expressions d...