메뉴 건너뛰기




Volumn 2387, Issue , 2002, Pages 456-466

An experimental study and comparison of topological peeling and topological walk

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL MATHEMATICS;

EID: 23044532359     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45655-4_49     Document Type: Conference Paper
Times cited : (1)

References (23)
  • 1
    • 84949193801 scopus 로고
    • Topological sweeping in three dimensions,” Lecture Notes in Computer Science
    • Springer-Verlag
    • E.G. Anagnostou, L.J. Guibas, and V.G. Polimenis, “Topological sweeping in three dimensions,” Lecture Notes in Computer Science, Vol. 450, Proc. Int’l Symp. on Algorithms, Springer-Verlag, 1990, pp. 310-317.
    • (1990) Proc. Int’l Symp. On Algorithms , vol.450 , pp. 310-317
    • Anagnostou, E.G.1    Guibas, L.J.2    Polimenis, V.G.3
  • 6
    • 0021788174 scopus 로고
    • The power of geometric duality
    • B. Chazelle, L.J. Guibas, and D.T. Lee, “The power of geometric duality,” BIT, Vol. 25, 1985, pp. 76-90.
    • (1985) BIT , vol.25 , pp. 76-90
    • Chazelle, B.1    Guibas, L.J.2    Lee, D.T.3
  • 13
    • 0022714544 scopus 로고
    • Constructing arrangements of lines and hyperplanes with applications
    • H. Edelsbrunner, J. O’Rourke, and R. Seidel, “Constructing arrangements of lines and hyperplanes with applications,” SIAM J. Computing, Vol. 15, 1986, pp. 341-363.
    • (1986) SIAM J. Computing , vol.15 , pp. 341-363
    • Edelsbrunner, H.1    O’Rourke, J.2    Seidel, R.3
  • 14
    • 0006664807 scopus 로고
    • Computing median-of-squares regression lines and guided topological sweep
    • H. Edelsbrunner and D. Souvaine, “Computing median-of-squares regression lines and guided topological sweep,” Journal of the American Statistical Association, Vol. 85, 1990, pp. 115-119.
    • (1990) Journal of the American Statistical Association , vol.85 , pp. 115-119
    • Edelsbrunner, H.1    Souvaine, D.2
  • 15
    • 0022663946 scopus 로고
    • Constructing belts in two-dimensional arrangements with applications
    • H. Edelsbrunner and E. Welzl, “Constructing belts in two-dimensional arrangements with applications,” SIAM J. Computing, Vol. 15, 1986, pp. 271-284.
    • (1986) SIAM J. Computing , vol.15 , pp. 271-284
    • Edelsbrunner, H.1    Welzl, E.2
  • 18
    • 0022436559 scopus 로고
    • Sorting Jordan sequences in linear time using level-linked search trees
    • K. Hoffman, K. Mehlhorn, R. Rosenstiehl, and R. Tarjan, “Sorting Jordan sequences in linear time using level-linked search trees,” Information and Control, Vol. 68, 1986, pp. 170-184.
    • (1986) Information and Control , vol.68 , pp. 170-184
    • Hoffman, K.1    Mehlhorn, K.2    Rosenstiehl, R.3    Tarjan, R.4
  • 22
    • 84976797161 scopus 로고
    • Plane-sweep algorithms for intersecting geometric figures
    • J. Nievergelt and F.P. Preparata, “Plane-sweep algorithms for intersecting geometric figures,” Comm. of the ACM, Vol. 25, No. 10, 1982, pp. 739-747.
    • (1982) Comm. Of the ACM , vol.25 , Issue.10 , pp. 739-747
    • Nievergelt, J.1    Preparata, F.P.2


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