Range Searching in Low-Density Environments
暂无分享,去创建一个
[1] Micha Sharir,et al. Efficient Hidden Surface Removal for Objects with Small Union Size , 1992, Comput. Geom..
[2] Mark H. Overmars,et al. Range Searching and Point Location among Fat Objects , 1996, J. Algorithms.
[3] Mark H. Overmars,et al. The Complexity of the Free Space for a Robot Moving Amidst Fat Obstacles , 1992, Comput. Geom..
[4] A. Frank van der Stappen,et al. Motion planning amidst fat obstacles , 1993 .
[5] Marc J. van Kreveld. On fat partitioning, fat covering and the union size of polygons , 1998, Comput. Geom..
[6] Micha Sharir,et al. On the Union of Fat Wedges and Separating a Collection of Segments By a Line , 1993, Comput. Geom..
[7] Micha Sharir,et al. Fat Triangles Determine Linearly Many Holes , 1994, SIAM J. Comput..
[8] Mark H. Overmars,et al. Point Location in Fat Subdivisions , 1992, Inf. Process. Lett..