Efficient Computation of the Outer Hull of a Discrete Path

DOI10.1007/978-3-319-09955-2_11MaRDI QIDQ3190071zbMATH OpenOpenAlexFDO

Authors Srečko Brlek, Hugo Tremblay, Jérôme Tremblay, Romaine Weber

Publication date 15 September 2014

Published in Advanced Information Systems Engineering (Search for Journal in Brave)

Full work available at URL https://constellation.uqac.ca/6125/1/outerhull.pdf

zbMATH Keywords

convex hulldiscrete setsFreeman codelattice pathsouter hullradix tree

Mathematics Subject Classification ID

Computational aspects related to convexity (52B55) Data structures (68P05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Analysis of algorithms (68W40)

Recommendations

• Efficiently approximating polygonal paths in three and higher dimensions
• scientific article; zbMATH DE number 7149412
• Computing simple-path convex hulls in hypergraphs
• Optimal computation of finitely oriented convex hulls
• An output sensitive algorithm for discrete convex hulls
• A fast approximation to a convex hull
• Efficient operations on discrete paths
• Computing homotopic shortest paths efficiently
• scientific article; zbMATH DE number 1947410
• Efficiently determining a locally exact shortest path on polyhedral surfaces

Cited in

(5)

• Linear time and space algorithms for discrete paths on the 1-uniform regular lattices of \(\mathbb{Z}^2\)
• A measure of \(Q\)-convexity for shape analysis
• Efficient operations on discrete paths
• A linear time and space algorithm for detecting path intersection
• A linear time and space algorithm for detecting path intersection in \(\mathbb Z^d\)

This page was built for publication: Efficient Computation of the Outer Hull of a Discrete Path

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