Obtaining Shape Descriptors from a Concave Hull-Based Clustering Algorithm-Reference-Cited by-同舟云学术

Obtaining Shape Descriptors from a Concave Hull-Based Clustering Algorithm

Published:2016 Issue: Volume: Page:61-72
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Braune Christian,Dankel Marco,Kruse Rudolf

Publisher

Springer International Publishing

Link

http://link.springer.com/content/pdf/10.1007/978-3-319-46349-0_6

Reference20 articles.

1. Barber, C.B., Dobkin, D.P., Huhdanpaa, H.: The quickhull algorithm for convex hulls. ACM Trans. Math. Softw. (TOMS) 22(4), 469–483 (1996)

2. Braune, C., Besecke, S., Kruse, R.: Density based clustering: alternatives to DBSCAN. In: Celebi, E.B. (ed.) Partitional Clustering Algorithms, pp. 193–213. Springer, Heidelberg (2015)

3. Chan, T.M.: Optimal output-sensitive convex hull algorithms in two and three dimensions. Discrete Comput. Geom. 16(4), 361–368 (1996)

4. Delaunay, B.: Sur la sphere vide. Izv. Akad. Nauk SSSR, Otdelenie Matematicheskii i Estestvennyka Nauk, 7(793–800), 1–2 (1934)

5. Deng, M., Liu, Q., Cheng, T., Shi, Y.: An adaptive spatial clustering algorithm based on Delaunay triangulation. Comput. Environ. Urban Syst. 35(4), 320–332 (2011)

Cited by 3 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Developed Algorithm for Making Up Convex Hull Based on Binary Tree;2020 International Conference on Industrial Engineering, Applications and Manufacturing (ICIEAM);2020-05

2. Finding the polygon hull of a network without conditions on the starting vertex;Transactions on Emerging Telecommunications Technologies;2019-07-29

3. LPCN: Least polar-angle connected node algorithm to find a polygon hull in a connected euclidean graph;Journal of Network and Computer Applications;2017-09