We present a randomized algorithm for finding maximum matchings in planar graphs in time O(nω/2 ), where ω is the exponent of the best known matrix multiplication algorithm. Sin...
In this paper, we propose a novel algorithm to smooth and simplify simultaneously range images and also triangle meshes derived from those images. These data sets often suffer fro...
Yiyong Sun, Joon Ki Paik, Andreas Koschan, David L...
Abstract When designing novel algorithms for geometric processing and analysis, researchers often assume that the input conforms to several requirements. On the other hand, polygon...
Abstract. We study the feasibility and time of communication in random geometric radio networks, where nodes fail randomly with positive correlation. We consider a set of radio sta...
We present an algorithm for computing the probability density function of the product of two independent random variables, along with an implementation of the algorithm in a compu...