The visibility problem for single valued surface (z=f(x,y)): the analysis and the parallelization of algorithms
Abstract: "The visibility problem (hidden line, hidden surface elimination) provides interesting algorithmical solution for different object scenes. This paper considers the visibility algorithms for single- valued surface (z = f(x, y)) given above the regular grid. The 3-D point test algorithm...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
München
1993
|
| Schriftenreihe: | Technische Universität <München>: TUM-I
9318 |
| Schlagworte: | |
| Zusammenfassung: | Abstract: "The visibility problem (hidden line, hidden surface elimination) provides interesting algorithmical solution for different object scenes. This paper considers the visibility algorithms for single- valued surface (z = f(x, y)) given above the regular grid. The 3-D point test algorithm, the level comparison algorithm and the corridor algorithm are under the consideration. Their suitability for parallel implementation is investigated and their analysis and drawbacks are described. The parallelisation of 3-D point test algorithm and of corridor algorithm is proposed. The systolic array for corridor algorithm reduces the time complexity O(n²) of algorithm to O(n)." |
| Beschreibung: | 32 S. graph. Darst. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV009130222 | ||
| 003 | DE-604 | ||
| 005 | 20040414 | ||
| 007 | t | ||
| 008 | 940307s1993 gw d||| t||| 00||| eng d | ||
| 016 | 7 | |a 940414236 |2 DE-101 | |
| 035 | |a (OCoLC)32526809 | ||
| 035 | |a (DE-599)BVBBV009130222 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 044 | |a gw |c DE | ||
| 049 | |a DE-29T |a DE-12 |a DE-91G | ||
| 100 | 1 | |a Slavkovsky, Peter |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a The visibility problem for single valued surface (z=f(x,y)) |b the analysis and the parallelization of algorithms |c Peter Slavkovsky |
| 264 | 1 | |a München |c 1993 | |
| 300 | |a 32 S. |b graph. Darst. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Technische Universität <München>: TUM-I |v 9318 | |
| 490 | 1 | |a Sonderforschungsbereich Methoden und Werkzeuge für die Nutzung Paralleler Rechnerarchitekturen: SFB-Bericht / A |v 1993,9 | |
| 520 | 3 | |a Abstract: "The visibility problem (hidden line, hidden surface elimination) provides interesting algorithmical solution for different object scenes. This paper considers the visibility algorithms for single- valued surface (z = f(x, y)) given above the regular grid. The 3-D point test algorithm, the level comparison algorithm and the corridor algorithm are under the consideration. Their suitability for parallel implementation is investigated and their analysis and drawbacks are described. The parallelisation of 3-D point test algorithm and of corridor algorithm is proposed. The systolic array for corridor algorithm reduces the time complexity O(n²) of algorithm to O(n)." | |
| 650 | 4 | |a Computer graphics | |
| 810 | 2 | |a A |t Sonderforschungsbereich Methoden und Werkzeuge für die Nutzung Paralleler Rechnerarchitekturen: SFB-Bericht |v 1993,9 |w (DE-604)BV004627888 |9 1993,9 | |
| 830 | 0 | |a Technische Universität <München>: TUM-I |v 9318 |w (DE-604)BV006185376 |9 9318 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-006051786 | ||
Datensatz im Suchindex
| _version_ | 1804123546477133824 |
|---|---|
| any_adam_object | |
| author | Slavkovsky, Peter |
| author_facet | Slavkovsky, Peter |
| author_role | aut |
| author_sort | Slavkovsky, Peter |
| author_variant | p s ps |
| building | Verbundindex |
| bvnumber | BV009130222 |
| ctrlnum | (OCoLC)32526809 (DE-599)BVBBV009130222 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01987nam a2200337 cb4500</leader><controlfield tag="001">BV009130222</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20040414 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">940307s1993 gw d||| t||| 00||| eng d</controlfield><datafield tag="016" ind1="7" ind2=" "><subfield code="a">940414236</subfield><subfield code="2">DE-101</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)32526809</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV009130222</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakddb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="044" ind1=" " ind2=" "><subfield code="a">gw</subfield><subfield code="c">DE</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-29T</subfield><subfield code="a">DE-12</subfield><subfield code="a">DE-91G</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Slavkovsky, Peter</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">The visibility problem for single valued surface (z=f(x,y))</subfield><subfield code="b">the analysis and the parallelization of algorithms</subfield><subfield code="c">Peter Slavkovsky</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">München</subfield><subfield code="c">1993</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">32 S.</subfield><subfield code="b">graph. Darst.</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="490" ind1="1" ind2=" "><subfield code="a">Technische Universität <München>: TUM-I</subfield><subfield code="v">9318</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">Sonderforschungsbereich Methoden und Werkzeuge für die Nutzung Paralleler Rechnerarchitekturen: SFB-Bericht / A</subfield><subfield code="v">1993,9</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "The visibility problem (hidden line, hidden surface elimination) provides interesting algorithmical solution for different object scenes. This paper considers the visibility algorithms for single- valued surface (z = f(x, y)) given above the regular grid. The 3-D point test algorithm, the level comparison algorithm and the corridor algorithm are under the consideration. Their suitability for parallel implementation is investigated and their analysis and drawbacks are described. The parallelisation of 3-D point test algorithm and of corridor algorithm is proposed. The systolic array for corridor algorithm reduces the time complexity O(n²) of algorithm to O(n)."</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer graphics</subfield></datafield><datafield tag="810" ind1="2" ind2=" "><subfield code="a">A</subfield><subfield code="t">Sonderforschungsbereich Methoden und Werkzeuge für die Nutzung Paralleler Rechnerarchitekturen: SFB-Bericht</subfield><subfield code="v">1993,9</subfield><subfield code="w">(DE-604)BV004627888</subfield><subfield code="9">1993,9</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Technische Universität <München>: TUM-I</subfield><subfield code="v">9318</subfield><subfield code="w">(DE-604)BV006185376</subfield><subfield code="9">9318</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-006051786</subfield></datafield></record></collection> |
| id | DE-604.BV009130222 |
| illustrated | Illustrated |
| indexdate | 2024-07-09T17:31:29Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-006051786 |
| oclc_num | 32526809 |
| open_access_boolean | |
| owner | DE-29T DE-12 DE-91G DE-BY-TUM |
| owner_facet | DE-29T DE-12 DE-91G DE-BY-TUM |
| physical | 32 S. graph. Darst. |
| publishDate | 1993 |
| publishDateSearch | 1993 |
| publishDateSort | 1993 |
| record_format | marc |
| series | Technische Universität <München>: TUM-I |
| series2 | Technische Universität <München>: TUM-I Sonderforschungsbereich Methoden und Werkzeuge für die Nutzung Paralleler Rechnerarchitekturen: SFB-Bericht / A |
| spelling | Slavkovsky, Peter Verfasser aut The visibility problem for single valued surface (z=f(x,y)) the analysis and the parallelization of algorithms Peter Slavkovsky München 1993 32 S. graph. Darst. txt rdacontent n rdamedia nc rdacarrier Technische Universität <München>: TUM-I 9318 Sonderforschungsbereich Methoden und Werkzeuge für die Nutzung Paralleler Rechnerarchitekturen: SFB-Bericht / A 1993,9 Abstract: "The visibility problem (hidden line, hidden surface elimination) provides interesting algorithmical solution for different object scenes. This paper considers the visibility algorithms for single- valued surface (z = f(x, y)) given above the regular grid. The 3-D point test algorithm, the level comparison algorithm and the corridor algorithm are under the consideration. Their suitability for parallel implementation is investigated and their analysis and drawbacks are described. The parallelisation of 3-D point test algorithm and of corridor algorithm is proposed. The systolic array for corridor algorithm reduces the time complexity O(n²) of algorithm to O(n)." Computer graphics A Sonderforschungsbereich Methoden und Werkzeuge für die Nutzung Paralleler Rechnerarchitekturen: SFB-Bericht 1993,9 (DE-604)BV004627888 1993,9 Technische Universität <München>: TUM-I 9318 (DE-604)BV006185376 9318 |
| spellingShingle | Slavkovsky, Peter The visibility problem for single valued surface (z=f(x,y)) the analysis and the parallelization of algorithms Technische Universität <München>: TUM-I Computer graphics |
| title | The visibility problem for single valued surface (z=f(x,y)) the analysis and the parallelization of algorithms |
| title_auth | The visibility problem for single valued surface (z=f(x,y)) the analysis and the parallelization of algorithms |
| title_exact_search | The visibility problem for single valued surface (z=f(x,y)) the analysis and the parallelization of algorithms |
| title_full | The visibility problem for single valued surface (z=f(x,y)) the analysis and the parallelization of algorithms Peter Slavkovsky |
| title_fullStr | The visibility problem for single valued surface (z=f(x,y)) the analysis and the parallelization of algorithms Peter Slavkovsky |
| title_full_unstemmed | The visibility problem for single valued surface (z=f(x,y)) the analysis and the parallelization of algorithms Peter Slavkovsky |
| title_short | The visibility problem for single valued surface (z=f(x,y)) |
| title_sort | the visibility problem for single valued surface z f x y the analysis and the parallelization of algorithms |
| title_sub | the analysis and the parallelization of algorithms |
| topic | Computer graphics |
| topic_facet | Computer graphics |
| volume_link | (DE-604)BV004627888 (DE-604)BV006185376 |
| work_keys_str_mv | AT slavkovskypeter thevisibilityproblemforsinglevaluedsurfacezfxytheanalysisandtheparallelizationofalgorithms |