Sciweavers

727 search results - page 14 / 146
» One line and n points
Sort
View
IJBC
2002
71views more  IJBC 2002»
14 years 9 months ago
Rotation Sets for orbits of Degree One Circle Maps
Let F be the lifting of a circle map of degree one. In [?] a notion of F-rotation interval of a point x S1 was given. In this paper we define and study a new notion of a rotation ...
Lluís Alsedà, Francesc Mañosa...
GD
2007
Springer
15 years 4 months ago
Algorithms for Multi-criteria One-Sided Boundary Labeling
We present new algorithms for labeling a set P of n points in the plane with labels that are aligned to the left of the bounding box of P. The points are connected to their labels ...
Marc Benkert, Herman J. Haverkort, Moritz Kroll, M...
CCCG
2003
14 years 11 months ago
Shortest Paths in Two Intersecting Pencils of Lines
Suppose one has a line arrangement and one wants to find a shortest path from one point lying on a line of the arrangement to another such point. We look at a special case: the a...
David Hart
APPROX
2004
Springer
165views Algorithms» more  APPROX 2004»
15 years 3 months ago
Approximating Additive Distortion of Embeddings into Line Metrics
We consider the problem of fitting metric data on n points to a path (line) metric. Our objective is to minimize the total additive distortion of this mapping. The total additive ...
Kedar Dhamdhere
CORR
2007
Springer
111views Education» more  CORR 2007»
14 years 9 months ago
Link Scheduling in STDMA Wireless Networks: A Line Graph Approach
—We consider point to point link scheduling in Spatial Time Division Multiple Access (STDMA) wireless networks under the physical interference model. We propose a novel link sche...
N. Praneeth Kumar, Ashutosh Deepak Gore, Abhay Kar...