Making data structures persistent
Journal of Computer and System Sciences - 18th Annual ACM Symposium on Theory of Computing (STOC), May 28-30, 1986
Efficient algorithms for geometric optimization
ACM Computing Surveys (CSUR)
An optimal real-time algorithm for planar convex hulls
Communications of the ACM
Reconstructing a collection of curves with corners and endpoints
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
A (1 + ɛ)-approximation algorithm for 2-line-center
Computational Geometry: Theory and Applications
Projective clustering and its application to surface reconstruction: extended abstract
Proceedings of the twenty-second annual symposium on Computational geometry
On empty convex polygons in a planar point set
Journal of Combinatorial Theory Series A
Curve and Surface Reconstruction: Algorithms with Mathematical Analysis (Cambridge Monographs on Applied and Computational Mathematics)
Curve reconstruction from noisy samples
Computational Geometry: Theory and Applications - Special issue on the 19th annual symposium on computational geometry - SoCG 2003
Faster core-set constructions and data-stream algorithms in fixed dimensions
Computational Geometry: Theory and Applications
How to cover a point set with a V-shape of minimum width
Computational Geometry: Theory and Applications
| Hi-index | 0.00 |
A balanced V-shape is a polygonal region in the plane contained in the union of two crossing equal-width strips. It is delimited by two pairs of parallel rays that emanate from two points x, y, are contained in the strip boundaries, and are mirror-symmetric with respect to the line xy. The width of a balanced V-shape is the width of the strips. We first present an O(n2 log n) time algorithm to compute, given a set of n points P, a minimum-width balanced V-shape covering P. We then describe a PTAS for computing a (1+ε)-approximation of this V-shape in time O((n/ε) log n + (n/ε3/2) log2(1/ε)).