\(\alpha\)-concave hull, a generalization of convex hull

DOI10.1016/j.tcs.2017.08.014zbMath1380.68376arXiv1309.7829OpenAlexW2745787592MaRDI QIDQ1676320

Saeed Asaeedi, Farzad Didehvar, Ali Mohades

Publication date: 6 November 2017

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1309.7829

zbMATH Keywords

approximation algorithmconvex hullNP-complete\(\alpha\)-shape\(\alpha\)-concave hullminimum area polygon

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)

Related Items (1)

Dot to dot, simple or sophisticated: a survey on shape reconstruction algorithms

Uses Software

• BetaSCP

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Protein structure optimization by side-chain positioning via beta-complex
• Approximate Delaunay mesh reconstruction and quality estimation from point samples
• The complexity of incremental convex hull algorithms in \(R^ d\)
• Large triangles in the \(d\)-dimensional unit cube
• Reconstruction of polygonal shapes from sparse Fourier samples
• Efficient generation of simple polygons for characterizing the shape of a set of points in the plane
• On simple polygonalizations with optimal area
• The on-line Heilbronn's triangle problem in \(d\) dimensions
• On Heilbronn's problem in higher dimension
• An efficient algorithm for determining the convex hull of a finite planar set
• On the identification of the convex hull of a finite set of points in the plane
• A global optimization RLT-based approach for solving the hard clustering problem
• A Lower Bound for Heilbronn's Triangle Problem in d Dimensions
• On the shape of a set of points in the plane
• On Heilbronn's Triangle Problem
• A Lower Bound for Heilbronn'S Problem
• Convex hulls of finite sets of points in two and three dimensions
• A New Convex Hull Algorithm for Planar Sets
• Computational Geometry in C
• Image registration and object recognition using affine invariants and convex hulls
• An Upper Bound for the d-Dimensional Analogue of Heilbronn's Triangle Problem
• An Algorithm for Convex Polytopes
• On a Problem of Heilbronn†
• On a Problem of Heilbronn, II
• On a Problem of Heilbronn, III
• On a Problem of Heilbronn

This page was built for publication: \(\alpha\)-concave hull, a generalization of convex hull