The power of geometric duality
BIT - Ellis Horwood series in artificial intelligence
Visibility and intersection problems in plane geometry
Discrete & Computational Geometry
Partition trees for triangle counting and other range searching problems
SCG '88 Proceedings of the fourth annual symposium on Computational geometry
Implicitly representing arrangements of lines or segments
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
Ray shooting and other applications of spanning trees with low stabbing number
SCG '89 Proceedings of the fifth annual symposium on Computational geometry
SIAM Journal on Computing
Quasi-optimal range searching in spaces of finite VC-dimension
Discrete & Computational Geometry - Selected papers from the fourth ACM symposium on computational geometry, Univ. of Illinois, Urbana-Champaign, June 6 8, 1988
Compact interval trees: a data structure for convex hulls
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
Design of Dynamic Data Structures
Design of Dynamic Data Structures
Shortest paths among obstacles in the plane
SCG '93 Proceedings of the ninth annual symposium on Computational geometry
Dynamic ray shooting and shortest paths via balanced geodesic triangulations
SCG '93 Proceedings of the ninth annual symposium on Computational geometry
SCG '94 Proceedings of the tenth annual symposium on Computational geometry
A unified approach to dynamic point location, ray shooting, and shortest paths in planar maps
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Weak visibility of two objects in planar polygonal scenes
ICCSA'07 Proceedings of the 2007 international conference on Computational science and its applications - Volume Part I
| Hi-index | 0.00 |