We provide linear-time algorithms for geometric graphs with sublinearly many crossings. That is, we provide algorithms running in O(n) time on connected geometric graphs having n ...
David Eppstein, Michael T. Goodrich, Darren Strash
We present a parameter synthesis algorithm for planar, higher pair mechanical systems. The input is a parametric model of a mechanical system (part shapes and configurations) with...
Connectivity and neighborhood are fundamental topological properties of objects in pictures. Since the input for any image analysis algorithm is a digital image, which does not ne...
This paper presents a novel approach for the generation of realistic speech synchronized 3D facial animation that copes with anticipatory and perseveratory coarticulation. The met...
resents a perspective on existing NoC research. We define the following abstractions: system, network adapter, network, and link to explain and structure the fundamental concepts. ...