Aligning Two Convex Figures to Minimize Area or Perimeter

@article{Ahn2010AligningTC,
  title={Aligning Two Convex Figures to Minimize Area or Perimeter},
  author={Hee-Kap Ahn and Otfried Cheong},
  journal={Algorithmica},
  year={2010},
  volume={62},
  pages={464-479}
}
Given two compact convex sets P and Q in the plane, we consider the problem of finding a placement ϕ P of P that minimizes the convex hull of ϕ P∪Q. We study eight versions of the problem: we consider minimizing either the area or the perimeter of the convex hull; we either allow ϕ P and Q to intersect or we restrict their interiors to remain disjoint; and we either allow reorienting P or require its orientation to be fixed. In the case without reorientations, we achieve exact near-linear time… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.
8 Citations
21 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-10 of 21 references

Determining in linear time the minimum area convex hull of two polygons

  • H. C. Lee, T. C. Woo
  • IIE Trans. 20, 338–345
  • 1988
Highly Influential
3 Excerpts

Metric entropy of some classes of sets with differentiable boundaries

  • R. M. Dudley
  • J. Approx. Theory 10, 227–236 (1974); Erratum in…
  • 2012
1 Excerpt

Similar Papers

Loading similar papers…