Carpenter's rule problem (Q5045673)

From Wikidata
Jump to navigation Jump to search
discrete geometry problem about whether a simple planar polygon be moved continuously so all vertices are in convex position, preserving edge lengths and simplicity
edit
Language Label Description Also known as
English
Carpenter's rule problem
discrete geometry problem about whether a simple planar polygon be moved continuously so all vertices are in convex position, preserving edge lengths and simplicity

    Statements

    Identifiers

     
    edit
      edit
        edit
          edit
            edit
              edit
                edit
                  edit