Adding range restriction capability to dynamic data structures
Journal of the ACM (JACM)
Computational geometry: an introduction
Computational geometry: an introduction
Planar point location using persistent search trees
Communications of the ACM
Linear time algorithms for visibility and shortest path problems inside simple polygons
SCG '86 Proceedings of the second annual symposium on Computational geometry
Optimal point location in a monotone subdivision
SIAM Journal on Computing
Algorithms in combinatorial geometry
Algorithms in combinatorial geometry
A balanced search tree with O(1) worst case update time
Acta Informatica
A data structure for dynamic trees
Journal of Computer and System Sciences
Making data structures persistent
Journal of Computer and System Sciences - 18th Annual ACM Symposium on Theory of Computing (STOC), May 28-30, 1986
Fully dynamic point location in a monotone subdivision
SIAM Journal on Computing
Dynamic planar point location with optimal query time
IDTC Second international conference on Database theory
Dynamization of the trapezoid method for planar point location (extended abstract)
SCG '91 Proceedings of the seventh annual symposium on Computational geometry
Primitives for the manipulation of general subdivisions and the computation of Voronoi
ACM Transactions on Graphics (TOG)
Maintenance of a minimum spanning forest in a dynamic planar graph
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
Visibility and intersectin problems in plane geometry
SCG '85 Proceedings of the first annual symposium on Computational geometry
Dynamization of geometric data structures
SCG '85 Proceedings of the first annual symposium on Computational geometry
Range searching in a set of line segments
SCG '85 Proceedings of the first annual symposium on Computational geometry
Design of Dynamic Data Structures
Design of Dynamic Data Structures
Efficient Spatial Point Location (Extended Abstract)
WADS '89 Proceedings of the Workshop on Algorithms and Data Structures
Dynamization of the trapezoid method for planar point location (extended abstract)
SCG '91 Proceedings of the seventh annual symposium on Computational geometry
Planar separators and parallel polygon triangulation (preliminary version)
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Visibility-ordering meshed polyhedra
ACM Transactions on Graphics (TOG)
Dynamic point location in general subdivisions
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
A framework for dynamic graph drawing
SCG '92 Proceedings of the eighth 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
Vertical decompositions for triangles in 3-space
SCG '94 Proceedings of the tenth annual symposium on Computational geometry
SCG '94 Proceedings of the tenth annual symposium on Computational geometry
Biased finger trees and three-dimensional layers of maxima: (preliminary version)
SCG '94 Proceedings of the tenth annual symposium on Computational geometry
Computational geometry: a retrospective
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
On point location and motion planning among simplices
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
An exact interactive time visibility ordering algorithm for polyhedral cell complexes
VVS '98 Proceedings of the 1998 IEEE symposium on Volume visualization
Winnowing sequences from a database search
RECOMB '99 Proceedings of the third annual international conference on Computational molecular biology
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
Methods for achieving fast query times in point location data structures
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Average case analysis of dynamic geometric optimization
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Two-point Euclidean shortest path queries in the plane
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
ACM Transactions on Algorithms (TALG)
Parametric analysis for ungapped Markov models of evolution
ACM Transactions on Algorithms (TALG)
| Hi-index | 0.00 |