Cutting dense point sets in half
SCG '94 Proceedings of the tenth annual symposium on Computational geometry
Dense point sets have sparse Delaunay triangulations: or "…but not too nasty"
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
The visible perimeter of an arrangement of disks
GD'12 Proceedings of the 20th international conference on Graph Drawing
On empty pentagons and hexagons in planar point sets
CATS '12 Proceedings of the Eighteenth Computing: The Australasian Theory Symposium - Volume 128
The visible perimeter of an arrangement of disks
Computational Geometry: Theory and Applications
Computational Geometry: Theory and Applications
| Hi-index | 0.01 |