Search

Graph Drawing Beyond Planarity is a rapidly growing research area that classifies and studies geometric representations of nonplanar graphs in terms of forbidden crossing configurations. The aim of this survey is to describe the main research directions in this area, the most prominent known results, and some of the most challenging open problems. [ABSTRACT FROM AUTHOR]

The article focuses on a new model for algorithm animation over the world wide web. Algorithm animation helps the end user to understand algorithms by visually following their step-by-step execution, a complex task if relying on the textual program alone. There is a strong educational component associated with algorithm animation. It can be used by students individually or in class demonstrations. Algorithm animation is also a powerful software tool that can assist the algorithm designer in code debugging and in demonstrating a complex algorithm to a larger audience than merely specialists in the particular area of the algorithm. A new model, called Mocha, has been introduced for providing algorithm animation over the World-Wide Web. Mocha is a distributed model with a client-server architecture that optimally partitions the software components of a typical algorithm animation system and leverages the power of the Java language, an emerging standard for distributing interactive platform-independent multimedia applications across the Web.