Principles of interactive computer graphics (2nd ed.)
Principles of interactive computer graphics (2nd ed.)
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
SCG '88 Proceedings of the fourth annual symposium on Computational geometry
On monotone paths among obstacles with applications to planning assemblies
SCG '89 Proceedings of the fifth annual symposium on Computational geometry
On lines missing polyhedral sets in 3-space
SCG '93 Proceedings of the ninth annual symposium on Computational geometry
Objects that cannot be taken apart with two hands
SCG '93 Proceedings of the ninth annual symposium on Computational geometry
Cutting cylces of rods in space
Proceedings of the fourteenth annual symposium on Computational geometry
Spatial Planning: A Configuration Space Approach
IEEE Transactions on Computers
Counting plane graphs: perfect matchings, spanning cycles, and Kasteleyn's technique
Proceedings of the twenty-eighth annual symposium on Computational geometry
Improved implementation of point location in general two-dimensional subdivisions
ESA'12 Proceedings of the 20th Annual European conference on Algorithms
| Hi-index | 0.00 |
Given a collection of disjoint objects in the plane, we are interested in translating them by a common vector. If we have a primitive for translating one object at a time, then the order in which the objects can individually be translated is often geometrically constrained. In this paper we study the nature of these constraints and exhibit optimal algorithms for finding valid motion ordering for several different classes of objects. These algorithms find use in computer display applications.