Fat triangles determine linearly many holes
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
On circumscribing polygons for line segments
Computational Geometry: Theory and Applications
The complexity of cutting paper (extended abstract)
SCG '85 Proceedings of the first annual symposium on Computational geometry
Separating convex sets by straight lines
Discrete Mathematics
| Hi-index | 0.00 |