"Algorithms and Computation" - Information and Links:

Algorithms and Computation - Info and Reading Options

24th International Symposium, ISAAC 2013, Hong Kong, China, December 16-18, 2013, Proceedings

"Algorithms and Computation" was published by Springer London, Limited in 2013 - Berlin, Heidelberg, it has 747 pages and the language of the book is English.


“Algorithms and Computation” Metadata:

  • Title: Algorithms and Computation
  • Authors:
  • Language: English
  • Number of Pages: 747
  • Publisher: Springer London, Limited
  • Publish Date:
  • Publish Location: Berlin, Heidelberg

“Algorithms and Computation” Subjects and Themes:

Edition Identifiers:

AI-generated Review of “Algorithms and Computation”:


"Algorithms and Computation" Description:

Open Data:

Intro -- Preface -- Organization -- Table of Contents -- Invited Talk Paper -- Market Approach to Social Ads: The MyLikes Example and Related Problems -- 1 Introduction -- 2 Example: The MyLikes Platform -- 2.1 Observations on the Market -- 3 Overview of Novel Research Directions -- 4 Related Work -- 5 Concluding Remarks -- References -- Session 1A: Computational Geometry I -- Geodesic-Preserving Polygon Simplification -- 1 Introduction -- 2 Pseudo-Triangulations -- 3 Proof of the Main Theorem -- 4 Applications -- 4.1 Shortest Paths -- 4.2 Geodesic Hull -- 4.3 Separating Point Sets -- 4.4 Triple Orientation -- 4.5 Voronoi Diagram -- 4.6 Geodesic Diameter, Median, and Maximum Distance -- 5 Conclusion -- References -- Space-Efficient and Data-Sensitive Polygon Reconstruction Algorithms from Visibility Angle Information -- 1 Introduction -- 2 A Linear Space Algorithm -- 2.1 Remarks on Geometric Settings for Solving the Problem -- 2.2 Idea of the Algorithm -- 2.3 Ear Detection Routine -- 3 Algorithm Sensitive to the Size of Visibility Graph -- 3.1 Stage-Wise Greed Ear-Clipping Triangulation Algorithm -- 3.2 Reducing the Time Complexity by Using Ray-shooting Query -- 4 Analysis Dependent on Properties of Polygons -- 5 Concluding Remarks -- References -- On the Edge Crossing Properties of Euclidean Minimum Weight Laman Graphs -- 1 Introduction -- 2 Preliminaries -- 3 Quasi-planarity of MLG(P) -- 4 6-planarity of MLG(P) -- References -- Structure and Computation of Straight Skeletons in 3-Space -- 1 Introduction -- 2 Vertex Figure Resolution -- 2.1 Offset Characterization -- 2.2 Spherical Skeleton -- 3 Straight Skeleton Algorithm in -- 3.1 Event Categorization -- 4 Concluding Remarks -- References -- Session 1B: Pattern Matching -- Pattern Matching with Non Overlapping Reversals - Approximation and On-line Algorithms -- 1 Introduction

Read “Algorithms and Computation”:

Read “Algorithms and Computation” by choosing from the options below.

Search for “Algorithms and Computation” downloads:

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

Find “Algorithms and Computation” in Libraries Near You:

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

Buy “Algorithms and Computation” online:

Shop for “Algorithms and Computation” on popular online marketplaces.