Efficient operations on discrete paths
From MaRDI portal
Recommendations
- Efficient Computation of the Outer Hull of a Discrete Path
- A linear time and space algorithm for detecting path intersection
- A linear time and space algorithm for detecting path intersection in \(\mathbb Z^d\)
- Linear time and space algorithms for discrete paths on the 1-uniform regular lattices of \(\mathbb{Z}^2\)
- Detection of the discrete convexity of polyominoes
Cites work
- A Combinatorial Lemma and Its Application to Probability Theory
- A linear time and space algorithm for detecting path intersection in \(\mathbb Z^d\)
- Algorithms for polyominoes based on the discrete Green theorem
- An efficient algorithm for determining the convex hull of a finite planar set
- An optimal convex hull algorithm in any fixed dimension
- Combinatorial properties of double square tiles
- Computational geometry. Algorithms and applications.
- Developments in Language Theory
- Efficient Computation of the Outer Hull of a Discrete Path
- Factorizing words over an ordered alphabet
- scientific article; zbMATH DE number 4006288 (Why is no real title available?)
- scientific article; zbMATH DE number 2107521 (Why is no real title available?)
- scientific article; zbMATH DE number 3057719 (Why is no real title available?)
- Lyndon + Christoffel = digitally convex
- Optimal output-sensitive convex hull algorithms in two and three dimensions
- Salient and reentrant points of discrete sets
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 Computation of the Outer Hull of a Discrete Path
- 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 operations on discrete paths
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q265059)
