On levels in arrangements of lines, segments, planes, and triangles
SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
On the Number of Incidences Between Points and Curves
Combinatorics, Probability and Computing
Crossing Numbers and Hard Erdös Problems in Discrete Geometry
Combinatorics, Probability and Computing
Extremal problems on triangle areas in two and three dimensions
Journal of Combinatorial Theory Series A
Efficient Sensor Placement for Surveillance Problems
DCOSS '09 Proceedings of the 5th IEEE International Conference on Distributed Computing in Sensor Systems
| Hi-index | 0.00 |
\indent This beautiful discipline emerged from number theory after the fruitful observation made by Minkowski (1896) that many important results in diophantine approximation (and in some other central fields of number theory) can be established by easy geometric arguments.