Efficient Algorithms to Test Digital Convexity (Q5237086): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3155868 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A bibliography on digital and computational convexity (1961-1988) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Digital Straight Lines and Convexity of Digital Regions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex Digital Solids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Discrete convexity: Definition, parametrization, and compatibility with continuous convexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizing Digital Convexity and Straightness in Terms of “Length” and “Total Absolute Curvature” / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reconstructing convex polyominoes from horizontal and vertical projections / rank
 
Normal rank
Property / cites work
 
Property / cites work: Detection of the discrete convexity of polyominoes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lyndon + Christoffel = digitally convex / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5452284 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Lower Bound to Finding Convex Hulls / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex hulls of finite sets of points in two and three dimensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Ultimate Planar Convex Hull Algorithm? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal output-sensitive convex hull algorithms in two and three dimensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: An optimal convex hull algorithm in any fixed dimension / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3282061 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Polynomial Time Algorithm for Counting Integral Points in Polyhedra When the Dimension is Fixed / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing the Ehrhart polynomial of a convex lattice polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: The quickhull algorithm for convex hulls / rank
 
Normal rank
Property / cites work
 
Property / cites work: Factoring polynomials with rational coefficients / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Lower Bound for the Volume of Strictly Convex Bodies with many Boundary Lattice Points / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3514517 / rank
 
Normal rank

Latest revision as of 16:23, 20 July 2024

scientific article; zbMATH DE number 7118273
Language Label Description Also known as
English
Efficient Algorithms to Test Digital Convexity
scientific article; zbMATH DE number 7118273

    Statements

    Efficient Algorithms to Test Digital Convexity (English)
    0 references
    0 references
    0 references
    16 October 2019
    0 references
    convexity
    0 references
    digital geometry
    0 references

    Identifiers