Let P be a polygon with n vertices. We say that two points of P see each other if the line segment connecting them lies inside (the closure of) P. In this paper we present efficie...
In this paper we discuss farthest-point problems in which a set or sequence S of n points in the plane is given in advance and can be preprocessed to answer various queries efficie...
An unsupervised seabed segmentation algorithm for synthetic aperture sonar (SAS) imagery is proposed. Each 2 m ? 2 m area of seabed is treated as a unique data point. A set of fea...
An automated, level-set based, segmentation framework is proposed in this work for computation of tumoral volumes on mice brain bearing gliomal tumors. T1 and T2 weighted MRI imag...
Vincent Israel-Jost, E. Breton, Elsa D. Angelini, ...
Abstract. In this paper we evaluate an automatic segmentation algorithm able to identify the set of rigidly moving points within a deformable object given the 2D measurements acqui...