Bounded boxes, Hausdorff distance, and a new proof of an interesting Helly-type theorem
暂无分享,去创建一个
[1] T. Motzkin,et al. On components in some families of sets , 1961 .
[2] V. Klee,et al. Helly's theorem and its relatives , 1963 .
[3] D. Larman. Helly type properties of unions of convex sets , 1968 .
[4] Mikhail J. Atallah,et al. A Linear Time Algorithm for the Hausdorff Distance Between Convex Polygons , 1983, Inf. Process. Lett..
[5] James Arvo,et al. A survey of ray tracing acceleration techniques , 1989 .
[6] Raimund Seidel,et al. Linear programming and convex hulls made easy , 1990, SCG '90.
[7] Micha Sharir,et al. The upper envelope of voronoi surfaces and its applications , 1991, SCG '91.
[8] Emo Welzl,et al. Smallest enclosing disks (balls and ellipsoids) , 1991, New Results and New Trends in Computer Science.
[9] Helmut Alt,et al. Approximate Matching of Polygonal Shapes (Extended Abstract) , 1991, SCG.
[10] Micha Sharir,et al. A Combinatorial Bound for Linear Programming and Related Problems , 1992, STACS.
[11] Micha Sharir,et al. A Subexponential Bound for Linear Programming , 1992, Symposium on Computational Geometry.
[12] Nina Amenta,et al. Helly theorems and generalized linear programming , 1993, SCG '93.
[13] Michael T. Goodrich,et al. Geometric Pattern Matching Under Euclidean Motion , 1993, Comput. Geom..
[14] Dan Roth,et al. Finding the Maximum Area Axis-parallel Rectangle in a Polygon , 1993, CCCG.
[15] Jirí Matousek. On geometric optimization with few violated constraints , 1994, SCG '94.
[16] Kenneth L. Clarkson,et al. Las Vegas algorithms for linear and integer programming when the dimension is small , 1995, JACM.