" In this chapter, we introduce some of the very basics that are used throughout the book.
First, we give the definition of a topological space and related notions of open and closed …

Object recognition, robotic vision, occluding noise removal or photograph design require the
ability to perform disocclusion. We call disocclusion the recovery of hidden parts of objects in …

This handbook provides an up-to-date compendium of fundamental computer science
topics, techniques, and applications. Along with updating and revising many of the existing …

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 …

We propose an optimal-time algorithm for a classical problem in plane computational
geometry: computing a shortest path between two points in the presence of polygonal …

A natural and well-studied problem in algorithmic graph theory and network optimization is
that of computing a\shortest path" between two nodes, s and t, in a graph whose edges …

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 …

In this chapter we survey geometric techniques which have been used to measure the
similarity or distance between shapes, as well as to approximate shapes, or interpolate …

Object recognition, robot vision, image and film restoration may require the ability to perform
disocclusion. We call disocclusion the recovery of occluded areas in a digital image by …

We study the statistical physical properties of (discretized)" random surfaces," which are
random functions from Z^(or large subsets of Zd) to E, where E is Z or R. Their laws are …