Umfang:
Online-Ressource (XIII, 304 S.)
Ausgabe:
Online-Ausg. 2010 Springer eBook collection. Computer science Electronic reproduction; Available via World Wide Web
ISBN:
9783642114403
Serie:
Lecture notes in computer science 5942
Anmerkung:
Literaturangaben
,
""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 ""; ""References""; ""A Global k-Level Crossing Reduction Algorithm""; ""Introduction""; ""Preliminaries""; ""Global Sifting""; ""Building the Block List""; ""Initialization of a Sifting Step""; ""Sifting Step""; ""Sifting Swap""; ""Time Complexity""; ""Simple Global Crossing Reductions""; ""Experimental Results""
,
""Applications of the Global Crossing Reduction""""Summary""; ""References""; ""Computational Geometry""; ""Computation of Non-dominated Points Using Compact Voronoi Diagrams""; ""Introduction""; ""Formal Definition""; ""Prior Work""; ""Our Work""; ""Reduction to a Voronoi Diagram""; ""Dominated Points and the Cone""; ""Relation of Lower Envelope of Cones to Additively Weighted Voronoi Diagrams of a Convex Distance Function""; ""Reduction of Lower Envelope of Cones to Additively Weighted Voronoi Diagrams of a Convex Distance Function""; ""Computing Non-dominance in the Plane""
,
""Geometric Preliminaries""
,
Electronic reproduction; Available via World Wide Web
Weitere Ausg.:
ISBN 3642114393
Weitere Ausg.:
ISBN 9783642114397
Weitere Ausg.:
Erscheint auch als Druck-Ausgabe WALCOM: algorithms and computation Berlin : Springer, 2010 ISBN 3642114393
Weitere Ausg.:
ISBN 9783642114397
Sprache:
Englisch
Fachgebiete:
Informatik
Schlagwort(e):
Algorithmus
;
Algorithmische Geometrie
;
Graphenzeichnen
;
Graph
;
Algorithmus
;
Berechnungskomplexität
;
Konferenzschrift
DOI:
10.1007/978-3-642-11440-3
URL:
Volltext
(lizenzpflichtig)
Mehr zum Autor:
Rahman, Md. Saidur 1966-
