SCOPUS 정보 검색 플랫폼 - 논문 보기

메뉴 건너뛰기

Journal of Computer and System Sciences

Volumn 39, Issue 2, 1989, Pages 153-165

Parallel construction of subdivision hierarchies

(2) Dadoun, N a Kirkpatrick, D G a

a UNIVERSITY OF BRITISH COLUMBIA (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0038491533 PISSN: 00220000 EISSN: 10902724 Source Type: Journal
DOI: 10.1016/0022-0000(89)90042-1 Document Type: Article

Times cited : (23)

References (19)

1
- 0022205584
- Parallel computational geometry (extended abstract)
- (1985) Proceedings, 26th IEEE Symposium on Foundations of Computer Science , pp. 468-477
- Aggarwal¹ Chazelle² Guibas³ O'Dunlaing⁴ Yap⁵

2
- 52449145273
- Parallel computational geometry
- (1988) Algorithmica , vol.3 , pp. 535-548
- Aggarwal¹ Chazelle² Guibas³ O'Dunlaing⁴ Yap⁵

3
- 78349257287
- Efficient plane sweeping in parallel (preliminary version)
- (1986) Proceedings, 2nd ACM Symposium on Computational Geometry , pp. 216-225
- Atallah¹ Goodrich²

4
- 0002854989
- Deterministic coin tossing and accelerating cascades: Micro and macro techniques for designing parallel algorithms
- (1986) Proceedings, 18th ACM Symposium on Theory of Computing , pp. 206-219
- Cole¹ Vishkin²

5
- 85034838447
- Parallel processing for efficient subdivision search
- (1987) Proceedings, 3rd ACM Symposium on Computational Geometry , pp. 204-214
- Dadoun¹ Kirkpatrick²

6
- 84915841695
- A Parallel Algorithm for Finding Maximal Independent Sets in Planar Graphs
- J. Discrete Appl. Math., University of British Columbia, to appear
- (1987) Computer Science Dept. Technical Report, TR 87-15
- Dadoun¹ Kirkpatrick²

7
- 85037037823
- Fast detection of polyhedral intersections
- (1982) Proceedings, International Colloquium on Automata, Languages and Programming , pp. 154-165
- Dobkin¹ Kirkpatrick²

8
- 0001520324
- Fast detection of polyhedral intersection
- (1983) Theoret. Comput. Sci. , vol.27 , pp. 241-253
- Dobkin¹ Kirkpatrick²

9
- 33749778536
- A linear time algorithm for determining the separation of convex polyhedra
- (1985) J. Algorithms , vol.6 , Issue.3 , pp. 381-392
- Dobkin¹ Kirkpatrick²

10
- 84915855475
- D. P. Dobkin and D. G. Kirkpatrick, Fast algorithms for preprocessed polyhedral intersection detection, in preparation.

11
- 0346233742
- A new point-location algorithm and its practical efficiency—comparison with existing algorithms
- (1984) ACM Transactions on Graphics , vol.3 , Issue.2 , pp. 86-109
- Edahiro¹ Kokubo² Asano³

12
- 0023547501
- Parallel symmetry-breaking in sparse graphs
- (1987) Proceedings, 16th ACM Symposium on Theory of Computing , pp. 315-324
- Goldberg¹ Plotkin² Shannon³

13
- 84909710803
- Parallel 5-colouring of planar graphs
- (1987) Proceedings, International Colloquium on Automata, Languages and Programming , pp. 304-313
- Hagerup¹ Chrobak² Diks³

14
- 84911792466
- preprint
- (1987) Parallel algorithms for computing maximal independent sets in trees and for updating minimum spanning trees
- Jung¹ Mehlhorn²

15
- 0002429537
- Optimal search in planar subdivisions
- (1983) SIAM Journal on Computing , vol.12 , Issue.1 , pp. 28-35
- Kirkpatrick¹

16
- 49349124344
- A batching method for coloring planar graphs
- (1978) Inform. Process. Lett. , vol.7 , Issue.4 , pp. 185-188
- Lipton¹ Miller²

17
- 0004236671
- Holt, Rinehart & Winston, New York
- (1985) The Analysis of Algorithms
- Purdom¹ Brown²

18
- 0017453547
- Convex hulls of finite sets of points in two and three dimensions
- (1978) Communications of the ACM , vol.20 , pp. 87-93
- Preparata¹ Hong²

19
- 0004129817
- The Complexity of Parallel Computation
- Dept. of Computer Science, Cornell University, Ithaca, New York
- (1979) Technical Report TR 79-387
- Wylie¹

* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.