Pages that link to "Item:Q1961852"
From MaRDI portal
The following pages link to On simple polygonalizations with optimal area (Q1961852):
Displaying 21 items.
- Minimizing the stabbing number of matchings, trees, and triangulations (Q1006396) (← links)
- On polygons enclosing point sets. II (Q1043822) (← links)
- A note on lower bounds for the maximum area and maximum perimeter k-gon problems (Q1123609) (← links)
- \(\alpha\)-concave hull, a generalization of convex hull (Q1676320) (← links)
- Volume maximization and orthoconvex approximation of orthogons (Q1969296) (← links)
- On separating points by lines (Q1985301) (← links)
- On the effectiveness of the genetic paradigm for polygonization (Q2032170) (← links)
- Optimal area polygonization problems: exact solutions through geometric duality (Q2147134) (← links)
- Optimal point-set embedding of wheel graphs and a sub-class of 3-trees (Q2396907) (← links)
- On polygons excluding point sets (Q2637725) (← links)
- (Q3123572) (← links)
- Spiral Serpentine Polygonization of a Planar Point Set (Q4899273) (← links)
- Greedy and Local Search Heuristics to Build Area-Optimal Polygons (Q5102069) (← links)
- Area Optimal Polygonization Using Simulated Annealing (Q5102071) (← links)
- Area-Optimal Simple Polygonalizations: The CG Challenge 2019 (Q5102073) (← links)
- Computing Area-Optimal Simple Polygonizations (Q5102075) (← links)
- Triangle-Based Heuristics for Area Optimal Polygonizations (Q5102078) (← links)
- A Bound on a Convexity Measure for Point Sets (Q5149560) (← links)
- An Empirical Study on Randomized Optimal Area Polygonization of Planar Point Sets (Q5266598) (← links)
- (Q6124757) (← links)
- Non-crossing Hamiltonian paths and cycles in output-polynomial time (Q6614115) (← links)
