Efficient Algorithms to Test Digital Convexity
From MaRDI portal
Publication:5237086
DOI10.1007/978-3-030-14085-4_32zbMath1433.68487arXiv1901.04738OpenAlexW2963662755MaRDI QIDQ5237086
Yan Gerard, Loïc Crombez, Guilherme Dias da Fonseca
Publication date: 16 October 2019
Published in: Discrete Geometry for Computer Imagery (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1901.04738
Analysis of algorithms (68W40) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Related Items (3)
Efficiently testing digital convexity and recognizing digital convex polygons ⋮ An alternative definition for digital convexity ⋮ Digital convex + unimodular mapping = 8-connected (all points but one 4-connected)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Reconstructing convex polyominoes from horizontal and vertical projections
- Lyndon + Christoffel = digitally convex
- Factoring polynomials with rational coefficients
- An optimal convex hull algorithm in any fixed dimension
- Computing the Ehrhart polynomial of a convex lattice polytope
- Optimal output-sensitive convex hull algorithms in two and three dimensions
- Detection of the discrete convexity of polyominoes
- Discrete convexity: Definition, parametrization, and compatibility with continuous convexity
- The Ultimate Planar Convex Hull Algorithm?
- A bibliography on digital and computational convexity (1961-1988)
- A Lower Bound to Finding Convex Hulls
- Digital Straight Lines and Convexity of Digital Regions
- Convex Digital Solids
- Convex hulls of finite sets of points in two and three dimensions
- The quickhull algorithm for convex hulls
- A Polynomial Time Algorithm for Counting Integral Points in Polyhedra When the Dimension is Fixed
- Characterizing Digital Convexity and Straightness in Terms of “Length” and “Total Absolute Curvature”
- A Lower Bound for the Volume of Strictly Convex Bodies with many Boundary Lattice Points
This page was built for publication: Efficient Algorithms to Test Digital Convexity
