On inducing polygons and related problems

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

Eyal Ackerman, Marc Scherfenberg, Ludmila Scharf, Rom Pinchasi

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

zbMATH Keywords

inducing polygonsline arrangement

Mathematics Subject Classification ID

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

Cites Work

• Applications of a semi-dynamic convex hull algorithm
• Every Simple Arrangement of <em>n</em> Lines Contains an Inducing Simple <em>n</em>-gon
• Inducing Polygons of Line Arrangements
• PROPERTIES OF ARRANGEMENT GRAPHS
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (4)

• INDUCING POLYGONS OF LINE ARRANGEMENTS
• The Evolution of the Local Induction Approximation for a Regular Polygon
• 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)