Onion polygonizations

DOI10.1016/0020-0190(95)00193-XMaRDI QIDQ1351597zbMATH OpenOpenAlexFDO

Authors Manuel Abellanas, Gregorio Hernández-Penãlver, Oriol Serra, J. García-López, Ferran Hurtado

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

zbMATH Keywords

Computational geometryCombinatorial optimizationDepth sequencesPolygonizations

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Polygonizations of point sets in the plane
• Counting the onion
• The convex hull of a set of convex polygons
• scientific article; zbMATH DE number 3945383

Cites work

• scientific article; zbMATH DE number 11985 (Why is no real title available?)
• scientific article; zbMATH DE number 193423 (Why is no real title available?)
• A lower bound for the optimal crossing-free Hamiltonian cycle problem
• Connect-the-dots: A new heuristic
• Crossing-Free Subgraphs
• On the convex layers of a planar set
• Optimal crossing-free Hamiltonian circuit drawings of \(K_n\)
• Polygonizations of point sets in the plane
• Some Upper Bounds on Error Probability for Multiclass Pattern Recognition
• The 1972 Wald Lecture Robust Statistics: A Review

Cited in

(4)

• Spiral serpentine polygonization of a planar point set
• Counting the onion
• On polyhedra induced by point sets in space
• Polygonizations of point sets in the plane

This page was built for publication: Onion polygonizations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1351597)