WALCOM : Algorithms and Computation - Info and Reading Options

Open Data:

Intro -- Title Page -- Preface -- Organization -- Table of Contents -- Invited Talks -- Crossings between Curves with Many Tangencies -- Introduction -- Levels - Proof of Theorem 1 -- Constructive Upper Bound - Proof of Theorem 2 -- Concluding Remarks -- References -- Constant-Work-Space Algorithm for a Shortest Path in a Simple Polygon -- Introduction -- Finding a Simple Path on a Tree Using Eulerian Tours -- Shortest Paths in Polygons -- A Shortest-Path Algorithm Using a Dual Graph -- A Shortest-Path Algorithm Using Point Location -- Concluding Remarks -- References -- Approximation Algorithms for Art Gallery Problems in Polygons and Terrains -- Problems and Results -- Approximation Algorithms in Polygons -- Approximation Algorithms on Terrains -- References -- The Hamiltonian Augmentation Problem and Its Applications to Graph Drawing -- Introduction -- Hamiltonian Augmentations and Point-Set Embeddings -- Point-Set Embeddings with Mapping -- Point-Set Embeddings without Mapping -- Point-Set Embedding without Mapping: Optimal Curve Complexity and Polynomial Area -- Flat Division Vertices -- Monotone Topological Book Embeddings -- Point-Set Embeddings with Curve Complexity 1 -- Colored Hamiltonicity and Colored Point-Set Embeddability -- Colored Hamiltonicity -- Colored Point-Set Embeddings -- More Points Than Vertices -- Other Applications of Hamiltonicity to Graph Drawing -- Simultaneous Embeddings -- Radially Layered Drawings -- References -- Graph Drawing -- Small Grid Drawings of Planar Graphs with Balanced Bipartition -- Introduction -- Planar Graph -- Series-Parallel Graph -- Conclusions -- References -- Switch-Regular Upward Planar Embeddings of Trees -- Introduction -- Basic Definitions -- 3-Hooks and Red-Blue Decompositions -- Red-Blue Decompositions and Switch-Regularity -- Characterization and Test -- Conclusions and Open Problems

Search for “WALCOM : Algorithms and Computation” downloads:

Visit our Downloads Search page to see if downloads are available.

Find “WALCOM : Algorithms and Computation” in Libraries Near You:

Read or borrow “WALCOM : Algorithms and Computation” from your local library.

• The WorldCat Libraries Catalog: Find a copy of “WALCOM : Algorithms and Computation” at a library near you.