The limited workspace model for geometric algorithms:
Saved in:
| Main Author: | |
|---|---|
| Format: | Thesis Electronic eBook |
| Language: | English |
| Published: |
Berlin
2018
|
| Subjects: | |
| Online Access: | Volltext |
| Physical Description: | 1 Online-Ressource (vii, 105 Seiten) Diagramme |
Staff View
MARC
| LEADER | 00000nmm a2200000 c 4500 | ||
|---|---|---|---|
| 001 | BV046032542 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 006 | a m||| 00||| | ||
| 007 | cr|uuu---uuuuu | ||
| 008 | 190703s2018 |||| o||u| ||||||eng d | ||
| 024 | 7 | |a urn:nbn:de:kobv:188-refubium-24954-9 |2 urn | |
| 035 | |a (OCoLC)1108332336 | ||
| 035 | |a (DE-599)BVBBV046032542 | ||
| 040 | |a DE-604 |b ger |e rda | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-188 | ||
| 084 | |a 000 |2 FUB | ||
| 084 | |a 516 |2 FUB | ||
| 100 | 1 | |a Banyassady, Bahareh |e Verfasser |0 (DE-588)118976766X |4 aut | |
| 245 | 1 | 0 | |a The limited workspace model for geometric algorithms |c by Bahareh Banyassady |
| 264 | 1 | |a Berlin |c 2018 | |
| 300 | |a 1 Online-Ressource (vii, 105 Seiten) |b Diagramme | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b c |2 rdamedia | ||
| 338 | |b cr |2 rdacarrier | ||
| 502 | |b Dissertation |c Freie Universität Berlin |d 2019 | ||
| 650 | 4 | |a Computational Geometry | |
| 650 | 4 | |a Data Structures and Algorithms | |
| 650 | 4 | |a Limited Workspace Model | |
| 650 | 4 | |a Read-only Input | |
| 650 | 4 | |a Voronoi Diagrams | |
| 650 | 4 | |a Euclidean Minimum Spanning Trees | |
| 650 | 4 | |a K-Visibility Regions | |
| 655 | 7 | |0 (DE-588)4113937-9 |a Hochschulschrift |2 gnd-content | |
| 776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe |a Banyassady, Bahareh |t The limited workspace model for geometric algorithms |w (DE-604)BV046032617 |
| 856 | 4 | 0 | |u https://refubium.fu-berlin.de/handle/fub188/24954 |x Resolving-System |z kostenfrei |3 Volltext |
| 912 | |a ebook | ||
| 999 | |a oai:aleph.bib-bvb.de:BVB01-031414390 | ||
Record in the Search Index
| _version_ | 1804180284289056768 |
|---|---|
| any_adam_object | |
| author | Banyassady, Bahareh |
| author_GND | (DE-588)118976766X |
| author_facet | Banyassady, Bahareh |
| author_role | aut |
| author_sort | Banyassady, Bahareh |
| author_variant | b b bb |
| building | Verbundindex |
| bvnumber | BV046032542 |
| collection | ebook |
| ctrlnum | (OCoLC)1108332336 (DE-599)BVBBV046032542 |
| format | Thesis Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01553nmm a2200433 c 4500</leader><controlfield tag="001">BV046032542</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="006">a m||| 00||| </controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">190703s2018 |||| o||u| ||||||eng d</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">urn:nbn:de:kobv:188-refubium-24954-9</subfield><subfield code="2">urn</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)1108332336</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV046032542</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rda</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-188</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">000</subfield><subfield code="2">FUB</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">516</subfield><subfield code="2">FUB</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Banyassady, Bahareh</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)118976766X</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">The limited workspace model for geometric algorithms</subfield><subfield code="c">by Bahareh Banyassady</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Berlin</subfield><subfield code="c">2018</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 Online-Ressource (vii, 105 Seiten)</subfield><subfield code="b">Diagramme</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">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="502" ind1=" " ind2=" "><subfield code="b">Dissertation</subfield><subfield code="c">Freie Universität Berlin</subfield><subfield code="d">2019</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computational Geometry</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Data Structures and Algorithms</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Limited Workspace Model</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Read-only Input</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Voronoi Diagrams</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Euclidean Minimum Spanning Trees</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">K-Visibility Regions</subfield></datafield><datafield tag="655" ind1=" " ind2="7"><subfield code="0">(DE-588)4113937-9</subfield><subfield code="a">Hochschulschrift</subfield><subfield code="2">gnd-content</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druck-Ausgabe</subfield><subfield code="a">Banyassady, Bahareh</subfield><subfield code="t">The limited workspace model for geometric algorithms</subfield><subfield code="w">(DE-604)BV046032617</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://refubium.fu-berlin.de/handle/fub188/24954</subfield><subfield code="x">Resolving-System</subfield><subfield code="z">kostenfrei</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ebook</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-031414390</subfield></datafield></record></collection> |
| genre | (DE-588)4113937-9 Hochschulschrift gnd-content |
| genre_facet | Hochschulschrift |
| id | DE-604.BV046032542 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-10T08:33:19Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-031414390 |
| oclc_num | 1108332336 |
| open_access_boolean | 1 |
| owner | DE-188 |
| owner_facet | DE-188 |
| physical | 1 Online-Ressource (vii, 105 Seiten) Diagramme |
| psigel | ebook |
| publishDate | 2018 |
| publishDateSearch | 2018 |
| publishDateSort | 2018 |
| record_format | marc |
| spelling | Banyassady, Bahareh Verfasser (DE-588)118976766X aut The limited workspace model for geometric algorithms by Bahareh Banyassady Berlin 2018 1 Online-Ressource (vii, 105 Seiten) Diagramme txt rdacontent c rdamedia cr rdacarrier Dissertation Freie Universität Berlin 2019 Computational Geometry Data Structures and Algorithms Limited Workspace Model Read-only Input Voronoi Diagrams Euclidean Minimum Spanning Trees K-Visibility Regions (DE-588)4113937-9 Hochschulschrift gnd-content Erscheint auch als Druck-Ausgabe Banyassady, Bahareh The limited workspace model for geometric algorithms (DE-604)BV046032617 https://refubium.fu-berlin.de/handle/fub188/24954 Resolving-System kostenfrei Volltext |
| spellingShingle | Banyassady, Bahareh The limited workspace model for geometric algorithms Computational Geometry Data Structures and Algorithms Limited Workspace Model Read-only Input Voronoi Diagrams Euclidean Minimum Spanning Trees K-Visibility Regions |
| subject_GND | (DE-588)4113937-9 |
| title | The limited workspace model for geometric algorithms |
| title_auth | The limited workspace model for geometric algorithms |
| title_exact_search | The limited workspace model for geometric algorithms |
| title_full | The limited workspace model for geometric algorithms by Bahareh Banyassady |
| title_fullStr | The limited workspace model for geometric algorithms by Bahareh Banyassady |
| title_full_unstemmed | The limited workspace model for geometric algorithms by Bahareh Banyassady |
| title_short | The limited workspace model for geometric algorithms |
| title_sort | the limited workspace model for geometric algorithms |
| topic | Computational Geometry Data Structures and Algorithms Limited Workspace Model Read-only Input Voronoi Diagrams Euclidean Minimum Spanning Trees K-Visibility Regions |
| topic_facet | Computational Geometry Data Structures and Algorithms Limited Workspace Model Read-only Input Voronoi Diagrams Euclidean Minimum Spanning Trees K-Visibility Regions Hochschulschrift |
| url | https://refubium.fu-berlin.de/handle/fub188/24954 |
| work_keys_str_mv | AT banyassadybahareh thelimitedworkspacemodelforgeometricalgorithms |