Computational geometry is concerned with the design and analysis of algorithms for
geometrical problems. In addition, other more practically oriented, areas of computer …

This book is primarily a textbook introduction to various areas of discrete geometry. In each
area, it explains several key results and methods, in an accessible and concrete manner. It …

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

A complete, self-contained introduction to a powerful and resurging mathematical discipline
Combinatorial Geometry presents and explains with complete proofs some of the most …

We prove an O (n (k+ 1) 1/3) upper bound for planar k-sets. This is the first considerable
improvement on this bound after its early solution approximately 27 years ago. Our proof …

The arrangement of a finite collection of geometric objects is the decomposition of the space
into connected cells induced by them. We survey combinatorial and algorithmic properties of …

Consider the following ray shooting problem: Given a collection I'of n objects in IRd, build a
data structures, so that one can quickly determine the jirst object of r intersected by a query …

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 …

Point Selections and Weak ε-Nets for Convex Hulls Page 1 Combinatorics, Probability and
Computing (1992) 1, 189-200 Copyright © 1992 Cambridge University Press Point Selections …

The allowable sequence associated to a configuration of points was first developed by the
authors in order to investigate what combinatorial structure lay behind the Erdos-Szekeres …