Data sets in large applications are often too massive to fit completely inside the computers
internal memory. The resulting input/output communication (or I/O) between fast internal …

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 …

A number of important results in combinatorics, discrete geometry, and theoretical computer
science have been proved using algebraic topology. While the results are quite famous …

Designing, implementing, and operating a wireless sensor network involves a wide range of
disciplines and many application-specific constraints. To make sense of and take advantage …

Exact algorithms for dealing with geometric objects are complicated, hard to implement in
practice, and slow. Over the last 20 years a theory of geometric approximation algorithms …

Motivation Reactome is a free, open-source, open-data, curated and peer-reviewed
knowledgebase of biomolecular pathways. For web-based pathway visualization, Reactome …

Graph drawing comprises all aspects of visualizing structural relations between objects. The
range of topics dealt with extends from graph theory, graph algorithms, geometry, and …

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 …

Global illumination research aiming at the photo-realistic image synthesis pushes forward
research in computer graphics as a whole. The computation of visually plausible images is …

A central problem in computational geometry, range searching arises in many applications,
and numerous geometric problems can be formulated in terms of range searching. A typical …