Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

9

APPROX
2008
Springer

favoriteEmaildiscussreport

95views Algorithms» more APPROX 2008»

Sweeping Points

13 years 6 months ago

Sweeping Points

Download digital.cs.usu.edu

Given a set of points in the plane, and a sweep-line as a tool, what is best way to move the points to a target point using a sequence of sweeps? In a sweep, the sweep-line is placed at a start position somewhere in the plane, then moved orthogonally and continuously to another parallel end position, and then lifted from the plane. The cost of a sequence of sweeps is the total length of the sweeps. Another parameter of interest is the number of sweeps. Four variants are discussed, depending whether the target is a hole or a pile, and whether the target is specified

Adrian Dumitrescu, Minghui Jiang

Real-time Traffic

Algorithms | APPROX 2008 | Parallel End Position | Start Position | Target Point |

claim paper

Related Content

» Sweeping an oval to a vanishing point

» Sweeping minimum perimeter enclosing parallelograms Optimal crumb cleanup

» The Hausdorff Voronoi Diagram of Point Clusters in the Plane

» Some Improvements for the Fast Sweeping Method

» Sweep coverage with mobile sensors

» A Multirobot System for Continuous Area Sweeping Tasks

» Character Feature Extraction Using Polygonal Projection Sweep Contour Detection

» Run to Potential Sweep Coverage in Wireless Sensor Networks

» A SpaceSweep Approach to True MultiImage Matching

Post Info
More Details (n/a)

Added	12 Oct 2010
Updated	12 Oct 2010
Type	Conference
Year	2008
Where	APPROX
Authors	Adrian Dumitrescu, Minghui Jiang

Comments (0)