Computational geometry: an introduction
Computational geometry: an introduction
Planar point location using persistent search trees
Communications of the ACM
Optimal point location in a monotone subdivision
SIAM Journal on Computing
Implementation of an ADI method on parallel computers
Journal of Scientific Computing
Applications of random sampling in computational geometry, II
SCG '88 Proceedings of the fourth annual symposium on Computational geometry
A fast planar partition algorithm, I
Journal of Symbolic Computation
A fast planar partition algorithm, II
Journal of the ACM (JACM)
A Characterization of Ten Hidden-Surface Algorithms
ACM Computing Surveys (CSUR)
A new point-location algorithm and its practical efficiency: comparison with existing algorithms
ACM Transactions on Graphics (TOG)
On levels in arrangements and Voronoi diagrams
On levels in arrangements and Voronoi diagrams
Applications of a planar separator theorem
SFCS '77 Proceedings of the 18th Annual Symposium on Foundations of Computer Science
An optimal algorithm for intersecting line segments in the plane
SFCS '88 Proceedings of the 29th Annual Symposium on Foundations of Computer Science
An efficient algorithm for hidden surface removal
SIGGRAPH '89 Proceedings of the 16th annual conference on Computer graphics and interactive techniques
A fast planar partition algorithm, I
Journal of Symbolic Computation
Randomized multidimensional search trees (extended abstract): dynamic sampling
SCG '91 Proceedings of the seventh annual symposium on Computational geometry
An optimal algorithm for the (≤ k)-levels, with applications to separation and transversal problems
SCG '93 Proceedings of the ninth annual symposium on Computational geometry
An efficient algorithm for hidden surface removal, II
Proceedings of the 30th IEEE symposium on Foundations of computer science
On degeneracy in geometric computations
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
| Hi-index | 0.00 |