A decompositin theorem for convexity spaces (Q1826114): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: On L n Sets, the Hausdorff Metric, and Connectedness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3238362 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4165427 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3940405 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Axiomatic convexity theory and relationships between the Carathéodory, Helly, and Radon numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: What is a Convex Set? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5807392 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast algorithm for testing for safety and detecting deadlocks in locked transaction systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the definition and computation of rectilinear convex hulls / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3694703 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal computation of finitely oriented convex hulls / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3675094 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal algorithms to compute the closure of a set of iso-rectangles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local Convexity and L n Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: On some union and intersection problems for polygons with fixed orientations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4721677 / rank
 
Normal rank

Latest revision as of 11:26, 20 June 2024

scientific article
Language Label Description Also known as
English
A decompositin theorem for convexity spaces
scientific article

    Statements

    A decompositin theorem for convexity spaces (English)
    0 references
    0 references
    0 references
    0 references
    1989
    0 references
    The decomposition theorem gives a condition which assures that the formation of a convex hull in a convexity space can be accomplished in two or more steps by the formation of other convex hulls. The general theorem is then applied to the computation of convex hulls for plane polygons.
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    alignment
    0 references
    link convexity
    0 references
    orthogonal convexity
    0 references
    polygon
    0 references
    computational geometry
    0 references
    convexity space
    0 references