메뉴 건너뛰기




Volumn 3617 LNCS, Issue , 2005, Pages 438-445

An approximation of the maximal inscribed convex set of a digital object

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; ITERATIVE METHODS; SET THEORY;

EID: 33745132734     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11553595_54     Document Type: Conference Paper
Times cited : (10)

References (9)
  • 3
    • 0030287090 scopus 로고    scopus 로고
    • On digital distance transforms in three dimensions
    • Borgefors, G.: On digital distance transforms in three dimensions. Computer Vision and Image Understanding 64 (1996) 368-376
    • (1996) Computer Vision and Image Understanding , vol.64 , pp. 368-376
    • Borgefors, G.1
  • 5
    • 33745142360 scopus 로고
    • Discrete and computational geometry approaches applied to a problem of figure approximation
    • Pietikäinen, M., Röning, J., eds., Oulo, Finland
    • Chassery, J.M.: Discrete and computational geometry approaches applied to a problem of figure approximation. In Pietikäinen, M., Röning, J., eds.: Proc. 6th Scandinavian Conference on Image Analysis, Oulo, Finland (1989) 856-859
    • (1989) Proc. 6th Scandinavian Conference on Image Analysis , pp. 856-859
    • Chassery, J.M.1
  • 6
    • 0010423824 scopus 로고
    • A polynomial solution for the potato-peeling problem
    • Chang, J.S., Yap, C.K.: A polynomial solution for the potato-peeling problem. Discrete & Computational Geometry 1 (1986) 155-182
    • (1986) Discrete & Computational Geometry , vol.1 , pp. 155-182
    • Chang, J.S.1    Yap, C.K.2
  • 9
    • 0023523523 scopus 로고
    • Computing distance transformations in convex and non-convex domains
    • Piper, J., Granum, E.: Computing distance transformations in convex and non-convex domains. Pattern Recognition 20 (1987) 599-615
    • (1987) Pattern Recognition , vol.20 , pp. 599-615
    • Piper, J.1    Granum, E.2


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