منابع مشابه
Polygons Needing Many Flipturns
A flipturn on a polygon consists of reversing the order of edges inside a pocket of the polygon, without changing lengths or slopes. Any polygon with n edges must be convexified after at most (n− 1)! flipturns. A recent paper showed that in fact it will be convex after at most n(n−3)/2 flipturns. We give here lower bounds. We construct a polygon such that if pockets are chosen in a bad way, at ...
متن کاملConvexification of polygons by flips and by flipturns
Simple polygons can be made convex by a finite number of flips, or of flipturns. These results are extended to very general polygons.
متن کاملFilicide: Needing Psychiatrists' Attention
psychiatrists' attention on the crucial importance of the association between maternal filicide and their mental health, which is being still neglected and not extensively investigated by a nation-based medico-legal system. Maternal filicide is defined as child murder by the mother and is a multifaceted phenomenon with various causes (cultural background, economics , unwanted/unexpected pregnan...
متن کاملNeeding and Covering
In this paper, we define a binary relation for general collective choice situations, the needing relation, that captures one notion of dependence between alternatives with respect to inclusion in several popular solution concepts, including the top-cycle set, the uncovered set, the Banks set, and the minimal covering set. After defining the relation and relating it to a graph theoretical view o...
متن کاملProgramming Examples Needing Polymorphic Recursion
Inferring types for polymorphic recursive function de nitions (abbreviated to polymorphic recursion) is a recurring topic on the mailing lists of popular typed programming languages. This is despite the fact that type inference for polymorphic recursion using 8-types has been proved undecidable. This report presents several programming examples involving polymorphic recursion and determines the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete & Computational Geometry
سال: 2005
ISSN: 0179-5376,1432-0444
DOI: 10.1007/s00454-005-1185-z