SCOPUS 정보 검색 플랫폼

Volumn 62, Issue 3, 1997, Pages 121-126

Dynamic connectivity in digital images

Author keywords

Computational complexity; Dynamic planar connectivity; Go; Image processing; Lines of action; Lower bounds; Percolation

Indexed keywords

EID: 0038425797 PISSN: 00200190 EISSN: None Source Type: Journal
DOI: 10.1016/s0020-0190(97)00056-2 Document Type: Article

Times cited : (7)

References (12)

1
- 0006539122
- Polynomial-time solutions to image segmentation
- T. Asano, D.Z. Chen, N. Katoh and T. Tokuyama, Polynomial-time solutions to image segmentation, in: Proc. 7th ACM-SIAM Symp. on Discrete Algorithms (1996) 104-113.
- (1996) Proc. 7th ACM-SIAM Symp. on Discrete Algorithms , pp. 104-113
- Asano, T.¹ Chen, D.Z.² Katoh, N.³ Tokuyama, T.⁴

2
- 0004310617
- Ph.D. Thesis, School of Mathematical Sciences, Tel Aviv University
- A.M. Ben-Amram. On the power of random access machines, Ph.D. Thesis, School of Mathematical Sciences, Tel Aviv University, 1994.
- (1994) On the Power of Random Access Machines
- Ben-Amram, A.M.¹

3
- 0026844063
- A general approach to connected-component labeling for arbitrary image representations
- M.B. Dillencourt, H. Samet and M. Tamminen, A general approach to connected-component labeling for arbitrary image representations, J. ACM 39 (1992) 253-280.
- (1992) J. ACM , vol.39 , pp. 253-280
- Dillencourt, M.B.¹ Samet, H.² Tamminen, M.³

4
- 0043066746
- D. Dyer, Lines of Action, http://www.andromeda.com/ people/ddyer/loa/loa.html
- Lines of Action
- Dyer, D.¹

5
- 0027208505
- Separator-based sparsification for dynamic planar graph algorithms
- D. Eppstein, Z. Galil, G.F. Italiano and T. Spencer, Separator-based sparsification for dynamic planar graph algorithms, in: Proc. 25th ACM Symp. on Theory of Computing (1993) 208-217.
- (1993) Proc. 25th ACM Symp. on Theory of Computing , pp. 208-217
- Eppstein, D.¹ Galil, Z.² Italiano, G.F.³ Spencer, T.⁴

6
- 38249015356
- Maintenance of a minimum spanning forest in a dynamic plane graph
- D. Eppstein, G.F. Italiano, R. Tamassia, R.E. Tarjan, J. Westbrook and M. Yung, Maintenance of a minimum spanning forest in a dynamic plane graph, J. Algorithms 13 (1992) 33-54.
- (1992) J. Algorithms , vol.13 , pp. 33-54
- Eppstein, D.¹ Italiano, G.F.² Tamassia, R.³ Tarjan, R.E.⁴ Westbrook, J.⁵ Yung, M.⁶

8
- 0024860011
- The cell probe complexity of dynamic data structures
- M.L. Fredman and M.E. Saks, The cell probe complexity of dynamic data structures, in: Proc. 19th ACM Symp. on Theory of Computing (1989) 345-354.
- (1989) Proc. 19th ACM Symp. on Theory of Computing , pp. 345-354
- Fredman, M.L.¹ Saks, M.E.²

9
- 0028015423
- Improved data structures for fully dynamic biconnectivity
- M.R. Henzinger, Improved data structures for fully dynamic biconnectivity, in: Proc. 26th ACM Symp. on Theory of Computing (1994) 686-695.
- (1994) Proc. 26th ACM Symp. on Theory of Computing , pp. 686-695
- Henzinger, M.R.¹

10
- 0007894593
- Springer, Berlin
- D.N.L. Levy, ed. Computer Games II (Springer, Berlin, 1988).
- (1988) Computer Games II
- Levy, D.N.L.¹

11
- 0037807137
- Dover, New York
- S. Sackson, A Gamut of Games (Dover, New York, 1992).
- (1992) A Gamut of Games
- Sackson, S.¹

12
- 0024865159
- Changes in connectivity in active contour models
- R. Samadani, Changes in connectivity in active contour models, in: Proc. IEEE Workshop on Visual Motion (1989) 337-343.
- (1989) Proc. IEEE Workshop on Visual Motion , pp. 337-343
- Samadani, R.¹

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