Pages that link to "Item:Q5266598"
From MaRDI portal
The following pages link to An Empirical Study on Randomized Optimal Area Polygonization of Planar Point Sets (Q5266598):
Displaying 10 items.
- On maximum area polygons in a planar point set (Q952010) (← links)
- On the effectiveness of the genetic paradigm for polygonization (Q2032170) (← links)
- Optimal area polygonization problems: exact solutions through geometric duality (Q2147134) (← links)
- Greedy and Local Search Heuristics to Build Area-Optimal Polygons (Q5102069) (← links)
- Area-Optimal Simple Polygonalizations: The CG Challenge 2019 (Q5102073) (← links)
- Computing Area-Optimal Simple Polygonizations (Q5102075) (← links)
- (Q5136262) (← links)
- An Empirical Study on Randomized Optimal Area Polygonization of Planar Point Sets (Q5266598) (← links)
- Computing Low-Cost Convex Partitions for Planar Point Sets with Randomized Local Search and Constraint Programming (CG Challenge) (Q6060047) (← links)
- (Q6124757) (← links)