A deterministic algorithm for partitioning arrangements of lines and its application
SCG '89 Proceedings of the fifth annual symposium on Computational geometry
The Number of Intersections Between two Rectangular Paths
IEEE Transactions on Computers
A fast planar partition algorithm, I
Journal of Symbolic Computation
Counting circular arc intersections
SCG '91 Proceedings of the seventh annual symposium on Computational geometry
Extremal polygon containment problems
SCG '91 Proceedings of the seventh annual symposium on Computational geometry
An optimal algorithm for intersecting line segments in the plane
Journal of the ACM (JACM)
New lower bounds for Hopcroft's problem
Proceedings of the eleventh annual symposium on Computational geometry
An optimal algorithm for finding segments intersections
Proceedings of the eleventh annual symposium on Computational geometry
Computing faces in segment and simplex arrangements
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Intersecting Red and Blue Line Segments in Optimal Time and Precision
JCDCG '00 Revised Papers from the Japanese Conference on Discrete and Computational Geometry
Simple and Efficient Bilayer Cross Counting
GD '02 Revised Papers from the 10th International Symposium on Graph Drawing
Route planning and map inference with global positioning traces
Computer Science in Perspective
Computing the update of the repeated median regression line in linear time
Information Processing Letters
Counting and representing intersections among triangles in three dimensions
Computational Geometry: Theory and Applications
| Hi-index | 0.01 |