00980cam0 2200265 450 E60020003474420210128074053.020080221d1972 |||||ita|0103 baitaIT<<Il >>sottoproletariato in Italiaper un approccio politico e metodologico al problema dell'alleanza tra classe operaia e "Lumpenproletariat"Giulio SaliernoRomaSamonà e Savelli1972140 p.18 cmCultura politica106001LAEC000178332001 *Cultura politica106Salierno, GiulioA60020004684007050355ITUNISOB20210128RICAUNISOBUNISOB30020451E600200034744M 102 Monografia moderna SBNM300001182Si20451Acquistopregresso2UNISOBUNISOB20080221072844.020190708145859.0SpinosaSottoproletariato in Italia340660UNISOB05362nam 22008175 450 99646581750331620200706085341.03-540-47738-110.1007/3-540-47738-1(CKB)1000000000211508(SSID)ssj0000322663(PQKBManifestationID)11246299(PQKBTitleCode)TC0000322663(PQKBWorkID)10286884(PQKB)10787448(DE-He213)978-3-540-47738-9(MiAaPQ)EBC3072035(PPN)15518332X(EXLCZ)99100000000021150820121227d2001 u| 0engurnn|008mamaatxtccrDiscrete and Computational Geometry[electronic resource] Japanese Conference, JCDCG 2000, Tokyo, Japan, November, 22-25, 2000. Revised Papers /edited by Jin Akiyama, Mikio Kano, Masatsugu Urabe1st ed. 2001.Berlin, Heidelberg :Springer Berlin Heidelberg :Imprint: Springer,2001.1 online resource (XII, 388 p.) Lecture Notes in Computer Science,0302-9743 ;2098Bibliographic Level Mode of Issuance: Monograph3-540-42306-0 Includes bibliographical references at the end of each chapters and index.Papers -- Dudeney Dissections of Polygons and Polyhedrons – A Survey – -- Universal Measuring Devices Without Gradations -- A Note on the Purely Recursive Dissection for a Sequentially n-Divisible Square -- Sequentially Divisible Dissections of Simple Polygons -- Packing Convex Polygons into Rectangular Boxes -- On the Number of Views of Polyhedral Scenes -- Problems and Results around the Erdös-Szekeres Convex Polygon Theorem -- On Finding Maximum-Cardinality Symmetric Subsets -- Folding and Unfolding Linkages, Paper, and Polyhedra -- On the Skeleton of the Metric Polytope -- Geometric Dissections that Swing and Twist -- On Convex Decompositions of Points -- Volume Queries in Polyhedra -- Sum of Edge Lengths of a Graph Drawn on a Convex Polygon -- On double bound graphs with respect to graph operations -- Generalized Balanced Partitions of Two Sets of Points in the Plane -- On Paths in a Complete Bipartite Geometric Graph -- Approximating Uniform Triangular Meshes for Spheres -- The construction of Delaunay diagrams by lob reduction -- Geometric Transformation in Plane Triangulations -- Separation Sensitive Kinetic Separation Structures for Convex Polygons -- On Acute Triangulations of Quadrilaterals -- Intersecting Red and Blue Line Segments in Optimal Time and Precision -- Tight Error Bound of Goemetric Problems on Convex Objects with Imprecise Coordinates -- Triangle Contact Systems, Orthogonal Plane Partitions, and their Hit Graphs -- Note on Diagonal Flips and Chromatic Numbers of Quadrangulations on Closed Surfaces -- An Extension of Cauchy’s Arm Lemma with Application to Curve Development -- On the complexity of the union of geometric objects -- Structure Theorems for Systems of Segments -- 3—Dimensional Single Active Layer Routing -- Nonregular triangulations, view graphs of triangulations, and linear programming duality -- Efficient Algorithms for Searching a Polygonal Room with a Door -- A New Structure of Cylinder Packing -- Efficient algorithms for the minimum diameter bridge problem -- Illuminating Both Sides of Line Segments.Lecture Notes in Computer Science,0302-9743 ;2098ComputersGeometryApplication softwareAlgorithmsComputer science—MathematicsComputer graphicsTheory of Computationhttps://scigraph.springernature.com/ontologies/product-market-codes/I16005Geometryhttps://scigraph.springernature.com/ontologies/product-market-codes/M21006Computer Applicationshttps://scigraph.springernature.com/ontologies/product-market-codes/I23001Algorithm Analysis and Problem Complexityhttps://scigraph.springernature.com/ontologies/product-market-codes/I16021Discrete Mathematics in Computer Sciencehttps://scigraph.springernature.com/ontologies/product-market-codes/I17028Computer Graphicshttps://scigraph.springernature.com/ontologies/product-market-codes/I22013Computers.Geometry.Application software.Algorithms.Computer science—Mathematics.Computer graphics.Theory of Computation.Geometry.Computer Applications.Algorithm Analysis and Problem Complexity.Discrete Mathematics in Computer Science.Computer Graphics.516.13Akiyama Jinedthttp://id.loc.gov/vocabulary/relators/edtKano Mikioedthttp://id.loc.gov/vocabulary/relators/edtUrabe Masatsuguedthttp://id.loc.gov/vocabulary/relators/edtJCDCG 2000MiAaPQMiAaPQMiAaPQBOOK996465817503316Discrete and computational geometry263047UNISA