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

DOI10.1016/J.DAM.2016.01.014MaRDI QIDQ528337zbMATH OpenOpenAlexFDO

Authors Apurba Sarkar, Arindam Biswas, Mousumi Dutt, Partha Bhowmick, Bhargab B. 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

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

Recommendations

• A linear time combinatorial algorithm to compute the relative orthogonal convex hull of digital objects
• scientific article; zbMATH DE number 4045150
• scientific article; zbMATH DE number 3932438
• Space-efficient algorithms for computing the convex hull of a simple polygonal line in linear time
• LATIN 2004: Theoretical Informatics
• A linear time algorithm for computing the convex hull of an ordered crossing polygon
• A new linear convex hull algorithm for simple polygons (Corresp.)
• Finding the convex hull of a simple polygon in linear time

Cites work

• A combinatorial technique for construction of triangular covers of digital objects
• An efficient algorithm for determining the convex hull of a finite planar set
• An optimal convex hull algorithm in any fixed dimension
• Asymptotics of the convex hull of spherically symmetric samples
• Convex hulls of spheres and convex hulls of disjoint convex polytopes
• Finding the convex hull facet by facet
• How good are convex hull algorithms?
• scientific article; zbMATH DE number 2129318 (Why is no real title available?)
• On the identification of the convex hull of a finite set of points in the plane
• Polyhedral approximation and practical convex hull algorithm for certain classes of voxel sets
• The quickhull algorithm for convex hulls
• The Ultimate Planar Convex Hull Algorithm?

Cited in

(7)

• Triangular covers of a digital object
• A linear time combinatorial algorithm to compute the relative orthogonal convex hull of digital objects
• Convex and concave vertices on a simple closed curve in the triangular grid
• A combinatorial technique for construction of triangular covers of digital objects
• Rotations on the triangular grid: angles of changes of the neighborhood motion map
• Computing the minimal perimeter polygon for digital objects in the triangular tiling
• A simple and efficient preprocessing step for convex hull problem

Describes a project that uses

Uses Software

• Qhull

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q528337)