Data structures and algorithms 3: multi-dimensional searching and computational geometry
Data structures and algorithms 3: multi-dimensional searching and computational geometry
Searching and sorting similar lists
Journal of Algorithms
Halfplanar range search in linear space and O(n0.695) query time
Information Processing Letters
Information and Control
Constructing arrangements of lines and hyperplanes with applications
SIAM Journal on Computing
A general approach to d-dimensional geometric queries
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
Algorithms in combinatorial geometry
Algorithms in combinatorial geometry
Separating two simple polygons by a sequence of translations
Discrete & Computational Geometry
A randomized algorithm for closest-point queries
SIAM Journal on Computing
Implicitly representing arrangements of lines or segments
SCG '88 Proceedings of the fourth annual symposium on Computational geometry
Triangles in space or building (and analyzing) castles in the Air
SCG '88 Proceedings of the fourth annual symposium on Computational geometry
Triangulating a non-convex polytype
SCG '89 Proceedings of the fifth annual symposium on Computational geometry
Applications of random sampling in computational geometry, II
Discrete & Computational Geometry - Selected papers from the fourth ACM symposium on computational geometry, Univ. of Illinois, Urbana-Champaign, June 6 8, 1988
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
A Singly-Expenential Stratification Scheme for Real Semi-Algebraic Varieties and Its Applications
ICALP '89 Proceedings of the 16th International Colloquium on Automata, Languages and Programming
A 3-space partition and its applications
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
Intersection and decomposition algorithms for arrangements of curves in the plane
Intersection and decomposition algorithms for arrangements of curves in the plane
SCG '91 Proceedings of the seventh annual symposium on Computational geometry
Counting circular arc intersections
SCG '91 Proceedings of the seventh annual symposium on Computational geometry
Intersection queries for curved objects (extended abstract)
SCG '91 Proceedings of the seventh annual symposium on Computational geometry
Ray shooting and parametric search
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Relative neighborhood graphs in three dimensions
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
SCG '92 Proceedings of the eighth annual symposium on Computational geometry
Incidence and nearest-neighbor problems for lines in 3-space
SCG '92 Proceedings of the eighth annual symposium on Computational geometry
Computing and verifying depth orders
SCG '92 Proceedings of the eighth annual symposium on Computational geometry
How hard is halfspace range searching?
SCG '92 Proceedings of the eighth annual symposium on Computational geometry
Range searching with efficient hierarchical cuttings
SCG '92 Proceedings of the eighth annual symposium on Computational geometry
Shortest paths among obstacles in the plane
SCG '93 Proceedings of the ninth annual symposium on Computational geometry
Determining the castability of simple polyhedra
SCG '94 Proceedings of the tenth annual symposium on Computational geometry
Iterated nearest neighbors and finding minimal polytypes
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Ray shooting amidst convex polytopes in three dimensions
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Testing contractibility in planar rips complexes
Proceedings of the twenty-fourth annual symposium on Computational geometry
Improved points approximation algorithms based on simplicial thickness data structures
IWOCA'10 Proceedings of the 21st international conference on Combinatorial algorithms
| Hi-index | 0.00 |