Efficient Computation of the Outer Hull of a Discrete Path

DOI10.1007/978-3-319-09955-2_11zbMath1419.68192OpenAlexW402333417MaRDI QIDQ3190071

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

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 hulllattice pathsdiscrete setsouter hullFreeman coderadix tree

Mathematics Subject Classification ID

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

Related Items (3)

Efficient operations on discrete paths ⋮ 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

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