Sciweavers

839 search results - page 46 / 168
» Three-Clustering of Points in the Plane
Sort
View
INFORMATICALT
2006
80views more  INFORMATICALT 2006»
13 years 9 months ago
Scheduling Trajectories on a Planar Surface with Moving Obstacles
An algorithm for scheduling the trajectory of a point object, which moves on a plane surface comprising of moving obstacles, is introduced. Different quantitative criteria may be m...
Emmanuel Stefanakis
IJCGA
2010
91views more  IJCGA 2010»
13 years 6 months ago
Pareto Envelopes in Simple Polygons
For a set T of n points in a metric space (X, d), a point y X is dominated by a point x X if d(x, t) d(y, t) for all t T and there exists t T such that d(x, t ) < d(y, t )....
Victor Chepoi, Karim Nouioua, Edouard Thiel, Yann ...
ICCSA
2003
Springer
14 years 2 months ago
Red-Blue Separability Problems in 3D
In this paper we study the problems of separability of two disjoint point sets in 3D by multiple criteria extending some notions on separability of two disjoint point sets in the ...
Ferran Hurtado, Carlos Seara, Saurabh Sethia
CCCG
2010
13 years 10 months ago
k-sets and continuous motion in R3
We prove several new results concerning k-sets of point sets on the 2-sphere (equivalently, for signed point sets in the plane) and k-sets in 3-space. Specific results include sph...
Marek Sulovský, Uli Wagner
COMGEO
2010
ACM
13 years 9 months ago
Highway hull revisited
A highway H is a line in the plane on which one can travel at a greater speed than in the remaining plane. One can choose to enter and exit H at any point. The highway time distanc...
Greg Aloupis, Jean Cardinal, Sébastien Coll...