Linear time and space algorithms for discrete paths on the 1-uniform regular lattices of Z^2

DOI10.1016/J.ENDM.2017.05.012MaRDI QIDQ1687789zbMATH OpenOpenAlexFDO

Authors 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

digital geometryneighborhood relationradix relationregular latticeself-avoiding path

Mathematics Subject Classification ID

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

Recommendations

• A linear time and space algorithm for detecting path intersection
• A linear time and space algorithm for detecting path intersection in \(\mathbb Z^d\)
• Efficient operations on discrete paths
• PROPERTIES OF THE CONTOUR PATH OF DISCRETE SETS
• Efficient Computation of the Outer Hull of a Discrete Path

Cites work

• A linear time and space algorithm for detecting path intersection in \(\mathbb Z^d\)
• Efficient Computation of the Outer Hull of a Discrete Path
• Efficient operations on discrete paths
• scientific article; zbMATH DE number 5542185 (Why is no real title available?)

Cited in

(3)

• 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: Linear time and space algorithms for discrete paths on the 1-uniform regular lattices of \(\mathbb{Z}^2\)

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