Convex Partitions with 2-Edge Connected Dual Graphs (Q5323063): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Compatible geometric matchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global Geometry of Polygons. I: The Theorem of Fabricius-Bjerre / rank
 
Normal rank
Property / cites work
 
Property / cites work: Every set of disjoint line segments admits a binary tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding equitable convex partitions of points in a polygon efficiently / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3750120 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perfect partitions of convex sets in the plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4945512 / rank
 
Normal rank
Property / cites work
 
Property / cites work: ON THE TIME BOUND FOR CONVEX DECOMPOSITION OF SIMPLE POLYGONS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight bounds for connecting sites across barriers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate convex decomposition of polygons / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3948588 / rank
 
Normal rank

Latest revision as of 19:22, 1 July 2024

scientific article; zbMATH DE number 5585620
Language Label Description Also known as
English
Convex Partitions with 2-Edge Connected Dual Graphs
scientific article; zbMATH DE number 5585620

    Statements

    Identifiers