RED-BLUE SEPARABILITY PROBLEMS IN 3D (Q5311632): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: The common exterior of convex polygons in the plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Union of Convex Polyhedra in Three Dimensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: An optimal algorithm for intersecting line segments in the plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum polygonal separation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for weak and wide separation of sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing the width of a set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Separating objects in the plane by wedges and strips / rank
 
Normal rank
Property / cites work
 
Property / cites work: Separability by two lines and by nearly straight polygonal chains / rank
 
Normal rank
Property / cites work
 
Property / cites work: Red-Blue Separability Problems in 3D / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems / rank
 
Normal rank

Latest revision as of 15:32, 10 June 2024

scientific article; zbMATH DE number 2197712
Language Label Description Also known as
English
RED-BLUE SEPARABILITY PROBLEMS IN 3D
scientific article; zbMATH DE number 2197712

    Statements