We consider "swept regions" and "swept hypersurfaces"B in Rn+1 (and especially R3) which are a disjoint union of subspaces t = t or Bt = Bt obtained from a va...
We present a fast and accurate collision detection algorithm for haptic interaction with polygonal models. Given a model, we pre-compute a hybrid hierarchical representation, cons...
Arthur D. Gregory, Ming C. Lin, Stefan Gottschalk,...
A permutation graph is an intersection graph of segments lying between two parallel lines. A Seidel complementation of a finite graph at a vertex v consists in complementing the ed...
This paper consists of a summary of the lessons learned from seven years of experience in online mediation and set future trends. Keywords. Online Dispute Resolution, ODR, mediatio...
In this paper we study the consistency problem for a set of disjunctive temporal constraints [Stergiou and Koubarakis, 1998]. We propose two SAT-based procedures, and show that—o...