Abstract
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 ℝ3 by k cylinders can be computed in polynomial time. We also study a bounding volume hierarchy based on cylinders.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
P. K. Agarwal, B. Aronov, and M. Sharir. Line traversals of balls and smallest enclosing cylinders in three dimensions. Discrete Comput. Geom., 21:373–388, 1999.
P. K. Agarwal and C. M. Procopiuc. Approximation algorithms for projective clustering. In Proc. 11th ACM-SIAM Sympos. Discrete Algorithms, pp. 538–547, 2000.
T. Chan. Approximating the diameter, width, smallest enclosing cylinder and minimum-width annulus. In Proc. 16th Annu. ACM Sympos. Comput. Geom., pp. 300–309, 2000.
S. De and K. J. Bathe. The method of finite spheres. Computational Mechanics, 25:329–345, 2000.
L. Guibas, F. Xie, and L. Zhang. Kinetic data structures for efficient simulation. In Proc. IEEE Intern. Conf. on Robotics and Automation, 3:2903–2910, 2001.
L. J. Guibas. Kinetic data structures — a state of the art report. In P. K. Agarwal, L. E. Kavraki, and M. Mason, editors, Proc. Workshop Algorithmic Found. Robot., pp. 191–209. A. K. Peters, Wellesley, MA, 1998.
L. J. Guibas, A. Nguyen, D. Russel, and L. Zhang. Collision detection for deforming necklaces. In Proc. 18th Annu. ACM Sympos. Comput. Geom., pp. 33–42, 2002.
D. Halperin and M. Overmars. Spheres, molecules, and hidden surface removal. Comput. Geom. Theory Appl., 11(2):83–102, 1998.
S. Har-Peled and K. Varadarajan. Projective clustering in high dimensions using core-sets. In Proc. 18th Annu. ACM Sympos. Comput. Geom., pp. 312–318.
V. Koltun and M. Sharir. The partition technique for overlays of envelopes. In Proc. 43nd Annu. IEEE Sympos. Found. Comput. Sci., pp. 637–646.
N. Megiddo. Applying parallel computation algorithms in the design of serial algorithms. J. ACM, 30(4):852–865, 1983.
S. Quinlan. Efficient distance computation between non-convex objects. pp. 3324–3329, 1994.
J. Sadoc and N. Rivier. Boerdijk-coxeter helix and biological helices. The European Physical Journal B, 12(2):309–318, 1999.
E. Schömer, J. Sellen, M. Teichmann, and C. K. Yap. Smallest enclosing cylinders. Algorithmica, 27(2):170–186, 2000.
B. Zhu. Approximating 3D points with cylindrical segments. In Proc. 8th Ann. Internat. Conf. Computing and Combinatorics, pp. 420–429, 2002.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bespamyatnikh, S. (2003). Cylindrical Hierarchy for Deforming Necklaces. In: Warnow, T., Zhu, B. (eds) Computing and Combinatorics. COCOON 2003. Lecture Notes in Computer Science, vol 2697. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45071-8_4
Download citation
DOI: https://doi.org/10.1007/3-540-45071-8_4
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40534-4
Online ISBN: 978-3-540-45071-9
eBook Packages: Springer Book Archive