메뉴 건너뛰기




Volumn , Issue , 2006, Pages 246-251

An RNG-based heuristic for curve reconstruction

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL METHODS; CURVE FITTING; GRAPHIC METHODS; IMAGE RECONSTRUCTION;

EID: 34250358681     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISVD.2006.8     Document Type: Conference Paper
Times cited : (4)

References (11)
  • 2
    • 0032028909 scopus 로고    scopus 로고
    • The crust and the β-skeleton: Combinatorial curve reconst ruction
    • N. Amenta, M. Bern, and D. Eppstein. The crust and the β-skeleton: Combinatorial curve reconst ruction. In Graphical Models and Image processing, volume 60, pages 125-135, 1998.
    • (1998) Graphical Models and Image processing , vol.60 , pp. 125-135
    • Amenta, N.1    Bern, M.2    Eppstein, D.3
  • 3
    • 0030679064 scopus 로고    scopus 로고
    • D. Attali. r-regular shape reconstruction from unorganized points. In Proc. 13th Annu. ACM Sympos. Comput. Geom., pages 248-253, 1997.
    • D. Attali. r-regular shape reconstruction from unorganized points. In Proc. 13th Annu. ACM Sympos. Comput. Geom., pages 248-253, 1997.
  • 4
    • 0001514510 scopus 로고
    • Continuous skeleton computation by Voronoi diagram
    • J. W. Brandt and V. R. Algazi. Continuous skeleton computation by Voronoi diagram. CVGIP: Image Understanding, 55(3):329-338, 1992.
    • (1992) CVGIP: Image Understanding , vol.55 , Issue.3 , pp. 329-338
    • Brandt, J.W.1    Algazi, V.R.2
  • 5
    • 0032785131 scopus 로고    scopus 로고
    • A simple provable algorithm for curve reconstruction
    • T. Dey and P. Kumar. A simple provable algorithm for curve reconstruction. In ACM-SIAM Symposium Discr. Algorithms, pages 893-894, 1999.
    • (1999) ACM-SIAM Symposium Discr. Algorithms , pp. 893-894
    • Dey, T.1    Kumar, P.2
  • 7
    • 0034365059 scopus 로고    scopus 로고
    • Curve reconstruction, the travelling salesman problem and menger's theorem
    • J. Giesen. Curve reconstruction, the travelling salesman problem and menger's theorem. Discr. Comput. Geom., 24:577-603, 2000.
    • (2000) Discr. Comput. Geom , vol.24 , pp. 577-603
    • Giesen, J.1
  • 8
    • 0032683171 scopus 로고    scopus 로고
    • Crust and anti-crust: A one step boundary and skeleton extraction algorithm
    • C. M. Gold. Crust and anti-crust: a one step boundary and skeleton extraction algorithm. In 15th. ACM Symposium on Computational Geometry, pages 189-196, 1999.
    • (1999) 15th. ACM Symposium on Computational Geometry , pp. 189-196
    • Gold, C.M.1
  • 9
    • 17444386995 scopus 로고    scopus 로고
    • Reconstructing curves without delaunay computation
    • S. Guha and S. D. Tran. Reconstructing curves without delaunay computation. Algorithmica, 42:75-94, 2005.
    • (2005) Algorithmica , vol.42 , pp. 75-94
    • Guha, S.1    Tran, S.D.2
  • 10
    • 0026924875 scopus 로고
    • Relative neighborhood graphs and their relatives
    • J. W. Jaromczyk and G. T. Toussaint. Relative neighborhood graphs and their relatives. Proc. IEEE, 80(9):1502-1517, 1992.
    • (1992) Proc. IEEE , vol.80 , Issue.9 , pp. 1502-1517
    • Jaromczyk, J.W.1    Toussaint, G.T.2
  • 11
    • 0019213414 scopus 로고
    • The relative neighbourhood graph of a finite planar set
    • G. T. Toussaint. The relative neighbourhood graph of a finite planar set. Pattern Recogn., 12:261-268, 1980.
    • (1980) Pattern Recogn , vol.12 , pp. 261-268
    • Toussaint, G.T.1


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