Sciweavers

839 search results - page 84 / 168
» Three-Clustering of Points in the Plane
Sort
View
ICALP
2005
Springer
14 years 3 months ago
Approximation Algorithms for Euclidean Group TSP
In the Euclidean group Traveling Salesman Problem (TSP), we are given a set of points P in the plane and a set of m connected regions, each containing at least one point of P. We w...
Khaled M. Elbassioni, Aleksei V. Fishkin, Nabil H....
IFIP
1998
Springer
14 years 2 months ago
One Sided Error Predicates in Geometric Computing
A conservative implementation of a predicate returns true only if the exact predicate is true. That is, we accept a one sided error for the implementation. For geometric predicate...
Lutz Kettner, Emo Welzl
GD
2006
Springer
14 years 1 months ago
Schematisation of Tree Drawings
Given a tree T spanning a set of points S in the plane, we study the problem of drawing T using only line segments aligned with a fixed set of directions C. The vertices in the dra...
Joachim Gudmundsson, Marc J. van Kreveld, Damian M...
CBMS
2003
IEEE
14 years 1 months ago
Planar Arrangement of High-Dimensional Biomedical Data Sets by Isomap Coordinates
This article addresses 2-dimensional layout of high-dimensional biomedical datasets, which is useful for browsing them efficiently. We employ the Isomap technique, which is based ...
Ik Soo Lim, Pablo de Heras Ciechomski, Sofiane Sar...
WSCG
2003
155views more  WSCG 2003»
13 years 11 months ago
Optimal Curve Fitting to Digital Data
An optimal curve fitting technique has been developed which is meant to automatically provide a fit to any ordered digital data in plane. A more flexible class of rational cubic f...
Muhammad Sarfraz