On reconfiguring tree linkages: Trees can lock
نویسندگان
چکیده
It has recently been shown that any simple (i.e. nonintersecting) polygonal chain in the plane can be reconfigured to lie on a straight line, and any simple polygon can be reconfigured to be convex. This result cannot be extended to tree linkages: we show that there are trees with two simple configurations that are not connected by a motion that preserves simplicity throughout the motion. Indeed, we prove that an N-link tree can have 2 equivalence classes of configurations.
منابع مشابه
Minimal Locked Trees
Locked tree linkages have been known to exist in the plane since 1998, but it is still open whether they have a polynomial-time characterization. This paper examines the properties needed for planar trees to lock, with a focus on finding the smallest locked trees according to different measures of complexity, and suggests some new avenues of research for the problem of algorithmic characterizat...
متن کاملOn Reconfiguring Radial Trees
A linkage is a collection of line segments, called bars, possibly joined at their ends, called joints. We consider flattening a tree-like linkage, that is, a continuous motion of their bars from an initial configuration to a final configuration looking like a“straight line segment,” preserving the length of each bar and not crossing any two bars. In this paper, we introduce a new class of linka...
متن کاملTechniques for Constructing Efficient Lock-free Data Structures
Techniques for Constructing Efficient Lock-free Data Structures Trevor Brown Doctor of Philosophy Graduate Department of Computer Science University of Toronto 2017 Building a library of concurrent data structures is an essential way to simplify the difficult task of developing concurrent software. Lock-free data structures, in which processes can help one another to complete operations, offer ...
متن کاملConcurrent B-trees with Lock-free Techniques
B-trees and their variants are efficient data structures for finding records in a large collection (e.g., databases). The efficiency of B-trees increases when a number of users can manipulate the tree simultaneously. Many algorithms have been developed over the last three decades to achieve both concurrency and consistency in B-trees. However, current lock-based concurrency-control techniques l...
متن کاملEvaluation of Tree Marking in Persian Ironwood-hornbeam Stands at Bahramnia Forestry Plan and Its Effect on Stand Structure
Tree marking can cause changes in forest. This study aimed to assess tree marking operation and to predict its effect on stand structure of Persian ironwood-hornbeam stands at Bahramnia forestry plan, north of Iran. Therefore 98 trees that were marked in compartment 9 of the mentioned forest in 2017 based on selection system and according to the recent laws of Forests, Range and Watershed Manag...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره cs.CG/9910024 شماره
صفحات -
تاریخ انتشار 1998