On inducing polygons and related problems

DOI10.1016/J.COMGEO.2011.06.003zbMATH Open1278.65016OpenAlexW2069885030MaRDI QIDQ359751FDOQ359751

Authors: Eyal Ackerman, Rom Pinchasi, Ludmila Scharf, Marc Scherfenberg 

Publication date: 22 August 2013

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: http://www.sciencedirect.com/science/article/pii/S0925772111000484

Recommendations

• On Inducing Polygons and Related Problems
• Every simple arrangement of \(n\) lines contains an inducing simple \(n\)-gon
• Inducing Polygons of Line Arrangements
• INDUCING POLYGONS OF LINE ARRANGEMENTS
• PROPERTIES OF ARRANGEMENT GRAPHS

zbMATH Keywords

inducing polygonsline arrangement

Mathematics Subject Classification ID

Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Cites Work

• Computational geometry. Algorithms and applications.
• Title not available (Why is that?)
• Title not available (Why is that?)
• Applications of a semi-dynamic convex hull algorithm
• Every simple arrangement of \(n\) lines contains an inducing simple \(n\)-gon
• Inducing Polygons of Line Arrangements
• PROPERTIES OF ARRANGEMENT GRAPHS

Cited In (6)

• Every simple arrangement of \(n\) lines contains an inducing simple \(n\)-gon
• INDUCING POLYGONS OF LINE ARRANGEMENTS
• The Evolution of the Local Induction Approximation for a Regular Polygon
• Inducing Polygons of Line Arrangements
• On Inducing Polygons and Related Problems
• Title not available (Why is that?)

This page was built for publication: On inducing polygons and related problems

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