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
It is commonly accepted that in concentrated solutions or melts high-molecular weight polymers display randomwalk conformational properties without long-range correlations between...
Joachim Paul Jakob Wittmer, Philippe Beckrich, F. ...
In order to index Web images, the whole associated texts are partitioned into a sequence of text blocks, then the local relevance of a term to the corresponding image is calculated...
This paper presents a skeleton-based method for deforming meshes (the skeleton need not be the medial axis). The significant difference from previous skeleton-based methods is that...
Han-Bing Yan, Shi-Min Hu, Ralph R. Martin, Yong-Li...
In this paper, a mean shift-based clustering algorithm is proposed. The mean shift is a kernel-type weighted mean procedure. Herein, we first discuss three classes of Gaussian, C...