Separation and approximation of polyhedral objects (Q1900992): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Finding minimal convex nested polygons / rank
 
Normal rank
Property / cites work
 
Property / cites work: TRIANGULATING DISJOINT JORDAN CHAINS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3619797 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum vertex hulls for polyhedral domains / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4038707 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a Multidimensional Search Technique and Its Application to the Euclidean One-Centre Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3772828 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum polygonal separation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Covering convex sets with non-overlapping polygons / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: APPROXIMATING POLYGONS AND SUBDIVISIONS WITH MINIMUM-LINK PATHS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for combinatorial problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the ratio of optimal integral and fractional covers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear Programming in Linear Time When the Dimension Is Fixed / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of polyhedral separability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding the intersection of two convex polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3992847 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3818127 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Efficient Simplex Coverability Algorithm in E2 with Application to Stochastic Sequential Machines / rank
 
Normal rank

Latest revision as of 17:55, 23 May 2024

scientific article
Language Label Description Also known as
English
Separation and approximation of polyhedral objects
scientific article

    Statements

    Separation and approximation of polyhedral objects (English)
    0 references
    0 references
    0 references
    13 February 1996
    0 references
    0 references
    nested convex polyhedral
    0 references
    facet-complexity
    0 references