Sciweavers

WADS
1997
Springer
83views Algorithms» more  WADS 1997»
13 years 9 months ago
On Some Geometric Optimization Problems in Layered Manufacturing
Jayanth Majhi, Ravi Janardan, Michiel H. M. Smid, ...
WADS
1997
Springer
74views Algorithms» more  WADS 1997»
13 years 9 months ago
Constructing Pairwise Disjoint Paths with Few Links
Himanshu Gupta, Rephael Wenger
WADS
1997
Springer
89views Algorithms» more  WADS 1997»
13 years 9 months ago
Intractability of Assembly Sequencing: Unit Disks in the Plane
We consider the problem of removing a given disk from a collection of unit disks in the plane. At each step, we allow a disk to be removed by a collision-free translation to infin...
Michael H. Goldwasser, Rajeev Motwani
WADS
1997
Springer
108views Algorithms» more  WADS 1997»
13 years 9 months ago
Dynamic Data Structures for Fat Objects and Their Applications
We present several efficient dynamic data structures for point-enclosure queries, involving convex fat objects in R2 or R3. Our planar structures are actually fitted for a more ...
Alon Efrat, Matthew J. Katz, Frank Nielsen, Micha ...
WADS
1997
Springer
77views Algorithms» more  WADS 1997»
13 years 9 months ago
Offset-Polygon Annulus Placement Problems
Gill Barequet, Amy J. Briggs, Matthew Dickerson, M...
WADS
1997
Springer
94views Algorithms» more  WADS 1997»
13 years 9 months ago
Multiple Approximate String Matching
Ricardo A. Baeza-Yates, Gonzalo Navarro
WADS
1997
Springer
93views Algorithms» more  WADS 1997»
13 years 9 months ago
Trans-Dichotomous Algorithms Without Multiplication - Some Upper and Lower Bounds
Andrej Brodnik, Peter Bro Miltersen, J. Ian Munro
WADS
1997
Springer
88views Algorithms» more  WADS 1997»
13 years 9 months ago
Finding Cores of Limited Length
In this paper we consider the problem of nding a core of limited length in a tree. A core is a path, which minimizes the sum of the distances to all nodes in the tree. This proble...
Stephen Alstrup, Peter W. Lauridsen, Peer Sommerlu...
WADS
1997
Springer
91views Algorithms» more  WADS 1997»
13 years 9 months ago
Dynamic Motion Planning in Low Obstacle Density Environments
A fundamental task for an autonomous robot is to plan its own motions. Exact approaches to the solution of this motion planning problem suffer from high worst-case running times. ...
Robert-Paul Berretty, Mark H. Overmars, A. Frank v...