Computational geometry: an introduction
Computational geometry: an introduction
Sorting Jordan sequences in linear time using level-linked search trees
Information and Control
On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles
Discrete & Computational Geometry
Simplified linear-time Jordan sorting and polygon clipping
Information Processing Letters
Computer Vision, Graphics, and Image Processing
Implicitly searching convolutions and computing depth of collision
SIGAL '90 Proceedings of the international symposium on Algorithms
Triangulating a simple polygon in linear time
Discrete & Computational Geometry
Compaction algorithms for non-convex polygons and their applications
Compaction algorithms for non-convex polygons and their applications
Minkowski operations for satellite antenna layout
SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
On Translational Motion Planning of a Convex Polyhedron in 3-Space
SIAM Journal on Computing
Combinatorial complexity of translating a box in polyhedral 3-space
Computational Geometry: Theory and Applications
SCG '85 Proceedings of the first annual symposium on Computational geometry
An analysis and algorithm for polygon clipping
Communications of the ACM
Communications of the ACM
Hidden surface removal using polygon area sorting
SIGGRAPH '77 Proceedings of the 4th annual conference on Computer graphics and interactive techniques
| Hi-index | 0.00 |
Let S be a collection of geometric objects in K3 and let P be another geometric object in K3 The free configuration space of P with respect to S is the set of all possible placements of P so that P does not intersect the set S. Finding combinatorial and computational bounds for the computation of the free configuration space is a currently active area of research in computational geometry. We show in this paper that the free configuration space of a convex polyhedron P freely translating over a polyhedral terrain having a convex projection T can be computed in O(nm + k + t) time in the worst case, where m and n are the number of faces of P and T, respectively, k denotes the size of the output and t is a parameter whose value could be, at most, O(n2m log n).