Dot to dot, simple or sophisticated: a survey on shape reconstruction algorithms
From MaRDI portal
Publication:6090986
DOI10.1007/S00236-023-00443-7OpenAlexW4385444327MaRDI QIDQ6090986FDOQ6090986
Authors: Farnaz Sheikhi, Behnam Zeraatkar, Sama Hanaie 
Publication date: 21 November 2023
Published in: Acta Informatica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00236-023-00443-7
Cites Work
- On k-Nearest Neighbor Voronoi Diagrams in the Plane
- Constructing Levels in Arrangements and Higher Order Voronoi Diagrams
- Geometric separability using orthogonal objects
- Improved algorithms for discs and balls using power diagrams
- Title not available (Why is that?)
- Finding Extremal Polygons
- On the identification of the convex hull of a finite set of points in the plane
- On the shape of a set of points in the plane
- Efficient generation of simple polygons for characterizing the shape of a set of points in the plane
- Title not available (Why is that?)
- Computing minimum-area rectilinear convex hull and \(L\)-shape
- Title not available (Why is that?)
- Maintaining Extremal Points and Its Applications to Deciding Optimal Orientations
- Separating bichromatic point sets by L-shapes
- Separability of imprecise points
- Computational Topology for Data Analysis
- \(\alpha\)-concave hull, a generalization of convex hull
- Learning localized features in 3D CAD models for manufacturability analysis of drilled holes
- Planar maximum-box problem revisited
- Order-\(k\) \(\alpha\)-hulls and \(\alpha\)-shapes
- An input-independent single pass algorithm for reconstruction from dot patterns and boundary samples
- Variations of largest rectangle recognition amidst a bichromatic point set
- Weighted \({\mathcal A}\)-shape: A descriptor of the shape of a point set
This page was built for publication: Dot to dot, simple or sophisticated: a survey on shape reconstruction algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6090986)
