Parallel algorithms for the segment-dragging problem:
Gespeichert in:
| Beteilige Person: | |
|---|---|
| Format: | Buch |
| Sprache: | Englisch |
| Veröffentlicht: |
Seattle, Wash.
1990
|
| Schriftenreihe: | University of Washington <Seattle, Wash.> / Department of Computer Science: Technical report
90,1,5 |
| Schlagwörter: | |
| Abstract: | Abstract: "We address a geometric problem called the segment dragging. We have n 'obstacles' in the plane and want to preprocess them so that, given a query vertical line segment s, intersecting no obstacles, the first obstacle hit by s when we drag s horizontally to the right can be found efficiently. We present an O(log n) time, O(n) processor parallel algorithm for preprocessing when the obstacles are points or non- intersecting line segments. After preprocessing, a query can be answered in O(log n) time using a single processor. Our model of parallel computation is the EREW PRAM." |
| Umfang: | 8 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV009260374 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t| | ||
| 008 | 940313s1990 xx |||| 00||| eng d | ||
| 035 | |a (OCoLC)24448539 | ||
| 035 | |a (DE-599)BVBBV009260374 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-29T | ||
| 100 | 1 | |a Kim, Sung K. |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Parallel algorithms for the segment-dragging problem |c Sung Kwon Kim |
| 264 | 1 | |a Seattle, Wash. |c 1990 | |
| 300 | |a 8 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a University of Washington <Seattle, Wash.> / Department of Computer Science: Technical report |v 90,1,5 | |
| 520 | 3 | |a Abstract: "We address a geometric problem called the segment dragging. We have n 'obstacles' in the plane and want to preprocess them so that, given a query vertical line segment s, intersecting no obstacles, the first obstacle hit by s when we drag s horizontally to the right can be found efficiently. We present an O(log n) time, O(n) processor parallel algorithm for preprocessing when the obstacles are points or non- intersecting line segments. After preprocessing, a query can be answered in O(log n) time using a single processor. Our model of parallel computation is the EREW PRAM." | |
| 650 | 4 | |a Datenverarbeitung | |
| 650 | 4 | |a Algorithms | |
| 650 | 4 | |a Geometry |x Data processing | |
| 810 | 2 | |a Department of Computer Science: Technical report |t University of Washington <Seattle, Wash.> |v 90,1,5 |w (DE-604)BV008930431 |9 90,1,5 | |
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-006162250 | |
Datensatz im Suchindex
| _version_ | 1818951485805821952 |
|---|---|
| any_adam_object | |
| author | Kim, Sung K. |
| author_facet | Kim, Sung K. |
| author_role | aut |
| author_sort | Kim, Sung K. |
| author_variant | s k k sk skk |
| building | Verbundindex |
| bvnumber | BV009260374 |
| ctrlnum | (OCoLC)24448539 (DE-599)BVBBV009260374 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01620nam a2200313 cb4500</leader><controlfield tag="001">BV009260374</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t|</controlfield><controlfield tag="008">940313s1990 xx |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)24448539</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV009260374</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="049" ind1=" " ind2=" "><subfield code="a">DE-29T</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Kim, Sung K.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Parallel algorithms for the segment-dragging problem</subfield><subfield code="c">Sung Kwon Kim</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Seattle, Wash.</subfield><subfield code="c">1990</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">8 S.</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">University of Washington <Seattle, Wash.> / Department of Computer Science: Technical report</subfield><subfield code="v">90,1,5</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "We address a geometric problem called the segment dragging. We have n 'obstacles' in the plane and want to preprocess them so that, given a query vertical line segment s, intersecting no obstacles, the first obstacle hit by s when we drag s horizontally to the right can be found efficiently. We present an O(log n) time, O(n) processor parallel algorithm for preprocessing when the obstacles are points or non- intersecting line segments. After preprocessing, a query can be answered in O(log n) time using a single processor. Our model of parallel computation is the EREW PRAM."</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Datenverarbeitung</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Algorithms</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Geometry</subfield><subfield code="x">Data processing</subfield></datafield><datafield tag="810" ind1="2" ind2=" "><subfield code="a">Department of Computer Science: Technical report</subfield><subfield code="t">University of Washington <Seattle, Wash.></subfield><subfield code="v">90,1,5</subfield><subfield code="w">(DE-604)BV008930431</subfield><subfield code="9">90,1,5</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-006162250</subfield></datafield></record></collection> |
| id | DE-604.BV009260374 |
| illustrated | Not Illustrated |
| indexdate | 2024-12-20T09:35:14Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-006162250 |
| oclc_num | 24448539 |
| open_access_boolean | |
| owner | DE-29T |
| owner_facet | DE-29T |
| physical | 8 S. |
| publishDate | 1990 |
| publishDateSearch | 1990 |
| publishDateSort | 1990 |
| record_format | marc |
| series2 | University of Washington <Seattle, Wash.> / Department of Computer Science: Technical report |
| spelling | Kim, Sung K. Verfasser aut Parallel algorithms for the segment-dragging problem Sung Kwon Kim Seattle, Wash. 1990 8 S. txt rdacontent n rdamedia nc rdacarrier University of Washington <Seattle, Wash.> / Department of Computer Science: Technical report 90,1,5 Abstract: "We address a geometric problem called the segment dragging. We have n 'obstacles' in the plane and want to preprocess them so that, given a query vertical line segment s, intersecting no obstacles, the first obstacle hit by s when we drag s horizontally to the right can be found efficiently. We present an O(log n) time, O(n) processor parallel algorithm for preprocessing when the obstacles are points or non- intersecting line segments. After preprocessing, a query can be answered in O(log n) time using a single processor. Our model of parallel computation is the EREW PRAM." Datenverarbeitung Algorithms Geometry Data processing Department of Computer Science: Technical report University of Washington <Seattle, Wash.> 90,1,5 (DE-604)BV008930431 90,1,5 |
| spellingShingle | Kim, Sung K. Parallel algorithms for the segment-dragging problem Datenverarbeitung Algorithms Geometry Data processing |
| title | Parallel algorithms for the segment-dragging problem |
| title_auth | Parallel algorithms for the segment-dragging problem |
| title_exact_search | Parallel algorithms for the segment-dragging problem |
| title_full | Parallel algorithms for the segment-dragging problem Sung Kwon Kim |
| title_fullStr | Parallel algorithms for the segment-dragging problem Sung Kwon Kim |
| title_full_unstemmed | Parallel algorithms for the segment-dragging problem Sung Kwon Kim |
| title_short | Parallel algorithms for the segment-dragging problem |
| title_sort | parallel algorithms for the segment dragging problem |
| topic | Datenverarbeitung Algorithms Geometry Data processing |
| topic_facet | Datenverarbeitung Algorithms Geometry Data processing |
| volume_link | (DE-604)BV008930431 |
| work_keys_str_mv | AT kimsungk parallelalgorithmsforthesegmentdraggingproblem |