Applications of random sampling in computational geometry, II
SCG '88 Proceedings of the fourth annual symposium on Computational geometry
A deterministic algorithm for partitioning arrangements of lines and its application
SCG '89 Proceedings of the fifth annual symposium on Computational geometry
Dehn-Sommerville relations, upper bound theorem, and levels in arrangements
SCG '93 Proceedings of the ninth annual symposium on Computational geometry
How to cut pseudo-parabolas into segments
Proceedings of the eleventh annual symposium on Computational geometry
On the number of arrangements of pseudolines
Proceedings of the twelfth annual symposium on Computational geometry
On levels in arrangements of lines, segments, planes, and triangles
SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
Results on k-sets and j-facets via continuous motion
Proceedings of the fourteenth annual symposium on Computational geometry
Parametric polymatroid optimization and its geometric applications
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Proceedings of the sixteenth annual symposium on Computational geometry
An improved bound for k-sets in three dimensions
Proceedings of the sixteenth annual symposium on Computational geometry
On some monotone path problems in line arrangements
Computational Geometry: Theory and Applications
On some monotone path problems in line arrangements
Computational Geometry: Theory and Applications
GD'04 Proceedings of the 12th international conference on Graph Drawing
| Hi-index | 0.00 |