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

DOI10.1016/J.DAM.2016.01.014zbMATH Open1370.68303OpenAlexW2281969409MaRDI QIDQ528337FDOQ528337

Mousumi Dutt, Bhargab B. Bhattacharya, Partha Bhowmick, Apurba Sarkar, Arindam Biswas

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

shape analysiscombinatoricstriangular convex hulltriangular hulltriangular polygon

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• An efficient algorithm for determining the convex hull of a finite planar set
• The quickhull algorithm for convex hulls
• An optimal convex hull algorithm in any fixed dimension
• The Ultimate Planar Convex Hull Algorithm?
• On the identification of the convex hull of a finite set of points in the plane
• Finding the convex hull facet by facet
• How good are convex hull algorithms?
• Convex hulls of spheres and convex hulls of disjoint convex polytopes
• A Combinatorial Technique for Construction of Triangular Covers of Digital Objects
• Asymptotics of the convex hull of spherically symmetric samples
• Polyhedral approximation and practical convex hull algorithm for certain classes of voxel sets

Cited In (2)

• Rotations on the triangular grid: angles of changes of the neighborhood motion map
• Convex and Concave Vertices on a Simple Closed Curve in the Triangular Grid

Uses Software

• Qhull

Recommendations

• Space-efficient algorithms for computing the convex hull of a simple polygonal line in linear time 👍 👎
• Finding the convex hull of a simple polygon in linear time 👍 👎
• A linear time combinatorial algorithm to compute the relative orthogonal convex hull of digital objects 👍 👎
• A new linear convex hull algorithm for simple polygons (Corresp.) 👍 👎
• LATIN 2004: Theoretical Informatics 👍 👎
• A linear time algorithm for computing the convex hull of an ordered crossing polygon 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎

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)