In modern computer graphics, 3D scanning is common practise for the acquisition of the geometry of objects. However, in addition to geometric models, physical models of interactio...
Soss proved that it is NP-hard to find the maximum flat span of a fixed-angle polygonal chain: the largest distance achievable between the endpoints in a planar embedding. These f...
In this paper we develop an efficient implementation for a k-means clustering algorithm. The novel feature of our algorithm is that it uses coresets to speed up the algorithm. A ...
In this paper we present a methodical evaluation of the performance of a new and two traditional approaches to automatic target recognition (ATR) based on silhouette representatio...
An automatic cortical gray matter segmentation from a three-dimensional (3-D) brain images [magnetic resonance (MR) or computed tomography] is a well known problem in medical image...
Roman Goldenberg, Ron Kimmel, Ehud Rivlin, Michael...