Sciweavers

CCCG
1993
13 years 6 months ago
Shortest Paths for a Two-robot Rendez-vous
In this paper, we consider an optimalmotionplanning problem for a pair of point robots in a planar environment with polygonal obstacles. We seek a pair of paths upon which the rob...
Erik L. Wynters, Joseph S. B. Mitchell
CCCG
1993
13 years 6 months ago
Algorithms for Ham Sandwich Cuts
Given disjoint sets P1 P2 : : : Pd in R d with n points in total, a ham-sandwich cut is a hyperplane that simultaneously bisects the Pi. We present algorithms for nding
William L. Steiger
CCCG
1993
13 years 6 months ago
Maintaining the Approximate Width of a Set of Points in the Plane
d abstract) Gunter Rotey Christian Schwarzz Jack Snoeyinkx The width of a set of n points in the plane is the smallest distance between two parallel lines that enclose the set. W...
Günter Rote, Christian Schwarz, Jack Snoeyink
CCCG
1993
13 years 6 months ago
Folding Rulers inside Triangles
An l-ruler is a chain of n links, each of length l. The links, which are allowed to cross, are modeled by line segments whose endpoints act as joints. A given configuration of an ...
Marc J. van Kreveld, Jack Snoeyink, Sue Whitesides
CCCG
1993
13 years 6 months ago
Optimal Slope Selection Via Expanders
Matthew J. Katz, Micha Sharir
CCCG
1993
13 years 6 months ago
Widest-corridor Problems
A k-dense corridor through a finite set, S, of n points in the plane is the open region of the plane that is bounded by two parallel lines that intersect the convex hull of S and ...
Ravi Janardan, Franco P. Preparata
CCCG
1993
13 years 6 months ago
Simple Randomized Algorithms for Closest Pair Problems
Mordecai J. Golin, Rajeev Raman, Christian Schwarz...
CCCG
1993
13 years 6 months ago
The Floodlight Problem
Given three angles summing to 2, given n points in the plane and a tripartition k1 + k2 + k3 = n, we can tripartition the plane into three wedges of the given angles so that the ...
Prosenjit Bose, Leonidas J. Guibas, Anna Lubiw, Ma...