A non-parametric approach to shape reconstruction from planar point sets through Delaunay filtering
J Peethambaran, R Muthuganapathy - Computer-Aided Design, 2015 - Elsevier
In this paper, we present a fully automatic Delaunay based sculpting algorithm for
approximating the shape of a finite set of points S in R 2. The algorithm generates a relaxed …
approximating the shape of a finite set of points S in R 2. The algorithm generates a relaxed …
The parallel and precision adaptive method of marine lane extraction based on QuadTree
Extracting the marine lane results from the ocean spatial big data is a challenging problem.
One of the challenges is that the quality of the trajectory data is quite low, and the trajectory …
One of the challenges is that the quality of the trajectory data is quite low, and the trajectory …
A boundary construction algorithm for a complex planar point set
Z Liao, G Shi - Complexity, 2021 - Wiley Online Library
It is difficult to extract the boundary of complex planar points with nonuniform distribution of
point density, concave envelopes, and holes. To solve this problem, an algorithm is …
point density, concave envelopes, and holes. To solve this problem, an algorithm is …
A density based algorithm to detect cavities and holes from planar points
J Zhu, Y Sun, Y Pang - Computers & Geosciences, 2017 - Elsevier
Delaunay-based shape reconstruction algorithms are widely used in approximating the
shape from planar points. However, these algorithms cannot ensure the optimality of varied …
shape from planar points. However, these algorithms cannot ensure the optimality of varied …
[HTML][HTML] 多约束的平面点集形状重构方法
朱杰， 孙毅中 - 2017 - html.rhhz.net
针对平面点集空间分布的复杂性, 本文提出了一种基于Delaunay 三角网的平面点集形状重构
方法. 首先采用一种简单且实用的数据结构以表达Delaunay 三角网中嵌入的几何信息和拓扑 …
方法. 首先采用一种简单且实用的数据结构以表达Delaunay 三角网中嵌入的几何信息和拓扑 …