New trie data structures which support very fast search operations
Journal of Computer and System Sciences
Storing a Sparse Table with 0(1) Worst Case Access Time
Journal of the ACM (JACM)
Computational geometry: an introduction
Computational geometry: an introduction
The ultimate planar convex hull algorithm
SIAM Journal on Computing
Proceedings on STACS 85 2nd annual symposium on theoretical aspects of computer science
Convex hulls of finite sets of points in two and three dimensions
Communications of the ACM
Intersecting is easier than sorting
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
Scaling and related techniques for geometry problems
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
Algorithms in a restricted universe
Algorithms in a restricted universe
Algorithms for Reporting and Counting Geometric Intersections
IEEE Transactions on Computers
| Hi-index | 0.00 |
The area of computational geometry deals with the study of algorithms for problems concerning geometric objects like e.g. lines, polygons, circles, etc. in the plane and in higher dimensional space. Since its introduction in 1976 by Shamos the field has developed rapidly and nowadays there are even special conferences and journals devoted to the topic. A list of publications by Edelsbrunner and van Leeuwen [6] collected in 1982 already contained over 650 papers. And this number has rapidly increased since then.