ON INTERSECTING A SET OF ISOTHETIC LINE SEGMENTS WITH A CONVEX POLYGON OF MINIMUM AREA

DOI10.1142/S021819590900312XzbMath1183.65021OpenAlexW2155070046MaRDI QIDQ3405971

No author found.

Publication date: 12 February 2010

Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s021819590900312x

zbMATH Keywords

algorithmconvex polygongeometric optimizationgraphical examplesminimum area polygonorthogonal segments

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Computational aspects related to convexity (52B55) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Related Items (3)

Stabbing segments with rectilinear objects ⋮ Stabbers of line segments in the plane ⋮ The directed Hausdorff distance between imprecise point sets

Cites Work

• Stabbing line segments
• On intersecting a set of parallel line segments with a convex polygon of minimum area
• MINIMUM POLYGON TRANSVERSALS OF LINE SEGMENTS
• Stabbing parallel segments with a convex polygon

This page was built for publication: ON INTERSECTING A SET OF ISOTHETIC LINE SEGMENTS WITH A CONVEX POLYGON OF MINIMUM AREA