Robust Computation of a Minimum Area Convex Polygon Stabber of a Set of Isothetic Line Segments

Asish Mukhopadhyay; Bryan St. Amour; Xijie Zeng; Xin Wu

arxiv: 1609.01662 · v1 · pith:WSPT4CISnew · submitted 2016-09-06 · 💻 cs.CG

Robust Computation of a Minimum Area Convex Polygon Stabber of a Set of Isothetic Line Segments

Xin Wu , Xijie Zeng , Bryan St. Amour , Asish Mukhopadhyay This is my paper

classification 💻 cs.CG

keywords algorithmconvexisotheticlinepolygonsegmentsareaaspects

0 comments

read the original abstract

In this paper, we discuss the algorithm engineering aspects of an O(n^2)-time algorithm [6] for computing a minimum-area convex polygon that intersects a set of n isothetic line segments.

This paper has not been read by Pith yet.

Robust Computation of a Minimum Area Convex Polygon Stabber of a Set of Isothetic Line Segments

discussion (0)