Dot pattern points are the samples taken from all regions of a 2D object, either inside or the
boundary. Given a set of dot pattern points in the plane, the shape reconstruction problem …

Curve reconstruction from unstructured points in a plane is a fundamental problem with
many applications that has generated research interest for decades. Involved aspects like …

Given a planar point set sampled from an object boundary, the process of approximating the
original shape is called curve reconstruction. In this paper, a novel non‐parametric curve …

Reconstruction problem in R 2 computes a polygon which best approximates the geometric
shape induced by a given point set, S. In R 2, the input point set can either be a boundary …

Given a planar point set sampled from a curve, the curve reconstruction problem computes a
polygonal approximation of the curve. In this paper, we propose a Delaunay triangulation …

Given a planar point set S, outer boundary detection (shape reconstruction) is an extensively
studied problem whereas, inner boundary (hole) detection is not a well researched one …

Wireless Sensor Networks (WSNs) are critical for various applications ranging from
environment monitoring to industrial monitoring. The varying and continuously growing …

Finding the polygon hull in a connected Euclidean graph can be considered as the problem
of finding the convex hull with the exception that at any iteration a vertex can be chosen only …

Given a set of dot pattern point set P with the size n in the plane, we propose a Delaunay
triangulation-based shape reconstruction algorithm, entitled prudent carving, that can …

In this paper, we propose a Delaunay triangulation based algorithmic framework for the 2D
point set type discernment and its reconstruction. The point set discernment deals with …