Because moving objects usually moves on spatial networks, efficient trajectory index structures are required to gain good retrieval performance on their trajectories. However, ther...
Given two sets A and B of m non-intersecting line segments in the plane, we show how to compute in O(m log m) time a data structure that uses O(m) space and allows to answer the fo...
Otfried Cheong, Hazel Everett, Hyo-Sil Kim, Sylvai...
—We study the problem of approximating a 3D solid with a union of overlapping spheres. In comparison with a stateof-the-art approach, our method offers more than an order of magn...
Markov random field (MRF) theory provides a basis for modeling contextual constraints in visual processing and interpretation. It enables us to develop optimal vision algorithms sy...
Shock graphs have emerged as a powerful generic 2-D shape representation. However, most approaches typically assume that the silhouette has been correctly segmented. In this paper,...