Selecting Heavily Covered Points
暂无分享,去创建一个
Leonidas J. Guibas | Bernard Chazelle | Micha Sharir | Raimund Seidel | John Hershberger | Herbert Edelsbrunner | M. Sharir | B. Chazelle | H. Edelsbrunner | L. Guibas | R. Seidel | J. Hershberger | L. Guibas
[1] L. Tóth. Lagerungen in der Ebene auf der Kugel und im Raum , 1953 .
[2] R. Sokal,et al. A New Statistical Approach to Geographic Variation Analysis , 1969 .
[3] D. Matula,et al. Properties of Gabriel Graphs Relevant to Geographic Variation Research and the Clustering of Points in the Plane , 2010 .
[4] H. Edelsbrunner. A new approach to rectangle intersections part I , 1983 .
[5] Robert E. Tarjan,et al. Fast Algorithms for Finding Nearest Common Ancestors , 1984, SIAM J. Comput..
[6] William H. Frey,et al. An apporach to automatic three‐dimensional finite element mesh generation , 1985 .
[7] Herbert Edelsbrunner,et al. Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms , 1988, SCG '88.
[8] L. Paul Chew,et al. Guaranteed-Quality Triangular Meshes , 1989 .
[9] Leonidas J. Guibas,et al. Points and triangles in the plane and halving planes in space , 1990, SCG '90.
[10] David Eppstein,et al. Provably good mesh generation , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.
[11] Leonidas J. Guibas,et al. Slimming down by adding; selecting heavily covered points , 1990, SCG '90.
[12] D. Eppstein,et al. MESH GENERATION AND OPTIMAL TRIANGULATION , 1992 .
[13] János Pach,et al. Combinatorial Geometry , 2012 .