Motion planning is one of the most important areas of robotics research. The complexity of
the motion-planning problem has hindered the development of practical algorithms. This …

As more computers have incorporated some form of parallelism, the emphasis in algorithm
design has shifted from sequential algorithms to parallel algorithms, that is, algorithms in …

This book is a revised version of my Doctoral Dissertation, which was completed at the
Massachusetts Institute of Technology in November, 1988. The main purpose of the work …

This handbook provides an up-to-date compendium of fundamental computer science
topics, techniques, and applications. Along with updating and revising many of the existing …

Parallel computation | Guide books skip to main content ACM Digital Library home ACM home
Google, Inc. (search) Advanced Search Browse About Sign in Register Advanced Search …

A human observer can effortlessly identify visible portions of geometric objects present in the
environment. However, computations of visible portions of objects from a viewpoint involving …

When you think about how far and fast computer science has progressed in recent years, it's
not hard to conclude that a seven-year old handbook may fall a little short of the kind of …

We present efficient parallel algorithms for several basic problems in computational
geometry: convex hulls, Voronoi diagrams, detecting line segment intersections …

We present several applications in computational geometry of Megiddo′ s parametric
searching technique. These applications include:(1) Finding the minimum Hausdorff …

The string editing problem for input strings x and y consists of transforming x into y by
performing a series of weighted edit operations on x of overall minimum cost. An edit …