Linear time and space algorithms for discrete paths on the 1-uniform regular lattices of \(\mathbb{Z}^2\)

DOI10.1016/j.endm.2017.05.012zbMath1425.68426OpenAlexW2622043684MaRDI QIDQ1687789

Alexandre Blondin Massé, Éric Marcotte

Publication date: 4 January 2018

Full work available at URL: https://doi.org/10.1016/j.endm.2017.05.012

zbMATH Keywords

self-avoiding pathdigital geometryregular latticeneighborhood relationradix relation

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Data structures (68P05)

Cites Work

• Unnamed Item
• Efficient operations on discrete paths
• A linear time and space algorithm for detecting path intersection in \(\mathbb Z^d\)
• Efficient Computation of the Outer Hull of a Discrete Path

This page was built for publication: Linear time and space algorithms for discrete paths on the 1-uniform regular lattices of \(\mathbb{Z}^2\)