Sciweavers

133 search results - page 11 / 27
» On the distinct distances determined by a planar point set
Sort
View
IJIT
2004
13 years 9 months ago
On the Noise Distance in Robust Fuzzy C-Means
In the last decades, a number of robust fuzzy clustering algorithms have been proposed to partition data sets affected by noise and outliers. Robust fuzzy C-means (robust-FCM) is c...
Mario G. C. A. Cimino, Graziano Frosini, Beatrice ...
CAD
2008
Springer
13 years 8 months ago
Detecting approximate symmetries of discrete point subsets
Detecting approximate symmetries of parts of a model is important when attempting to determine the geometric design intent of approximate boundary-representation (B-rep) solid mod...
Ming Li, Frank C. Langbein, Ralph R. Martin
IJCGA
2000
85views more  IJCGA 2000»
13 years 7 months ago
Obnoxious Facility Location: Complete Service with Minimal Harm
We present e cient algorithms for several instances of the following facility location problem. Facilities and demand sites are represented as points in the plane. Place k obnoxio...
Boaz Ben-Moshe, Matthew J. Katz, Michael Segal
ICRA
2003
IEEE
101views Robotics» more  ICRA 2003»
14 years 1 months ago
A Branch-and-Prune Algorithm for Solving Systems of Distance Constraints
— Given a set of affine varieties in ℜ3, i.e. planes, lines, and points, the problem tackled in this paper is that of finding all possible configurations for these varieties...
Josep M. Porta, Federico Thomas, Lluís Ros,...
GRAPHICSINTERFACE
2007
13 years 9 months ago
Visualization and exploration of time-varying medical image data sets
In this work, we propose and compare several methods for the visualization and exploration of time-varying volumetric medical images based on the temporal characteristics of the d...
Zhe Fang, Torsten Möller, Ghassan Hamarneh, A...