Minimum Perimeter Convex Hull of a Set of Line Segments: An Approximation
The problem of finding the convex hull of a set of points in the plane is one of the fundamental and well-studied problems in Computational Geometry. However, for a set of imprecise points, the convex hull problem has not been thoroughly investigated. By imprecise points, we refer to a region in the...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en en |
| Published: |
2008
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/1974/1606 |