Principles of interactive computer graphics (2nd ed.)
Principles of interactive computer graphics (2nd ed.)
Plane-sweep algorithms for intersecting geometric figures
Communications of the ACM
An optimal real-time algorithm for planar convex hulls
Communications of the ACM
Introduction to VLSI Systems
Dynamically maintaining configurations in the plane (Detailed Abstract)
STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
Intersecting is easier than sorting
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
Computational geometry.
Geometric transforms for fast geometric algorithms
Geometric transforms for fast geometric algorithms
An Optimal Worst Case Algorithm for Reporting Intersections of Rectangles
IEEE Transactions on Computers
Algorithms for Reporting and Counting Geometric Intersections
IEEE Transactions on Computers
Computer
Geometric intersection problems
SFCS '76 Proceedings of the 17th Annual Symposium on Foundations of Computer Science
Transforming static data structures to dynamic structures
SFCS '79 Proceedings of the 20th Annual Symposium on Foundations of Computer Science
A combinatorial limit to the computing power of V.L.S.I. circuits
SFCS '80 Proceedings of the 21st Annual Symposium on Foundations of Computer Science
Filtering search: A new approach to query-answering
SFCS '83 Proceedings of the 24th Annual Symposium on Foundations of Computer Science
An Associative Static and Dynamic Convex Hull Algorithm
IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
Voronoi-like partition of lattice in cellular automata
Mathematical and Computer Modelling: An International Journal
| Hi-index | 14.98 |
This paper describes systolic algorithms for a number of geometric problems. For the sake of realism we restrict our investigation to one-dimensional arrays whose communication links with the outside are located at the end cells. Implementations yielding maximal throughput are given for solving dynamic versions of convex hull, inclusion, range and intersection search, planar point location, intersection, triangulation, and closest-point problems.