The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
Computational geometry.
Applications of Ramsey's theorem to decision tree complexity
Journal of the ACM (JACM)
Geometric applications of a matrix searching algorithm
SCG '86 Proceedings of the second annual symposium on Computational geometry
Intersection of convex objects in two and three dimensions
Journal of the ACM (JACM)
A Bibliography on Digital and Computational Convexity (1961-1988)
IEEE Transactions on Pattern Analysis and Machine Intelligence
Dynamic computational geometry on parallel computers
C3P Proceedings of the third conference on Hypercube concurrent computers and applications - Volume 2
Polling: a new randomized sampling technique for computational geometry
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Optimal parallel algorithms for polygon and point-set problems
SCG '88 Proceedings of the fourth annual symposium on Computational geometry
Voronoi diagrams—a survey of a fundamental geometric data structure
ACM Computing Surveys (CSUR)
Bottleneck Steiner Trees in the Plane
IEEE Transactions on Computers
Shortest paths in the plane with polygonal obstacles
Journal of the ACM (JACM)
Podality-Based Time-Optimal Computations on Enhanced Meshes
IEEE Transactions on Parallel and Distributed Systems
New techniques for some dynamic closest-point and farthest-point problems
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
Journal of the ACM (JACM)
An Algorithm for Finding Best Matches in Logarithmic Expected Time
ACM Transactions on Mathematical Software (TOMS)
A Survey of Analysis Techniques for Discrete Algorithms
ACM Computing Surveys (CSUR)
ACM Computing Surveys (CSUR)
A new point-location algorithm and its practical efficiency: comparison with existing algorithms
ACM Transactions on Graphics (TOG)
Triangulating Simple Polygons and Equivalent Problems
ACM Transactions on Graphics (TOG)
Guest Editor's Introduction to Special Issue on Computational Geometry
ACM Transactions on Graphics (TOG)
Multidimensional divide-and-conquer
Communications of the ACM
An optimal real-time algorithm for planar convex hulls
Communications of the ACM
Approximation of polygonal maps by cellular maps
Communications of the ACM
Some NP-complete geometric problems
STOC '76 Proceedings of the eighth annual ACM symposium on Theory of computing
Divide-and-conquer in multidimensional space
STOC '76 Proceedings of the eighth annual ACM symposium on Theory of computing
Dynamically maintaining configurations in the plane (Detailed Abstract)
STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
Detection is easier than computation (Extended Abstract)
STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
Lower bounds for algebraic computation trees
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
A 3-space partition and its applications
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
ACM '78 Proceedings of the 1978 annual conference - Volume 2
IEEE Transactions on Computers
Spatial Planning: A Configuration Space Approach
IEEE Transactions on Computers
Set Membership Classification: A Unified Approach to Geometric Intersection Problems
IEEE Transactions on Computers
Optimal Algorithms for the Intersection and the Minimum Distance Problems Between Planar Polygons
IEEE Transactions on Computers
On polyhedra induced by point sets in space
Discrete Applied Mathematics
A Margin Maximization Training Algorithm for BP Network
ISNN '07 Proceedings of the 4th international symposium on Neural Networks: Part II--Advances in Neural Networks
Range assignment problem on the Steiner tree based topology in ad hoc wireless networks
Mobile Information Systems - Advances in Wireless Networks
Engineering the divide-and-conquer closest pair algorithm
Journal of Computer Science and Technology
Approximate shortest path queries using Voronoi duals
Transactions on computational science IX
Approximate shortest path queries using Voronoi duals
Transactions on computational science IX
Can nearest neighbor searching be simple and always fast?
ESA'11 Proceedings of the 19th European conference on Algorithms
A simple O(n log n) algorithm for finding the maximum distance between two finite planar sets
Pattern Recognition Letters
| Hi-index | 0.06 |
The complexity of a number of fundamental problems in computational geometry is examined and a number of new fast algorithms are presented and analyzed. General methods for obtaining results in geometric complexity are given and upper and lower bounds are obtained for problems involving sets of points, lines, and polygons in the plane. An effort is made to recast classical theorems into a useful computational form and analogies are developed between constructibility questions in Euclidean geometry and computability questions in modern computational complexity.