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.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.