A linear-time algorithm to compute the triangular hull of a digital object

DOI10.1016/j.dam.2016.01.014zbMath1370.68303OpenAlexW2281969409MaRDI QIDQ528337

Mousumi Dutt, Partha Bhowmick, Apurba Sarkar, Arindam Biswas, Bhargab Bikram Bhattacharya

Publication date: 12 May 2017

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2016.01.014

zbMATH Keywords

combinatoricsshape analysistriangular convex hulltriangular hulltriangular polygon

Mathematics Subject Classification ID

Computing methodologies for image processing (68U10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (1)

Convex and Concave Vertices on a Simple Closed Curve in the Triangular Grid

Uses Software

• Qhull

Cites Work

• Unnamed Item
• Asymptotics of the convex hull of spherically symmetric samples
• Polyhedral approximation and practical convex hull algorithm for certain classes of voxel sets
• An optimal convex hull algorithm in any fixed dimension
• How good are convex hull algorithms?
• Convex hulls of spheres and convex hulls of disjoint convex polytopes
• 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
• Finding the convex hull facet by facet
• The Ultimate Planar Convex Hull Algorithm?
• The quickhull algorithm for convex hulls
• A Combinatorial Technique for Construction of Triangular Covers of Digital Objects

This page was built for publication: A linear-time algorithm to compute the triangular hull of a digital object