A typical range-searching problem has the following form: Pre-process a set S of points in R*
so that the points of S lying inside a query region can be reported or counted quickly. We …

Computational Geometry is an area that provides solutions to geometric problems which
arise in applications including Geographic Information Systems, Robotics and Computer …

Handbook of DISCRETE AND COMPUTATIONAL GEOMETRY Page 1 i “K25063” — 2017/9/15
— 18:58 — page 811 — i i i 31 SHORTEST PATHS AND NETWORKS Joseph SB Mitchell …

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 …

Although there are many advanced and specialized texts and handbooks on algorithms,
until now there was no book that focused exclusively on the wide variety of data structures …

Given a sequence of k polygons in the plane, a start point s, and a target point, t, we seek a
shortest path that starts at s, visits in order each of the polygons, and ends at t. If the …

Among the intuitively appealing aspects of graph theory is its close connection to drawings
and geometry. The development of computer technology has become a source of motivation …

We present kinetic data structures for detecting collisions between a set of polygons that are
moving continuously. Unlike classical collision detection methods that rely on bounding …

We introduce two new related metrics, the geodesic width and the link width, for measuring
the “distance” between two nonintersecting polylines in the plane. If the two polylines have n …

ON THE TIME BOUND FOR CONVEX DECOMPOSITION OF SIMPLE POLYGONS 1. Introduction
Suppose that P is a simple polygon in the plane wi Page 1 International Journal of Computational …