메뉴 건너뛰기




Volumn GM, Issue R/-, 2007, Pages 61-68

Concave hull: a Jt-Nearest neighbours approach for the computation of the region occupied by a set of points

Author keywords

Concave hull; Convex hull; K nearest neighbours.; Polygon, contour

Indexed keywords

A-PLANE; ALGORITHM PARAMETERS; ARBITRARY SETS; CONCAVE HULL; CONVEX HULL; K-NEAREST NEIGHBOURS.; NEAREST NEIGHBOUR; POLYGON, CONTOUR;

EID: 67649780910     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (167)

References (13)
  • 1
    • 49649136358 scopus 로고
    • An efficient algorithm for determining the convex hull of a planar set
    • Graham, R.L., 1972, An efficient algorithm for determining the convex hull of a planar set, Information Processing Letters1, 132-133
    • (1972) Information Processing Letters , vol.1 , pp. 132-133
    • Graham, R.L.1
  • 2
    • 0015599132 scopus 로고
    • On the identification of the convex hull of a finite set of points in the plane
    • Jarvis, R.A., 1973, On the identification of the convex hull of a finite set of points in the plane. Information Processing Letters 2,18-21
    • (1973) Information Processing Letters , vol.2 , pp. 18-21
    • Jarvis, R.A.1
  • 3
    • 0017453547 scopus 로고    scopus 로고
    • Preparata, F.P., and Hong, S.J., 1977, Convex hulls of finite sets of points in two and three dimensions. Communications of the ACM,20,2 (Feb.), 87-93.
    • Preparata, F.P., and Hong, S.J., 1977, Convex hulls of finite sets of points in two and three dimensions. Communications of the ACM,20,2 (Feb.), 87-93.
  • 4
    • 84976730298 scopus 로고
    • A new convex hull algorithm for planar sets
    • Dec
    • Eddy, W.F., 1977, A new convex hull algorithm for planar sets. ACM Transactions on Mathematical Software,3, 4 (Dec), 398-403.
    • (1977) ACM Transactions on Mathematical Software , vol.3 , Issue.4 , pp. 398-403
    • Eddy, W.F.1
  • 7
    • 0005904188 scopus 로고
    • Weighted Alpha Shapes,
    • Technical Report: UIUCDCS-R-92-1760
    • Edelsbrunner, H., 1992a, Weighted Alpha Shapes, Technical Report: UIUCDCS-R-92-1760
    • (1992)
    • Edelsbrunner, H.1
  • 8
    • 78249247984 scopus 로고    scopus 로고
    • Edelsbrunner, H., and Mucke, E.P., 1992b, Three-dimensional Alpha Shapes, In Proceedings of the 1992 Workshop on visualization,p.75-82, Boston, Massachusets, USA, October 19-20
    • Edelsbrunner, H., and Mucke, E.P., 1992b, Three-dimensional Alpha Shapes, In Proceedings of the 1992 Workshop on Volume visualization,p.75-82, Boston, Massachusets, USA, October 19-20
  • 9
    • 0031629515 scopus 로고    scopus 로고
    • Amenta, N., Bern, M., Kamvysselis, M., 1998, A New Voronoi-Based Surface Reconstruction Algorithm, Proceedings of the 25th annual conference on Computer graphics and interactive techniques,p.415-421, July
    • Amenta, N., Bern, M., Kamvysselis, M., 1998, A New Voronoi-Based Surface Reconstruction Algorithm, Proceedings of the 25th annual conference on Computer graphics and interactive techniques,p.415-421, July
  • 10
    • 67649714318 scopus 로고    scopus 로고
    • LOCAL, /local, visited December
    • LOCAL, 2006, http://get.dsi.uminho.pt/local, visited December 2006.
    • (2006)
  • 11
    • 67649717476 scopus 로고    scopus 로고
    • Santos, M. Y., and Moreira A., 2006, Automatic Classification of Location Contexts with Decision Trees, Proceedings of the Conference on Mobile and Ubiquitous Systems-CSMU 2006,p. 79-88, Guimarães, Portugal, June 29-30
    • Santos, M. Y., and Moreira A., 2006, Automatic Classification of Location Contexts with Decision Trees, Proceedings of the Conference on Mobile and Ubiquitous Systems-CSMU 2006,p. 79-88, Guimarães, Portugal, June 29-30
  • 12
    • 67649717475 scopus 로고    scopus 로고
    • Ertoz, L., Steinbach, M. and Kumar, V., 2003, Finding Clusters of Different Sizes, Shapes, and Densities in Noisy, High Dimensional Data. In Proceedings of the Second S1AM International Conference on Data Mining,San Francisco, CA, USA, May
    • Ertoz, L., Steinbach, M. and Kumar, V., 2003, Finding Clusters of Different Sizes, Shapes, and Densities in Noisy, High Dimensional Data. In Proceedings of the Second S1AM International Conference on Data Mining,San Francisco, CA, USA, May
  • 13
    • 67649711250 scopus 로고    scopus 로고
    • Mathematica, http://www.wolfram.com, visited October 2006.
    • Mathematica, http://www.wolfram.com, visited October 2006.


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