In the recently introduced model for cleaning a graph with brushes, we use a degree-greedy algorithm to clean a random d-regular graph on n vertices (with dn even). We then use a d...
Margaret-Ellen Messinger, Pawel Pralat, Richard J....
Abstract We study ways to restrict or prevent the damage that can be caused in a peer-to-peer network by corrupt entities creating multiple pseudonyms. We show that it is possible ...
This paper describes a method for extracting feature edges of a polygonal surface for mesh generation. This method can extract feature edges from a polygonal surface typically cre...
Abstract. Surgical simulations with the aid of computers is a topic of increasingly extensive research. Realtime response and interactivity are crucial components of any such syste...
In this paper we describe and analyze a method based on local least square fitting for estimating the normals at all sample points of a point cloud data (PCD) set, in the presenc...