Onion polygonizations
From MaRDI portal
Publication:1351597
DOI10.1016/0020-0190(95)00193-XzbMath0900.68422OpenAlexW2913254996MaRDI QIDQ1351597
Manuel Abellanas, Oriol Serra, Gregorio Hernández-Penãlver, Ferran Hurtado, Jesús García-López
Publication date: 27 February 1997
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(95)00193-x
Related Items (2)
Spiral Serpentine Polygonization of a Planar Point Set ⋮ On polyhedra induced by point sets in space
Cites Work
- Unnamed Item
- Unnamed Item
- A lower bound for the optimal crossing-free Hamiltonian cycle problem
- Polygonizations of point sets in the plane
- On the convex layers of a planar set
- Connect-the-dots: A new heuristic
- Crossing-Free Subgraphs
- Some Upper Bounds on Error Probability for Multiclass Pattern Recognition
- The 1972 Wald Lecture Robust Statistics: A Review
- Optimal crossing-free Hamiltonian circuit drawings of \(K_n\)
This page was built for publication: Onion polygonizations
