Pages that link to "Item:Q5102075"
From MaRDI portal
The following pages link to Computing Area-Optimal Simple Polygonizations (Q5102075):
Displaying 13 items.
- Area-preserving approximations of polygonal paths (Q866543) (← links)
- Computing optimal diameter-bounded polygon partitions (Q1882473) (← links)
- Using symbolic calculations to determine largest small polygons (Q2046342) (← links)
- Memory-constrained algorithms for simple polygons (Q2391542) (← links)
- (Q3123572) (← links)
- Optimizing a Strip Separating Two Polygons (Q4216034) (← links)
- (Q4316716) (← links)
- (Q4763392) (← links)
- An Algorithm to Compute Any Simple $k$-gon of a Maximum Area or Perimeter Inscribed in a Region of Interest (Q5056924) (← links)
- Area-Optimal Simple Polygonalizations: The CG Challenge 2019 (Q5102073) (← links)
- Triangle-Based Heuristics for Area Optimal Polygonizations (Q5102078) (← links)
- (Q6124757) (← links)
- Optimal Area Polygonization by Triangulation and Visibility Search (Q6163583) (← links)