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 …

A simple polygon P with two distinguished vertices s and t is said to be a street if the
clockwise and counterclockwise boundary of P from s to t are mutually weakly visible. We …

We provide optimal parallel solutions to several shortest path and visibility problems set in
triangulated simple polygons. Let P be a triangulated simple polygon with n vertices …

We present efficient algorithms for shortest-path and minimum-link-path queries between
two convex polygons inside a simple polygon P, which acts as an obstacle to be avoided …

As most important applications today are large-scale in nature, high-performance methods
are becoming indispensable. Two promising computational paradigms for large-scale …

Abstract. In this paper we study the collision-free path planning problem for a point robot,
whose path is of bounded curvature (ie, constrained to have curvature at most 1), moving in …

The goal of parallel algorithm design is to develop parallel computational methods that run
very fast with as few processors as possible, and there is an extensive literature of such …

We provide optimal parallel solutions to several link-distance problems set in trapezoided
rectilinear polygons. All our main parallel algorithms are deterministic and designed to run …

Execution replay is a debugging strategy where a program is run repeatedly on an input that
manifests bugs. Replaying nondeterministic parallel programs requires special tools; …

Given a set of semi-algebraic obstacles in the plane and two points in the same connected
component of the complement, the problem is to construct a polygonal path between these …