Name
Title | ||
|---|---|---|
Scalable algorithms for bichromatic line segment intersection problems on coarse grained multicomputers |
Abstract | ||
|---|---|---|
We present output-sensitive scalable parallel algorithms for bichromatic line segment intersection problems for the coarse grained multicomputer model. Under the assumption that n p 2 , where n is the number of line segments and p the number of processors, we obtain an intersection counting algorithm with a time complexity of O( n log n log p p + T s (n log p; p)), where T s (m; p) is the time used to sort m items on a p processor machine. The first term captures the time spent in sequential... |
Year | DOI | Venue |
|---|---|---|
1993 | 10.1007/3-540-57155-8_255 | Int. J. Comput. Geometry Appl. |
Keywords | DocType | Volume |
bichromatic line segment intersection,scalable algorithms,coarse grained multicomputers,time complexity,parallel algorithms,parallel algorithm,computational geometry,data structures | Conference | 6 |
Issue | ISBN | Citations |
4 | 3-540-57155-8 | 8 |
PageRank | References | Authors |
0.83 | 8 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Olivier Devillers | 1 | 184 | 23.75 |
| Andreas Fabri | 2 | 478 | 27.42 |