This paper surveys recent developments in motion planning and related geometric
algorithms, a theoretical research area that has grown rapidly in response to increasing …

This well-accepted introduction to computational geometry is a textbook for high-level
undergraduate and low-level graduate courses. The focus is on algorithms and hence the …

Consider a set of S of n data points in real d-dimensional space, Rd, where distances are
measured using any Minkowski metric. In nearest neighbor searching, we preprocess S into …

This is the newly revised and expanded edition of the popular introduction to the design and
implementation of geometry algorithms arising in areas such as computer graphics, robotics …

CONSTRUCTION AND ANALYSIS OF BIBLIOGRAPHIC NETWORKS Page 1 ' & $ % Photo:
V. Batagelj Construction and Analysis of Bibliographic Networks Simona Korenjak-ˇCerne …

We give a deterministic algorithm for triangulating a simple polygon in linear time. The basic
strategy is to build a coarse approximation of a triangulation in a bottom-up phase and then …

Davenport Schinzel sequences are sequences that do not contain forbidden alternating
subsequences of certain length. They are a powerful combinatorial tool applicable in …

We would like to give robots the ability to position and orient parts in the plane by pushing,
particularly when the parts are too large or heavy to be grasped and lifted. Unfortunately, the …

Hierarchies arise in the context of access control whenever the user population can be
modeled as a set of partially ordered classes (represented as a directed graph). A user with …

The visibility graph of a set of nonintersecting polygonal obstacles in the plane is an
undirected graph whose vertex set consists of the vertices of the obstacles and whose edges …