Computational Geometry is an area that provides solutions to geometric problems which arise in applications including Geographic Information Systems, Robotics and Computer Graphics. This Handbook provides an overview of key concepts and results in Computational Geometry. It may serve as a reference and study guide to the field. Not only the most advanced methods or solutions are described, but also many alternate ways of looking at problems and how to solve them.

The Transactions on Computational Science journal is part of the Springer series Lecture Notes in Computer Science, and is devoted to the gamut of computational science issues, from theoretical aspects to application-dependent studies and the va- dation of emerging technologies. The current issue is devoted to computer systems research and the application of such research, which naturally complement each other. The issue is comprised of Part 1: Computational Visualization and Optimization, and Part 2: Computational Methods for Model Design and Analysis. Part 1 – Computational Visualization and Optimization – is devoted to state-of-the-art research carried out in this area with the use of novel computational methods. It is c- prised of five papers, each addressing a specific computational problem in the areas of shared virtual spaces, dynamic visualization, multimodal user interfaces, computational geometry, and parallel simulation, respectively. Part 2 – Computational Methods for Model Design and Analysis – continues the topic with an in-depth look at selected computational science research in the areas of data representation and analysis. The four papers comprising this part cover such areas as efficient reversible logic design, missing data analysis, stochastic computation and neural network representation for eccentric sphere models. Each paper describes a detailed experiment or a case study of the methodology presented to amplify the impact of the contribution.

This volume gives the proceedings of the ninth Symposium on Theoretical Aspects of Computer Science (STACS). This annual symposium is held alternately in France and Germany and is organized jointly by the Special Interest Group for Fundamental Computer Science of the Association Francaise des Sciences et Technologies de l'Information et des Syst mes (AFCET) and the Special Interest Group for Theoretical Computer Science of the Gesellschaft f}r Informatik (GI). The volume includes three invited lectures and sections on parallel algorithms, logic and semantics, computational geometry, automata and languages, structural complexity, computational geometry and learning theory, complexity and communication, distributed systems, complexity, algorithms, cryptography, VLSI, words and rewriting, and systems.

This book constitutes the refereed proceedings of the 10th International Symposium on Algorithms and Computation, ISAAC'99, held in Chennai, India, in December 1999. The 40 revised full papers presented together with four invited contributions were carefully reviewed and selected from 71 submissions. Among the topics covered are data structures, parallel and distributed computing, approximation algorithms, computational intelligence, online algorithms, complexity theory, graph algorithms, computational geometry, and algorithms in practice.