Información del autor
Autor János Pach |
Documentos disponibles escritos por este autor (4)
Refinar búsquedaGeometry — Intuitive, Discrete, and Convex / SpringerLink (Online service) ; Imre Bárány ; Károly J. Böröczky ; Gábor Fejes Tóth ; János Pach (2013)
Título : Geometry — Intuitive, Discrete, and Convex : A Tribute to László Fejes Tóth Tipo de documento: documento electrónico Autores: SpringerLink (Online service) ; Imre Bárány ; Károly J. Böröczky ; Gábor Fejes Tóth ; János Pach Editorial: Berlin, Heidelberg : Springer Berlin Heidelberg Fecha de publicación: 2013 Otro editor: Imprint: Springer Colección: Bolyai Society Mathematical Studies, ISSN 1217-4696 num. 24 Número de páginas: 390 p Il.: online resource ISBN/ISSN/DL: 978-3-642-41498-5 Idioma : Inglés (eng) Palabras clave: Mathematics Convex geometry Discrete Polytopes Topology Combinatorics and Geometry Clasificación: 51 Matemáticas Resumen: The present volume is a collection of a dozen survey articles, dedicated to the memory of the famous Hungarian geometer, László Fejes Tóth, on the 99th anniversary of his birth. Each article reviews recent progress in an important field in intuitive, discrete, and convex geometry. The mathematical work and perspectives of all editors and most contributors of this volume were deeply influenced by László Fejes Tóth Nota de contenido: Contents -- Preface -- Akiyama, J., Kobayashi, M., Nakagawa, H., Nakamura, G. and Sato, I.: Atoms for Parallelohedra -- Bezdek, K.: Tarski's Plank Problem Revisited -- Bezdek, A. and Kupperbeck, W.: Dense Packing of Space with Various Convex Solids -- Brass, P.: Geometric Problems on Coverage in Sensor Networks -- Gruber, P.M.: Applications of an Idea of Voronoi, a Report -- Grünbaum, B.: Uniform Polyhedrals -- Holmsen, A.F.: Geometric Transversal Theory: T-(3)-families in the Plane -- Montejano, L.: Transversals, Topology and Colorful Geometric Results -- Pach, J. Pálvölgyi, D. and Tóth, G.: Survey on Decomposition of Multiple Coverings -- Schaefer, M.: Hanani-Tutte and Related Results -- Schneider, R.: Extremal Properties of Random Mosaics -- Smorodinsky, S.: Conflict-Free Coloring and its Applications En línea: http://dx.doi.org/10.1007/978-3-642-41498-5 Link: https://biblioteca.cunef.edu/gestion/catalogo/index.php?lvl=notice_display&id=32607 Geometry — Intuitive, Discrete, and Convex : A Tribute to László Fejes Tóth [documento electrónico] / SpringerLink (Online service) ; Imre Bárány ; Károly J. Böröczky ; Gábor Fejes Tóth ; János Pach . - Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2013 . - 390 p : online resource. - (Bolyai Society Mathematical Studies, ISSN 1217-4696; 24) .
ISBN : 978-3-642-41498-5
Idioma : Inglés (eng)
Palabras clave: Mathematics Convex geometry Discrete Polytopes Topology Combinatorics and Geometry Clasificación: 51 Matemáticas Resumen: The present volume is a collection of a dozen survey articles, dedicated to the memory of the famous Hungarian geometer, László Fejes Tóth, on the 99th anniversary of his birth. Each article reviews recent progress in an important field in intuitive, discrete, and convex geometry. The mathematical work and perspectives of all editors and most contributors of this volume were deeply influenced by László Fejes Tóth Nota de contenido: Contents -- Preface -- Akiyama, J., Kobayashi, M., Nakagawa, H., Nakamura, G. and Sato, I.: Atoms for Parallelohedra -- Bezdek, K.: Tarski's Plank Problem Revisited -- Bezdek, A. and Kupperbeck, W.: Dense Packing of Space with Various Convex Solids -- Brass, P.: Geometric Problems on Coverage in Sensor Networks -- Gruber, P.M.: Applications of an Idea of Voronoi, a Report -- Grünbaum, B.: Uniform Polyhedrals -- Holmsen, A.F.: Geometric Transversal Theory: T-(3)-families in the Plane -- Montejano, L.: Transversals, Topology and Colorful Geometric Results -- Pach, J. Pálvölgyi, D. and Tóth, G.: Survey on Decomposition of Multiple Coverings -- Schaefer, M.: Hanani-Tutte and Related Results -- Schneider, R.: Extremal Properties of Random Mosaics -- Smorodinsky, S.: Conflict-Free Coloring and its Applications En línea: http://dx.doi.org/10.1007/978-3-642-41498-5 Link: https://biblioteca.cunef.edu/gestion/catalogo/index.php?lvl=notice_display&id=32607 Ejemplares
Signatura Medio Ubicación Sub-localización Sección Estado ningún ejemplar
Título : Research Problems in Discrete Geometry Tipo de documento: documento electrónico Autores: Peter Brass ; SpringerLink (Online service) ; William O. J. Moser ; János Pach Editorial: New York, NY : Springer New York Fecha de publicación: 2005 Número de páginas: XII, 500 p. 116 illus Il.: online resource ISBN/ISSN/DL: 978-0-387-29929-7 Idioma : Inglés (eng) Palabras clave: Mathematics Convex geometry Discrete and Geometry Clasificación: 51 Matemáticas Resumen: Although discrete geometry has a rich history extending more than 150 years, it abounds in open problems that even a high-school student can understand and appreciate. Some of these problems are notoriously difficult and are intimately related to deep questions in other fields of mathematics. But many problems, even old ones, can be solved by a clever undergraduate or a high-school student equipped with an ingenious idea and the kinds of skills used in a mathematical olympiad. Research Problems in Discrete Geometry is the result of a 25-year-old project initiated by the late Leo Moser. It is a collection of more than 500 attractive open problems in the field. The largely self-contained chapters provide a broad overview of discrete geometry, along with historical details and the most important partial results related to these problems. This book is intended as a source book for both professional mathematicians and graduate students who love beautiful mathematical questions, are willing to spend sleepless nights thinking about them, and who would like to get involved in mathematical research. Important features include: * More than 500 open problems, some old, others new and never before published; * Each chapter divided into self-contained sections, each section ending with an extensive bibliography; * A great selection of research problems for graduate students looking for a dissertation topic; * A comprehensive survey of discrete geometry, highlighting the frontiers and future of research; * More than 120 figures; * A preface to an earlier version written by the late Paul Erdos. Peter Brass is Associate Professor of Computer Science at the City College of New York. William O. J. Moser is Professor Emeritus at McGill University. Janos Pach is Distinguished Professor at The City College of New York, Research Professor at the Courant Institute, NYU, and Senior Research Fellow at the Rényi Institute, Budapest Nota de contenido: Definitions and Notations -- Density Problems for Packings and Coverings -- Structural Packing and Covering Problems -- Packing and Covering with Homothetic Copies -- Tiling Problems -- Distance Problems -- Problems on Repeated Subconfigurations -- Incidence and Arrangement Problems -- Problems on Points in General Position -- Graph Drawings and Geometric Graphs -- Lattice Point Problems -- Geometric Inequalities En línea: http://dx.doi.org/10.1007/0-387-29929-7 Link: https://biblioteca.cunef.edu/gestion/catalogo/index.php?lvl=notice_display&id=35167 Research Problems in Discrete Geometry [documento electrónico] / Peter Brass ; SpringerLink (Online service) ; William O. J. Moser ; János Pach . - New York, NY : Springer New York, 2005 . - XII, 500 p. 116 illus : online resource.
ISBN : 978-0-387-29929-7
Idioma : Inglés (eng)
Palabras clave: Mathematics Convex geometry Discrete and Geometry Clasificación: 51 Matemáticas Resumen: Although discrete geometry has a rich history extending more than 150 years, it abounds in open problems that even a high-school student can understand and appreciate. Some of these problems are notoriously difficult and are intimately related to deep questions in other fields of mathematics. But many problems, even old ones, can be solved by a clever undergraduate or a high-school student equipped with an ingenious idea and the kinds of skills used in a mathematical olympiad. Research Problems in Discrete Geometry is the result of a 25-year-old project initiated by the late Leo Moser. It is a collection of more than 500 attractive open problems in the field. The largely self-contained chapters provide a broad overview of discrete geometry, along with historical details and the most important partial results related to these problems. This book is intended as a source book for both professional mathematicians and graduate students who love beautiful mathematical questions, are willing to spend sleepless nights thinking about them, and who would like to get involved in mathematical research. Important features include: * More than 500 open problems, some old, others new and never before published; * Each chapter divided into self-contained sections, each section ending with an extensive bibliography; * A great selection of research problems for graduate students looking for a dissertation topic; * A comprehensive survey of discrete geometry, highlighting the frontiers and future of research; * More than 120 figures; * A preface to an earlier version written by the late Paul Erdos. Peter Brass is Associate Professor of Computer Science at the City College of New York. William O. J. Moser is Professor Emeritus at McGill University. Janos Pach is Distinguished Professor at The City College of New York, Research Professor at the Courant Institute, NYU, and Senior Research Fellow at the Rényi Institute, Budapest Nota de contenido: Definitions and Notations -- Density Problems for Packings and Coverings -- Structural Packing and Covering Problems -- Packing and Covering with Homothetic Copies -- Tiling Problems -- Distance Problems -- Problems on Repeated Subconfigurations -- Incidence and Arrangement Problems -- Problems on Points in General Position -- Graph Drawings and Geometric Graphs -- Lattice Point Problems -- Geometric Inequalities En línea: http://dx.doi.org/10.1007/0-387-29929-7 Link: https://biblioteca.cunef.edu/gestion/catalogo/index.php?lvl=notice_display&id=35167 Ejemplares
Signatura Medio Ubicación Sub-localización Sección Estado ningún ejemplar
Título : Thirty Essays on Geometric Graph Theory Tipo de documento: documento electrónico Autores: SpringerLink (Online service) ; János Pach Editorial: New York, NY : Springer New York Fecha de publicación: 2013 Otro editor: Imprint: Springer Número de páginas: XIV, 610 p Il.: online resource ISBN/ISSN/DL: 978-1-4614-0110-0 Idioma : Inglés (eng) Palabras clave: Mathematics Geometry Discrete mathematics Combinatorics Clasificación: 51 Matemáticas Resumen: In many applications of graph theory, graphs are regarded as geometric objects drawn in the plane or in some other surface. The traditional methods of "abstract" graph theory are often incapable of providing satisfactory answers to questions arising in such applications. In the past couple of decades, many powerful new combinatorial and topological techniques have been developed to tackle these problems. Today geometric graph theory is a burgeoning field with many striking results and appealing open questions. This contributed volume contains thirty original survey and research papers on important recent developments in geometric graph theory. The contributions were thoroughly reviewed and written by excellent researchers in this field Nota de contenido: Introduction -- 1) B. Ábrego - S. Fernández-Merchant - G. Salazar: The rectilinear crossing number of K_n: closing in (or are we?) -- 2) E. Ackerman: The maximum number of tangencies among convex regions with a triangle-free intersection graph -- 3) G. Aloupis - B. Ballinger - S. Collette - S. Langerman - A. Pór - D.R.Wood: Blocking coloured point sets -- 4) M. Al-Jubeh - G. Barequet - M. Ishaque - D. Souvaine - Cs. D. Tóth - A. Winslow: Constrained tri-connected planar straight line graphs -- 5) S. Buzaglo - R. Pinchasi - G. Rote: Topological hypergraphs -- 6) J. Cano Vila - L. F. Barba - J. Urrutia - T. Sakai: On edge-disjoint empty triangles of point sets -- 7) J. Cibulka - J. Kyncl - V. Mészáros - R. Stolar - P. Valtr: Universal sets for straight-line embeddings of bicolored graphs -- 8) G. Di Battista - F. Frati: Drawing trees, outerplanar graphs, series-parallel graphs, and planar graphs in small area -- 9) W. Didimo - G. Liotta: The crossing angle resolution in graph drawing -- 10) A. Dumitrescu: Mover problems -- 11) S. Felsner: Rectangle and square representations of planar graphs -- 12) R. Fulek - N. Saeedi - D. Sariöz: Convex obstacle numbers of outerplanar graphs and bipartite permutation graphs -- 13) R. Fulek - M. Pelsmajer - M. Schaefer - D. Štefankovic: Hanani-Tutte, monotone drawings, and level-planarity -- 14) R. Fulek - A. Suk: On disjoint crossing families in geometric graphs -- 15) M. Hoffmann - A. Schulz - M. Sharir - A. Sheffer - Cs. D. Tóth - E. Welzl: Counting plane graphs: flippability and its applications -- 16) F. Hurtado - Cs. D. Tóth: Geometric graph augmentation: a generic perspective -- 17) M. Kano - K. Suzuki: Discrete geometry on red and blue points in the plane lattice -- 18) Gy. Károlyi: Ramsey-type problems for geometric graphs -- 19) Ch. Keller - M. Perles - E. Rivera-Campo - V. Urrutia-Galicia: Blockers for non-crossing spanning trees in complete geometric graphs -- 20) A. V. Kostochka - K. G. Milans: Coloring clean and K_4-free circle graphs -- 21) F. Moric - D. Pritchard: Counting large distances in convex polygons: a computational approach -- 22) A. Raigorodskii: Coloring distance graphs and graphs of diameters -- 23) M. Schaefer: Realizability of graphs and linkages -- 24) C. Smyth: Equilateral sets in l_dp -- 25) A. Suk: A note on geometric 3-hypergraphs -- 26) K. Swanepoel: Favourite distances in high dimensions -- 27) M. Tancer: Intersection patterns of convex sets via simplicial complexes, a survey -- 28) G. Tardos: Construction of locally plane graphs with many edges -- 29) G. Tóth: A better bound for the pair-crossing number -- 30) U. Wagner: Minors, embeddability, and extremal problems for hypergraphs En línea: http://dx.doi.org/10.1007/978-1-4614-0110-0 Link: https://biblioteca.cunef.edu/gestion/catalogo/index.php?lvl=notice_display&id=32205 Thirty Essays on Geometric Graph Theory [documento electrónico] / SpringerLink (Online service) ; János Pach . - New York, NY : Springer New York : Imprint: Springer, 2013 . - XIV, 610 p : online resource.
ISBN : 978-1-4614-0110-0
Idioma : Inglés (eng)
Palabras clave: Mathematics Geometry Discrete mathematics Combinatorics Clasificación: 51 Matemáticas Resumen: In many applications of graph theory, graphs are regarded as geometric objects drawn in the plane or in some other surface. The traditional methods of "abstract" graph theory are often incapable of providing satisfactory answers to questions arising in such applications. In the past couple of decades, many powerful new combinatorial and topological techniques have been developed to tackle these problems. Today geometric graph theory is a burgeoning field with many striking results and appealing open questions. This contributed volume contains thirty original survey and research papers on important recent developments in geometric graph theory. The contributions were thoroughly reviewed and written by excellent researchers in this field Nota de contenido: Introduction -- 1) B. Ábrego - S. Fernández-Merchant - G. Salazar: The rectilinear crossing number of K_n: closing in (or are we?) -- 2) E. Ackerman: The maximum number of tangencies among convex regions with a triangle-free intersection graph -- 3) G. Aloupis - B. Ballinger - S. Collette - S. Langerman - A. Pór - D.R.Wood: Blocking coloured point sets -- 4) M. Al-Jubeh - G. Barequet - M. Ishaque - D. Souvaine - Cs. D. Tóth - A. Winslow: Constrained tri-connected planar straight line graphs -- 5) S. Buzaglo - R. Pinchasi - G. Rote: Topological hypergraphs -- 6) J. Cano Vila - L. F. Barba - J. Urrutia - T. Sakai: On edge-disjoint empty triangles of point sets -- 7) J. Cibulka - J. Kyncl - V. Mészáros - R. Stolar - P. Valtr: Universal sets for straight-line embeddings of bicolored graphs -- 8) G. Di Battista - F. Frati: Drawing trees, outerplanar graphs, series-parallel graphs, and planar graphs in small area -- 9) W. Didimo - G. Liotta: The crossing angle resolution in graph drawing -- 10) A. Dumitrescu: Mover problems -- 11) S. Felsner: Rectangle and square representations of planar graphs -- 12) R. Fulek - N. Saeedi - D. Sariöz: Convex obstacle numbers of outerplanar graphs and bipartite permutation graphs -- 13) R. Fulek - M. Pelsmajer - M. Schaefer - D. Štefankovic: Hanani-Tutte, monotone drawings, and level-planarity -- 14) R. Fulek - A. Suk: On disjoint crossing families in geometric graphs -- 15) M. Hoffmann - A. Schulz - M. Sharir - A. Sheffer - Cs. D. Tóth - E. Welzl: Counting plane graphs: flippability and its applications -- 16) F. Hurtado - Cs. D. Tóth: Geometric graph augmentation: a generic perspective -- 17) M. Kano - K. Suzuki: Discrete geometry on red and blue points in the plane lattice -- 18) Gy. Károlyi: Ramsey-type problems for geometric graphs -- 19) Ch. Keller - M. Perles - E. Rivera-Campo - V. Urrutia-Galicia: Blockers for non-crossing spanning trees in complete geometric graphs -- 20) A. V. Kostochka - K. G. Milans: Coloring clean and K_4-free circle graphs -- 21) F. Moric - D. Pritchard: Counting large distances in convex polygons: a computational approach -- 22) A. Raigorodskii: Coloring distance graphs and graphs of diameters -- 23) M. Schaefer: Realizability of graphs and linkages -- 24) C. Smyth: Equilateral sets in l_dp -- 25) A. Suk: A note on geometric 3-hypergraphs -- 26) K. Swanepoel: Favourite distances in high dimensions -- 27) M. Tancer: Intersection patterns of convex sets via simplicial complexes, a survey -- 28) G. Tardos: Construction of locally plane graphs with many edges -- 29) G. Tóth: A better bound for the pair-crossing number -- 30) U. Wagner: Minors, embeddability, and extremal problems for hypergraphs En línea: http://dx.doi.org/10.1007/978-1-4614-0110-0 Link: https://biblioteca.cunef.edu/gestion/catalogo/index.php?lvl=notice_display&id=32205 Ejemplares
Signatura Medio Ubicación Sub-localización Sección Estado ningún ejemplar
Título : Twentieth Anniversary Volume : Discrete & Computational Geometry Tipo de documento: documento electrónico Autores: SpringerLink (Online service) ; Richard Pollack ; János Pach ; Jacob E. Goodman Editorial: New York, NY : Springer New York Fecha de publicación: 2009 Número de páginas: XVIII, 635 p. 212 illus Il.: online resource ISBN/ISSN/DL: 978-0-387-87363-3 Idioma : Inglés (eng) Palabras clave: Mathematics Computer science graphics Algebraic geometry mathematics Convex Discrete and Geometry in Science Graphics Computational Numerical Analysis Clasificación: 51 Matemáticas Resumen: This commemorative book contains the 28 major articles that appeared in the 2008 Twentieth Anniversary Issue of the journal Discrete & Computational Geometry, and presents a comprehensive picture of the current state of the field. Formed during the past few decades by the merger of the classical discipline of combinatorial and discrete geometry with the new field of computational geometry that sprang up in the 1970s, discrete and computational geometry now claims the allegiance of a sizeable number of mathematicians and computer scientists all over the world, whose most important work has been appearing since 1986 in the pages of the journal. The articles in this volume, a number of which solve long-outstanding problems in the field, were chosen by the editors of DCG for the importance of their results, for the breadth of their scope, and to show the intimate connections that have arisen between discrete and computational geometry and other areas of both computer science and mathematics. Apart from the articles, the editors present an expanded preface, along with a set of photographs of groups and individuals who have played a major role in the history of the field during the past twenty years. Contributors include: E. Ackerman P.K. Agarwal I. Aliev I. Bárány A. Barvinok S. Basu L.J. Billera J.-D. Boissonnat C. Borcea E. Boros K. Borys B. Braun K. Buchin O. Cheong D. Cohen-Steiner M. Damian K. Elbassioni R. Flatland T. Gerken J.E. Goodman X. Goaoc P. Gronchi V. Gurvich S. Har-Peled J. Hershberger A. Holmsen S.K. Hsiao A. Hubard J. Jerónimo L. Khachiyan R. Klein C. Knauer S. Langerman J.-Y. Lee M. Longinetti E. Miller P. Morin U. Nagel E. Nevo P. Niyogi I. Novik J. O’Rourke J. Pach I. Pak M.J. Pelsmajer S. Petitjean F. Pfender R. Pinchasi R. Pollack J.S. Provan K. Przeslawski R.M. Richardson G. Rote M. Schaefer Y. Schreiber M. Sharir J.R. Shewchuk S. Smale B. Solomyak M. Soss D. Štefankovic G. Vegter V.H. Vu S. Weinberger L. Wu D. Yost H. Yu T. Zell Nota de contenido: There Are Not Too Many Magic Configurations -- Computing the Detour and Spanning Ratio of Paths, Trees, and Cycles -- Robust Shape Fitting via Peeling and Grating Coresets -- Siegel’s Lemma and Sum-Distinct Sets -- Slicing Convex Sets and Measures by a Hyperplane -- A Centrally Symmetric Version of the Cyclic Polytope -- On Projections of Semi-Algebraic Sets Defined by Few Quadratic Inequalities -- Enumeration in Convex Geometries and Associated Polytopal Subdivisions of Spheres -- Isotopic Implicit Surface Meshing -- Line Transversals to Disjoint Balls -- Norm Bounds for Ehrhart Polynomial Roots -- Helly-Type Theorems for Line Transversals to Disjoint Unit Balls -- Grid Vertex-Unfolding Orthogonal Polyhedra -- Empty Convex Hexagons in Planar Point Sets -- Affinely Regular Polygons as Extremals of Area Functionals -- Improved Output-Sensitive Snap Rounding -- Generating All Vertices of a Polyhedron Is Hard -- Pure Point Diffractive Substitution Delone Sets Have the Meyer Property -- Metric Combinatorics of Convex Polyhedra: Cut Loci and Nonoverlapping Unfoldings -- Empty Simplices of Polytopes and Graded Betti Numbers -- Rigidity and the Lower Bound Theorem for Doubly Cohen–Macaulay Complexes -- Finding the Homology of Submanifolds with High Confidence from Random Samples -- Odd Crossing Number and Crossing Number Are Not the Same -- Visibility Graphs of Point Sets in the Plane -- Decomposability of Polytopes -- An Inscribing Model for Random Polytopes -- An Optimal-Time Algorithm for Shortest Paths on a Convex Polytope in Three Dimensions -- General-Dimensional Constrained Delaunay and Constrained Regular Triangulations, I: Combinatorial Properties En línea: http://dx.doi.org/10.1007/978-0-387-87363-3 Link: https://biblioteca.cunef.edu/gestion/catalogo/index.php?lvl=notice_display&id=33901 Twentieth Anniversary Volume : Discrete & Computational Geometry [documento electrónico] / SpringerLink (Online service) ; Richard Pollack ; János Pach ; Jacob E. Goodman . - New York, NY : Springer New York, 2009 . - XVIII, 635 p. 212 illus : online resource.
ISBN : 978-0-387-87363-3
Idioma : Inglés (eng)
Palabras clave: Mathematics Computer science graphics Algebraic geometry mathematics Convex Discrete and Geometry in Science Graphics Computational Numerical Analysis Clasificación: 51 Matemáticas Resumen: This commemorative book contains the 28 major articles that appeared in the 2008 Twentieth Anniversary Issue of the journal Discrete & Computational Geometry, and presents a comprehensive picture of the current state of the field. Formed during the past few decades by the merger of the classical discipline of combinatorial and discrete geometry with the new field of computational geometry that sprang up in the 1970s, discrete and computational geometry now claims the allegiance of a sizeable number of mathematicians and computer scientists all over the world, whose most important work has been appearing since 1986 in the pages of the journal. The articles in this volume, a number of which solve long-outstanding problems in the field, were chosen by the editors of DCG for the importance of their results, for the breadth of their scope, and to show the intimate connections that have arisen between discrete and computational geometry and other areas of both computer science and mathematics. Apart from the articles, the editors present an expanded preface, along with a set of photographs of groups and individuals who have played a major role in the history of the field during the past twenty years. Contributors include: E. Ackerman P.K. Agarwal I. Aliev I. Bárány A. Barvinok S. Basu L.J. Billera J.-D. Boissonnat C. Borcea E. Boros K. Borys B. Braun K. Buchin O. Cheong D. Cohen-Steiner M. Damian K. Elbassioni R. Flatland T. Gerken J.E. Goodman X. Goaoc P. Gronchi V. Gurvich S. Har-Peled J. Hershberger A. Holmsen S.K. Hsiao A. Hubard J. Jerónimo L. Khachiyan R. Klein C. Knauer S. Langerman J.-Y. Lee M. Longinetti E. Miller P. Morin U. Nagel E. Nevo P. Niyogi I. Novik J. O’Rourke J. Pach I. Pak M.J. Pelsmajer S. Petitjean F. Pfender R. Pinchasi R. Pollack J.S. Provan K. Przeslawski R.M. Richardson G. Rote M. Schaefer Y. Schreiber M. Sharir J.R. Shewchuk S. Smale B. Solomyak M. Soss D. Štefankovic G. Vegter V.H. Vu S. Weinberger L. Wu D. Yost H. Yu T. Zell Nota de contenido: There Are Not Too Many Magic Configurations -- Computing the Detour and Spanning Ratio of Paths, Trees, and Cycles -- Robust Shape Fitting via Peeling and Grating Coresets -- Siegel’s Lemma and Sum-Distinct Sets -- Slicing Convex Sets and Measures by a Hyperplane -- A Centrally Symmetric Version of the Cyclic Polytope -- On Projections of Semi-Algebraic Sets Defined by Few Quadratic Inequalities -- Enumeration in Convex Geometries and Associated Polytopal Subdivisions of Spheres -- Isotopic Implicit Surface Meshing -- Line Transversals to Disjoint Balls -- Norm Bounds for Ehrhart Polynomial Roots -- Helly-Type Theorems for Line Transversals to Disjoint Unit Balls -- Grid Vertex-Unfolding Orthogonal Polyhedra -- Empty Convex Hexagons in Planar Point Sets -- Affinely Regular Polygons as Extremals of Area Functionals -- Improved Output-Sensitive Snap Rounding -- Generating All Vertices of a Polyhedron Is Hard -- Pure Point Diffractive Substitution Delone Sets Have the Meyer Property -- Metric Combinatorics of Convex Polyhedra: Cut Loci and Nonoverlapping Unfoldings -- Empty Simplices of Polytopes and Graded Betti Numbers -- Rigidity and the Lower Bound Theorem for Doubly Cohen–Macaulay Complexes -- Finding the Homology of Submanifolds with High Confidence from Random Samples -- Odd Crossing Number and Crossing Number Are Not the Same -- Visibility Graphs of Point Sets in the Plane -- Decomposability of Polytopes -- An Inscribing Model for Random Polytopes -- An Optimal-Time Algorithm for Shortest Paths on a Convex Polytope in Three Dimensions -- General-Dimensional Constrained Delaunay and Constrained Regular Triangulations, I: Combinatorial Properties En línea: http://dx.doi.org/10.1007/978-0-387-87363-3 Link: https://biblioteca.cunef.edu/gestion/catalogo/index.php?lvl=notice_display&id=33901 Ejemplares
Signatura Medio Ubicación Sub-localización Sección Estado ningún ejemplar
