On simple polygonalizations with optimal area
From MaRDI portal
Publication:1961852
DOI10.1007/PL00009492zbMATH Open0948.68128MaRDI QIDQ1961852FDOQ1961852
Authors: Yanyan Li 
Publication date: 13 November 2000
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Recommendations
Graph theory (including graph drawing) in computer science (68R10) Lattices and convex bodies in (2) dimensions (aspects of discrete geometry) (52C05) Continuity properties of mappings on manifolds (58C07)
Cited In (21)
- On separating points by lines
- \(\alpha\)-concave hull, a generalization of convex hull
- Spiral serpentine polygonization of a planar point set
- Edge sparsification for geometric tour problems
- An empirical study on randomized optimal area polygonization of planar point sets
- A note on lower bounds for the maximum area and maximum perimeter k-gon problems
- Area optimal polygonization using simulated annealing
- On the effectiveness of the genetic paradigm for polygonization
- Greedy and local search heuristics to build area-optimal polygons
- Area-optimal simple polygonalizations: the CG challenge 2019
- Optimal area polygonization problems: exact solutions through geometric duality
- Non-crossing Hamiltonian paths and cycles in output-polynomial time
- A bound on a convexity measure for point sets
- On polygons excluding point sets
- Title not available (Why is that?)
- Computing area-optimal simple polygonizations
- Triangle-Based Heuristics for Area Optimal Polygonizations
- Minimizing the stabbing number of matchings, trees, and triangulations
- Optimal point-set embedding of wheel graphs and a sub-class of 3-trees
- On polygons enclosing point sets. II
- Volume maximization and orthoconvex approximation of orthogons
This page was built for publication: On simple polygonalizations with optimal area
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1961852)
