2018
DOI: 10.1016/j.procs.2018.08.258
|View full text |Cite
|
Sign up to set email alerts
|

Computing concave hull with closed curve smoothing: performance, concaveness measure and applications

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2019
2019
2024
2024

Publication Types

Select...
4
1

Relationship

0
5

Authors

Journals

citations
Cited by 5 publications
(2 citation statements)
references
References 7 publications
0
2
0
Order By: Relevance
“…There are algorithms for points in the literature in two, three, and even Euclidean spaces of higher dimension [ 36 ]. The concave hull is an algorithm that finds a concave object that surrounds all points, using methods such as Alpha Shapes or K-nearest neighbor algorithms [ 37 ]. Figure 2 shows both algorithms at points in a reconstruction, looking at only one height of the entire reconstruction.…”
Section: Proposed Frameworkmentioning
confidence: 99%
“…There are algorithms for points in the literature in two, three, and even Euclidean spaces of higher dimension [ 36 ]. The concave hull is an algorithm that finds a concave object that surrounds all points, using methods such as Alpha Shapes or K-nearest neighbor algorithms [ 37 ]. Figure 2 shows both algorithms at points in a reconstruction, looking at only one height of the entire reconstruction.…”
Section: Proposed Frameworkmentioning
confidence: 99%
“…In the application of GIS, in order to judge the accuracy of objects, a convex hull was used to highlight boundary characteristics of objects, especially in the description of three-dimensional objects [31]. In addition, many applications must interact with users through a GIS interface.…”
Section: Integrated Computation and Geo-information Applicationsmentioning
confidence: 99%