Testing the necklace condition for shortest tours and optimal factors in the plane
Theoretical Computer Science
Efficient collision detection for moving polyhedra
Proceedings of the eleventh annual symposium on Computational geometry
OBBTree: a hierarchical structure for rapid interference detection
SIGGRAPH '96 Proceedings of the 23rd annual conference on Computer graphics and interactive techniques
Realistic input models for geometric algorithms
SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
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
Data structures for mobile data
Journal of Algorithms
Nice point sets can have nasty Delaunay triangulations
SCG '01 Proceedings of the seventeenth annual symposium on Computational geometry
Dense point sets have sparse Delaunay triangulations: or "…but not too nasty"
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Collision Detection for Interactive Graphics Applications
IEEE Transactions on Visualization and Computer Graphics
Fast and Robust Smallest Enclosing Balls
ESA '99 Proceedings of the 7th Annual European Symposium on Algorithms
Algorithmic issues in modeling motion
ACM Computing Surveys (CSUR)
Local polyhedra and geometric graphs
Proceedings of the nineteenth annual symposium on Computational geometry
Well-separated pair decomposition for the unit-disk graph metric and its applications
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Preprocessing chains for fast dihedral rotations is hard or even impossible
Computational Geometry: Theory and Applications
An empirical comparison of techniques for updating Delaunay triangulations
SCG '04 Proceedings of the twentieth annual symposium on Computational geometry
Deformable spanners and applications
SCG '04 Proceedings of the twentieth annual symposium on Computational geometry
BD-tree: output-sensitive collision detection for reduced deformable models
ACM SIGGRAPH 2004 Papers
Local polyhedra and geometric graphs
Computational Geometry: Theory and Applications - Special issue on the 19th annual symposium on computational geometry - SoCG 2003
Deformable spanners and applications
Computational Geometry: Theory and Applications
Efficient collision detection for spherical blend skinning
Proceedings of the 4th international conference on Computer graphics and interactive techniques in Australasia and Southeast Asia
Efficient updates of bounding sphere hierarchies for geometrically deformable models
Journal of Visual Communication and Image Representation
Local polyhedra and geometric graphs
Computational Geometry: Theory and Applications - Special issue on the 19th annual symposium on computational geometry - SoCG 2003
Deformable spanners and applications
Computational Geometry: Theory and Applications
Interruptible collision detection for deformable objects
Computers and Graphics
Cylindrical hierarchy for deforming necklaces
COCOON'03 Proceedings of the 9th annual international conference on Computing and combinatorics
Subspace self-collision culling
ACM SIGGRAPH 2010 papers
Distributed proximity maintenance in ad hoc mobile networks
DCOSS'05 Proceedings of the First IEEE international conference on Distributed Computing in Sensor Systems
Energy-based self-collision culling for arbitrary mesh deformations
ACM Transactions on Graphics (TOG) - SIGGRAPH 2012 Conference Proceedings
Ray tracing dynamic scenes using selective restructuring
EGSR'07 Proceedings of the 18th Eurographics conference on Rendering Techniques
Hi-index | 0.00 |
In this paper, we propose to study deformable necklaces --- flexible chains of balls, called beads, in which only adjacent balls may intersect. Such objects can be used to model macro-molecules, muscles, rope, and other 'linear' objects in the physical world. In this paper, we exploit this linearity to develop geometric structures associated with necklaces that are useful in physical simulations. We show how these structures can be implemented efficiently and maintained under necklace deformation. In particular, we study a bounding volume hierarchy based on spheres built on a necklace. Such a hierarchy is easy to compute and is suitable for maintenance when the necklace deforms, as our theoretical and experimental results show. This hierarchy can be used for collision and self-collision detection. In particular, we achieve an upper bound of O(nlog n) in two dimensions and O(n 2-2/d) in d-dimensions, d 3, for collision checking. To our knowledge, this is the first sub-quadratic bound proved for a collision detection algorithm using predefined hierarchies. In addition, we show that the power diagram, with the help of some additional mechanisms, can be also used to detect self-collisions of a necklace in certain ways complementary to the sphere hierarchy.