Robust Computation of a Minimum Area Convex Polygon Stabber of a Set of Isothetic Line Segments
Abstract
In this paper, we discuss the algorithm engineering aspects of an O(n2)-time algorithm [6] for computing a minimum-area convex polygon that intersects a set of n isothetic line segments.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.