We review the recent progress in the design of efficient algorithms for various problems in
geometric optimization. We present several techniques used to attack these problems, such …

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 …

In this paper we address the problem of segmenting a trajectory based on spatiotemporal
criteria. We require that each segment is homogeneous in the sense that a set of …

This paper presents the methodology that has been used to create the 2011 Area
Classification for Output Areas (2011 OAC). This extends a lineage of widely used public …

Abstract We study (1+ e)-factor approximation algorithms for several well-known
optimization problems on a given npoint set:(a) diameter,(b) width,(c) smallest enclosing …

We present an analysis of the generalized sidelobe canceller (GSC). It can be shown that
the theoretical limits of the noise reduction performance depend only on the auto-and cross …

A natural extension of point facility location problems are those problems in which facilities
are extensive, ie those that cannot be represented by isolated points but as some …

Given a set of points S={pi,..., pn} in the euclidean d-dimensional space, we address the
problem of computing the d-dimensional annulus of smallest width containing the set. We …

Let S be a set of n points in Rd. The “roundness” of S can be measured by computing the
width w'(S) of the thinnest spherical shell (or annulus in R') that contains S. This paper …

In this paper, we identify a minimum width rectangular annulus that encloses a given set of n
points in a plane. We propose an O (n 2 log n) time and O (n) space algorithm for this …