Pages that link to "Item:Q2025057"

The following pages link to The simple grid polygon exploration problem (Q2025057):

Displaying 2 items.

• An Algorithm to Compute Any Simple $k$-gon of a Maximum Area or Perimeter Inscribed in a Region of Interest (Q5056924) (← links)
• On-line exploration of rectangular cellular environments with a rectangular hole (Q6195347) (← links)