Computer Science – Computational Geometry
Scientific paper
2010-09-15
Computer Science
Computational Geometry
Scientific paper
Given a set S of n points in the plane and a fixed angle 0 < omega < pi, we
show how to find all triangles of minimum area with angle omega that enclose S
in O(n log n) time. We also demonstrate that in general, the solution cannot be
written without cubic root.
Bose Prosenjit
Carufel Jean-Lou de
No associations
LandOfFree
Minimum Enclosing Area Triangle with a Fixed Angle does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Minimum Enclosing Area Triangle with a Fixed Angle, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Minimum Enclosing Area Triangle with a Fixed Angle will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-78140