LEDA: a platform for combinatorial and geometric computing
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Cambridge [u.a.]
Cambridge Univ. Press
|
| Ausgabe: | Paperback re-issue |
| Schlagworte: | |
| Online-Zugang: | Inhaltsverzeichnis |
| ISBN: | 9780521109413 9780521563291 |
Internformat
MARC
| LEADER | 00000nam a2200000 ca4500 | ||
|---|---|---|---|
| 001 | BV039774151 | ||
| 003 | DE-604 | ||
| 005 | 20220221 | ||
| 007 | t | ||
| 008 | 111222nuuuuuuuu |||| 00||| eng d | ||
| 015 | |a GBA936257 |2 dnb | ||
| 020 | |a 9780521109413 |c kart. (Set 2bdg.) |9 978-0-521-10941-3 | ||
| 020 | |a 9780521563291 |c geb. (Single vol.) |9 978-0-521-56329-1 | ||
| 035 | |a (DE-599)HBZHT016005563 | ||
| 040 | |a DE-604 |b ger |e aacr | ||
| 041 | 0 | |a eng | |
| 084 | |a ST 240 |0 (DE-625)143625: |2 rvk | ||
| 084 | |a ST 250 |0 (DE-625)143626: |2 rvk | ||
| 084 | |a ST 260 |0 (DE-625)143632: |2 rvk | ||
| 100 | 1 | |a Mehlhorn, Kurt |d 1949- |e Verfasser |0 (DE-588)139294201 |4 aut | |
| 245 | 1 | 0 | |a LEDA |b a platform for combinatorial and geometric computing |c Kurt Mehlhorn ; Stefan Näher |
| 250 | |a Paperback re-issue | ||
| 264 | 1 | |a Cambridge [u.a.] |b Cambridge Univ. Press | |
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 650 | 0 | 7 | |a Kombinatorik |0 (DE-588)4031824-2 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a LEDA |g Programmbibliothek |0 (DE-588)4590532-0 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Abstrakter Datentyp |0 (DE-588)4120827-4 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Algorithmus |0 (DE-588)4001183-5 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Algorithmische Geometrie |0 (DE-588)4130267-9 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Kombinatorik |0 (DE-588)4031824-2 |D s |
| 689 | 0 | 1 | |a Algorithmische Geometrie |0 (DE-588)4130267-9 |D s |
| 689 | 0 | 2 | |a Abstrakter Datentyp |0 (DE-588)4120827-4 |D s |
| 689 | 0 | 3 | |a Algorithmus |0 (DE-588)4001183-5 |D s |
| 689 | 0 | |5 DE-604 | |
| 689 | 1 | 0 | |a LEDA |g Programmbibliothek |0 (DE-588)4590532-0 |D s |
| 689 | 1 | |5 DE-604 | |
| 700 | 1 | |a Näher, Stefan |e Verfasser |0 (DE-588)1209954923 |4 aut | |
| 856 | 4 | 2 | |m Digitalisierung UB Bayreuth |q application/pdf |u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=024635075&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-024635075 | ||
Datensatz im Suchindex
| _version_ | 1804148691450200064 |
|---|---|
| adam_text | Contents
Part One
Preface
1
Introduction
1.1
Some Programs
1.2
The
LEDA
System
1.3
The
LEDA Web-Site
1.4
Systems that Go Well with
LEDA
1.5
Design Goals and Approach
1.6
History
2
Foundations
2.1
Data Types
2.2
Item Types
2.3
Copy, Assignment, and Value Parameters
2.4
More on Argument Passing and Function Value Return
2.5
Iteration
2.6
STL Style Iterators
2.7
Data Types and
C++
2.8
Type Parameters
2.9
Memory Management
2.10
Linearly Ordered Types, Equality and Hashed Types
2.11
Implementation Parameters
2.12
Helpful Small Functions
2.13
Error Handling
2.14
Program Checking
page
xi
1
1
8
10
11
11
13
16
16
26
32
36
39
41
41
45
47
47
51
52
54
54
Contents
2.15 Header Files, Implementation Files, and Libraries 56
2.16
Compilation
Flags 57
3
Basic Data Types
3.1
Stacks and Queues
3.2
Lists
3.3
Arrays
3.4
Compressed Boolean Arrays (Type int_set)
3.5
Random Sources
3.6
Pairs, Triples, and such
3.7
Strings
3.8
Making Simple Demos and Tables
4
Numbers and Matrices
4.1
Integers
4.2
Rational Numbers
4.3
Floating Point Numbers
4.4
Algebraic Numbers
4.5
Vectors and Matrices
5
Advanced Data Types
5.1
Sparse Arrays: Dictionary Arrays, Hashing Arrays, and Maps
5.2
The Implementation of the Data Type Map
5.3
Dictionaries and Sets
5.4
Priority Queues
5.5
Partition
5.6
Sorted Sequences
5.7
The Implementation of Sorted Sequences by Skiplists
5.8
An Application of Sorted Sequences: Jordan Sorting
6
Graphs and their Data Structures
6.1
Getting Started
6.2
A First Example of a Graph Algorithm: Topological Ordering
6.3
Node and Edge Arrays and Matrices
6.4
Node and Edge Maps
6.5
Node Lists
6.6
Node Priority Queues and Shortest Paths
6.7
Undirected Graphs
6.8
Node Partitions and Minimum Spanning Trees
6.9
Graph Generators
6.10
Input and Output
6.11
Iteration Statements
58
58
61
73
77
79
94
95
96
99
99
103
104
108
117
121
121
133
146
147
158
180
196
228
240
240
244
245
249
251
253
257
259
263
269
271
Contents
6.12 Basic Graph
Properties and their Algorithms
274
6.13
Parameterized Graphs
280
6.14
Space and Time Complexity
281
7
Graph Algorithms
283
7.1
Templates for Network Algorithms
283
7.2
Algorithms on Weighted Graphs and Arithmetic Demand
286
7.3
Depth-First Search and Breadth-First Search
293
7.4
Reachability and Components
296
7.5
Shortest Paths
316
7.6
Bipartite Cardinality Matching
360
7.7
Maximum Cardinality Matchings in General Graphs
393
7.8
Maximum Weight Bipartite Matching and the Assignment Problem
413
7.9
Weighted Matchings in General Graphs
443
7.10
Maximum Flow
443
7.11
Minimum Cost Flows
489
7.12
Minimum Cuts in Undirected Graphs
491
Part Two
8
Embedded Graphs
498
8.1
Drawings
, 499
8.2
Bidirected Graphs and Maps
501
8.3
Embeddings
506
8.4
Order-Preserving Embeddings of Maps and Plane Maps
511
8.5
The Face Cycles and the Genus of a Map
512
8.6
Faces, Face Cycles, and the Genus of Plane Maps
515
8.7
Planarity Testing, Planar Embeddings, and Kuratowski Subgraphs
519
8.8
Manipulating Maps and Constructing Triangulated Maps
564
8.9
Generating Plane Maps and Graphs
569
8.10
Faces as Objects
571
8.11
Embedded Graphs as Undirected Graphs
574
8.12
Order from Geometry
575
8.13
Miscellaneous Functions on Planar Graphs
577
9
The Geometry Kernels
581
9.1
Basics
583
9.2
Geometric Primitives
593
9.3 Affine
Transformations
601
9.4
Generators for Geometric Objects
604
9.5
Writing Kernel Independent Code
606
9.6
The Dangers of Floating Point Arithmetic
609
9.7
Floating Point Filters
613
9.8
Safe Use of the Floating Point Kernel
632
vüi ContentS
9.9
A Glimpse at the Higher-Dimensional Kernel
634
9.10
History 634
9.11
LEDA
and CGAL 635
10
Geometry Algorithms
637
10.1
Convex Hulls 637
10.2
Triangulations
656
10.3
Verification of Geometric Structures, Basics
664
10.4
Delaunay
Triangulations
and Diagrams
672
10.5
Voronoi Diagrams
686
10.6
Point Sets and Dynamic Delaunay
Triangulations
708
10.7
Line Segment Intersection
731
10.8
Polygons
758
10.9
A Glimpse at Higher-Dimensional Geometric Algorithms
790
10.10
A Complete Program: The Voronoi Demo
795
11
Windows and Panels
813
11.1
Pixel and User Coordinates
814
11.2
Creation, Opening, and Closing of a Window
815
11.3
Colors
817
11.4
Window Parameters
818
11.5
Window Coordinates and Scaling
821
11.6
The Input and Output Operators
«;
and
» 821
11.7
Drawing Operations
822
11.8
Pixrects and Bitmaps
823
11.9
Clip Regions
828
11.10
Buffering
829
11.11
Mouse Input
831
11.12
Events
834
11.13
Timers
842
11.14
The Panel Section of a Window
844
11.15
Displaying Three-Dimensional Objects: d3.window
855
12
GraphWin
857
12.1
Overview
858
12.2
Attributes and Parameters
861
12.3
The Programming Interface
866
12.4
Edit and Run: A Simple Recipe for Interactive Demos
875
12.5
Customizing the Interactive Interface
879
12.6
Visualizing Geometric Structures
890
12.7
A Recipe for On-line Demos of Network Algorithms
892
12.8
A Binary Tree Animation
397
Contents ix
13
On the
Implementation
of
LEDA
904
13.1
Parameterized Data Types
904
13.2
A Simple List Data Type
904
13.3
The Template Approach
906
13.4
The
LEDA
Solution
909
13.5
Optimizations
929
13.6
Implementation Parameters
934
13.7
Independent Item Types (Handle Types)
937
13.8
Memory Management
941
13.9
Iteration
943
13.10
Priority Queues by Fibonacci Heaps (A Complete Example)
946
14
Manual Pages and Documentation
963
14.1
LmanandFman
963
14.2
Manual Pages
966
14.3
Making a Manual: The Mkman Command
984
14.4
The Manual Directory in the
LEDA
System
985
14.5
Literate Programming and Documentation
986
Bibliography after page
497
Index
|
| any_adam_object | 1 |
| author | Mehlhorn, Kurt 1949- Näher, Stefan |
| author_GND | (DE-588)139294201 (DE-588)1209954923 |
| author_facet | Mehlhorn, Kurt 1949- Näher, Stefan |
| author_role | aut aut |
| author_sort | Mehlhorn, Kurt 1949- |
| author_variant | k m km s n sn |
| building | Verbundindex |
| bvnumber | BV039774151 |
| classification_rvk | ST 240 ST 250 ST 260 |
| ctrlnum | (DE-599)HBZHT016005563 |
| discipline | Informatik |
| edition | Paperback re-issue |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01972nam a2200457 ca4500</leader><controlfield tag="001">BV039774151</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20220221 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">111222nuuuuuuuu |||| 00||| eng d</controlfield><datafield tag="015" ind1=" " ind2=" "><subfield code="a">GBA936257</subfield><subfield code="2">dnb</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780521109413</subfield><subfield code="c">kart. (Set 2bdg.)</subfield><subfield code="9">978-0-521-10941-3</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780521563291</subfield><subfield code="c">geb. (Single vol.)</subfield><subfield code="9">978-0-521-56329-1</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)HBZHT016005563</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">aacr</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 240</subfield><subfield code="0">(DE-625)143625:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 250</subfield><subfield code="0">(DE-625)143626:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 260</subfield><subfield code="0">(DE-625)143632:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Mehlhorn, Kurt</subfield><subfield code="d">1949-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)139294201</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">LEDA</subfield><subfield code="b">a platform for combinatorial and geometric computing</subfield><subfield code="c">Kurt Mehlhorn ; Stefan Näher</subfield></datafield><datafield tag="250" ind1=" " ind2=" "><subfield code="a">Paperback re-issue</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Cambridge [u.a.]</subfield><subfield code="b">Cambridge Univ. Press</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Kombinatorik</subfield><subfield code="0">(DE-588)4031824-2</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">LEDA</subfield><subfield code="g">Programmbibliothek</subfield><subfield code="0">(DE-588)4590532-0</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Abstrakter Datentyp</subfield><subfield code="0">(DE-588)4120827-4</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Algorithmus</subfield><subfield code="0">(DE-588)4001183-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Algorithmische Geometrie</subfield><subfield code="0">(DE-588)4130267-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Kombinatorik</subfield><subfield code="0">(DE-588)4031824-2</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Algorithmische Geometrie</subfield><subfield code="0">(DE-588)4130267-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="2"><subfield code="a">Abstrakter Datentyp</subfield><subfield code="0">(DE-588)4120827-4</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="3"><subfield code="a">Algorithmus</subfield><subfield code="0">(DE-588)4001183-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="1" ind2="0"><subfield code="a">LEDA</subfield><subfield code="g">Programmbibliothek</subfield><subfield code="0">(DE-588)4590532-0</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Näher, Stefan</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)1209954923</subfield><subfield code="4">aut</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">Digitalisierung UB Bayreuth</subfield><subfield code="q">application/pdf</subfield><subfield code="u">http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=024635075&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA</subfield><subfield code="3">Inhaltsverzeichnis</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-024635075</subfield></datafield></record></collection> |
| id | DE-604.BV039774151 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-10T00:11:09Z |
| institution | BVB |
| isbn | 9780521109413 9780521563291 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-024635075 |
| open_access_boolean | |
| publishDateSort | 0000 |
| publisher | Cambridge Univ. Press |
| record_format | marc |
| spelling | Mehlhorn, Kurt 1949- Verfasser (DE-588)139294201 aut LEDA a platform for combinatorial and geometric computing Kurt Mehlhorn ; Stefan Näher Paperback re-issue Cambridge [u.a.] Cambridge Univ. Press txt rdacontent n rdamedia nc rdacarrier Kombinatorik (DE-588)4031824-2 gnd rswk-swf LEDA Programmbibliothek (DE-588)4590532-0 gnd rswk-swf Abstrakter Datentyp (DE-588)4120827-4 gnd rswk-swf Algorithmus (DE-588)4001183-5 gnd rswk-swf Algorithmische Geometrie (DE-588)4130267-9 gnd rswk-swf Kombinatorik (DE-588)4031824-2 s Algorithmische Geometrie (DE-588)4130267-9 s Abstrakter Datentyp (DE-588)4120827-4 s Algorithmus (DE-588)4001183-5 s DE-604 LEDA Programmbibliothek (DE-588)4590532-0 s Näher, Stefan Verfasser (DE-588)1209954923 aut Digitalisierung UB Bayreuth application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=024635075&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis |
| spellingShingle | Mehlhorn, Kurt 1949- Näher, Stefan LEDA a platform for combinatorial and geometric computing Kombinatorik (DE-588)4031824-2 gnd LEDA Programmbibliothek (DE-588)4590532-0 gnd Abstrakter Datentyp (DE-588)4120827-4 gnd Algorithmus (DE-588)4001183-5 gnd Algorithmische Geometrie (DE-588)4130267-9 gnd |
| subject_GND | (DE-588)4031824-2 (DE-588)4590532-0 (DE-588)4120827-4 (DE-588)4001183-5 (DE-588)4130267-9 |
| title | LEDA a platform for combinatorial and geometric computing |
| title_auth | LEDA a platform for combinatorial and geometric computing |
| title_exact_search | LEDA a platform for combinatorial and geometric computing |
| title_full | LEDA a platform for combinatorial and geometric computing Kurt Mehlhorn ; Stefan Näher |
| title_fullStr | LEDA a platform for combinatorial and geometric computing Kurt Mehlhorn ; Stefan Näher |
| title_full_unstemmed | LEDA a platform for combinatorial and geometric computing Kurt Mehlhorn ; Stefan Näher |
| title_short | LEDA |
| title_sort | leda a platform for combinatorial and geometric computing |
| title_sub | a platform for combinatorial and geometric computing |
| topic | Kombinatorik (DE-588)4031824-2 gnd LEDA Programmbibliothek (DE-588)4590532-0 gnd Abstrakter Datentyp (DE-588)4120827-4 gnd Algorithmus (DE-588)4001183-5 gnd Algorithmische Geometrie (DE-588)4130267-9 gnd |
| topic_facet | Kombinatorik LEDA Programmbibliothek Abstrakter Datentyp Algorithmus Algorithmische Geometrie |
| url | http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=024635075&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| work_keys_str_mv | AT mehlhornkurt ledaaplatformforcombinatorialandgeometriccomputing AT naherstefan ledaaplatformforcombinatorialandgeometriccomputing |