Efficiently testing digital convexity and recognizing digital convex polygons
From MaRDI portal
Recommendations
Cites work
- A bibliography on digital and computational convexity (1961-1988)
- A Lower Bound for the Volume of Strictly Convex Bodies with many Boundary Lattice Points
- A Lower Bound to Finding Convex Hulls
- A note on bounds on the minimum area of convex lattice polygons
- A Polynomial Time Algorithm for Counting Integral Points in Polyhedra When the Dimension is Fixed
- About the decidability of polyhedral separability in the lattice \(\mathbb {Z}^d\). Recognizing digital polyhedra with a prescribed number of faces
- An elementary algorithm for digital arc segmentation
- Characterizing Digital Convexity and Straightness in Terms of “Length” and “Total Absolute Curvature”
- Computational geometry. Algorithms and applications.
- Computing the Ehrhart polynomial of a convex lattice polytope
- Convex Digital Solids
- Convex hulls of finite sets of points in two and three dimensions
- Delaunay properties of digital straight segments
- Detection of the discrete convexity of polyominoes
- Digital Convexity, Straightness, and Convex Polygons
- Digital Straight Lines and Convexity of Digital Regions
- Discrete convexity: Definition, parametrization, and compatibility with continuous convexity
- Efficient Algorithms to Test Digital Convexity
- scientific article; zbMATH DE number 2129318 (Why is no real title available?)
- scientific article; zbMATH DE number 3163858 (Why is no real title available?)
- scientific article; zbMATH DE number 5302813 (Why is no real title available?)
- Linear Programming in Linear Time When the Dimension Is Fixed
- Lyndon + Christoffel = digitally convex
- Minimum polygonal separation
- Notes on Optimal Convex Lattice Polygons
- On the min DSS problem of closed discrete curves
- Optimal output-sensitive convex hull algorithms in two and three dimensions
- Recognition of digital polyhedra with a fixed number of faces
- Recognition of digital polyhedra with a fixed number of faces is decidable in dimension 3
- Some theoretical challenges in digital geometry: a perspective
- The quickhull algorithm for convex hulls
- The Ultimate Planar Convex Hull Algorithm?
Cited in
(11)- Digital convex + unimodular mapping = 8-connected (all points but one 4-connected)
- A characterization of 2-threshold functions via pairs of prime segments
- scientific article; zbMATH DE number 3956457 (Why is no real title available?)
- scientific article; zbMATH DE number 98536 (Why is no real title available?)
- Triangle-Based Heuristics for Area Optimal Polygonizations
- Efficient Algorithms to Test Digital Convexity
- Convex aggregation problems in \(\mathbb{Z}^2\)
- Recognition of digital polyhedra with a fixed number of faces
- An alternative definition for digital convexity
- An alternative definition for digital convexity
- An envelope operator for full convexity to define polyhedral models in digital spaces
This page was built for publication: Efficiently testing digital convexity and recognizing digital convex polygons
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2203347)
