Kinetic data structures: a state of the art report
WAFR '98 Proceedings of the third workshop on the algorithmic foundations of robotics on Robotics : the algorithmic perspective: the algorithmic perspective
Spheres, molecules, and hidden surface removal
Computational Geometry: Theory and Applications
Applying Parallel Computation Algorithms in the Design of Serial Algorithms
Journal of the ACM (JACM)
Approximating the diameter, width, smallest enclosing cylinder, and minimum-width annulus
Proceedings of the sixteenth annual symposium on Computational geometry
Approximation algorithms for projective clustering
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Collision detection for deforming necklaces
Proceedings of the eighteenth annual symposium on Computational geometry
Projective clustering in high dimensions using core-sets
Proceedings of the eighteenth annual symposium on Computational geometry
The Partition Technique for Overlays of Envelopes
FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
Approximating 3D Points with Cylindrical Segments
COCOON '02 Proceedings of the 8th Annual International Conference on Computing and Combinatorics
| Hi-index | 0.00 |
Recently, Guibas et al. [7] studied deformable necklaces - flexible chains of balls, called beads, in which only adjacent balls can intersect. In this paper, we investigate a problem of covering a necklace by cylinders. We consider several problems under different optimization criteria. We show that optimal cylindrical cover of a necklace with n beads in R3 by k cylinders can be computed in polynomial time. We also study a bounding volume hierarchy based on cylinders.