Building Non-Overlapping Polygons For Image Document Layout Analysis Results
暂无分享,去创建一个
[1] K. Ball. CONVEX BODIES: THE BRUNN–MINKOWSKI THEORY , 1994 .
[2] A. M. Andrew,et al. Another Efficient Algorithm for Convex Hulls in Two Dimensions , 1979, Inf. Process. Lett..
[3] Piotr Indyk,et al. Approximate clustering via core-sets , 2002, STOC '02.
[4] Kevin Q. Brown,et al. Voronoi Diagrams from Convex Hulls , 1979, Inf. Process. Lett..
[5] Bernd Gärtner,et al. Fast Smallest-Enclosing-Ball Computation in High Dimensions , 2003, ESA.
[6] Herbert Edelsbrunner,et al. Smooth Surfaces for Multi-Scale Shape Representation , 1995, FSTTCS.
[7] Bernard Chazelle,et al. An optimal convex hull algorithm in any fixed dimension , 1993, Discret. Comput. Geom..
[8] Donald E. Knuth,et al. Axioms and Hulls , 1992, Lecture Notes in Computer Science.
[9] David G. Kirkpatrick,et al. On the shape of a set of points in the plane , 1983, IEEE Trans. Inf. Theory.
[10] Emo Welzl,et al. Smallest enclosing disks (balls and ellipsoids) , 1991, New Results and New Trends in Computer Science.
[11] M. Krein,et al. On Regularly Convex Sets in the Space Conjugate to a Banach Space , 1940 .
[12] Jack Ritter,et al. An efficient bounding sphere , 1990 .
[13] Mark de Berg,et al. Computational geometry: algorithms and applications , 1997 .
[14] Joseph S. B. Mitchell,et al. Comuting Core-Sets and Approximate Smallest Enclosing HyperSpheres in High Dimensions , 2003, ALENEX.