Discrete and Computational Geometry, Graphs, and Games
24th Japanese Conference, JCDCGGG 2022, Virtual Event, September 9-11, 2022, Revised Selected Papers
Herausgegeben:Akiyama, Jin; Ito, Hiro; Sakai, Toshinori
Discrete and Computational Geometry, Graphs, and Games
24th Japanese Conference, JCDCGGG 2022, Virtual Event, September 9-11, 2022, Revised Selected Papers
Herausgegeben:Akiyama, Jin; Ito, Hiro; Sakai, Toshinori
- Broschiertes Buch
- Merkliste
- Auf die Merkliste
- Bewerten Bewerten
- Teilen
- Produkt teilen
- Produkterinnerung
- Produkterinnerung
This book, LNCS 14364, constitutes the refereed proceedings of the 24th Japanese Conference on Discrete and Computational Geometry and Graphs, JCDCGGG 2022, held virtually during September 9-11, 2022.
The 22 full papers included in this volume were carefully reviewed and selected from 35 submissions. The papers feature advances made in the field of computational geometry and focus on emerging technologies, new methodology and applications, graph theory and dynamics.
Andere Kunden interessierten sich auch für
- Discrete and Computational Geometry, Graphs, and Games41,99 €
- Discrete and Computational Geometry and Graphs36,99 €
- Achille Braquelaire / Jacques-Olivier Lauchaud / Anne Vialard (eds.)Discrete Geometry for Computer Imagery39,99 €
- Ingela Nyström / Gabriella Sanniti di Baja / Stina Svensson (eds.)Discrete Geometry for Computer Imagery77,99 €
- Gunilla Borgefors / Ingela Nyström / Gabriella Sanniti di Baja (eds.)Discrete Geometry for Computer Imagery77,99 €
- Discrete Geometry for Computer Imagery38,99 €
- Eric Andres / Guillaume Damiand / Pascal Lienhardt (eds.)Discrete Geometry for Computer Imagery40,99 €
-
-
-
This book, LNCS 14364, constitutes the refereed proceedings of the 24th Japanese Conference on Discrete and Computational Geometry and Graphs, JCDCGGG 2022, held virtually during September 9-11, 2022.
The 22 full papers included in this volume were carefully reviewed and selected from 35 submissions. The papers feature advances made in the field of computational geometry and focus on emerging technologies, new methodology and applications, graph theory and dynamics.
The 22 full papers included in this volume were carefully reviewed and selected from 35 submissions. The papers feature advances made in the field of computational geometry and focus on emerging technologies, new methodology and applications, graph theory and dynamics.
Produktdetails
- Produktdetails
- Lecture Notes in Computer Science 14364
- Verlag: Springer / Springer Nature Switzerland / Springer, Berlin
- Artikelnr. des Verlages: 978-3-032-00280-8
- Seitenzahl: 423
- Erscheinungstermin: 30. Oktober 2025
- Englisch
- Abmessung: 235mm x 155mm
- ISBN-13: 9783032002808
- Artikelnr.: 74948959
- Herstellerkennzeichnung Die Herstellerinformationen sind derzeit nicht verfügbar.
- Lecture Notes in Computer Science 14364
- Verlag: Springer / Springer Nature Switzerland / Springer, Berlin
- Artikelnr. des Verlages: 978-3-032-00280-8
- Seitenzahl: 423
- Erscheinungstermin: 30. Oktober 2025
- Englisch
- Abmessung: 235mm x 155mm
- ISBN-13: 9783032002808
- Artikelnr.: 74948959
- Herstellerkennzeichnung Die Herstellerinformationen sind derzeit nicht verfügbar.
Memorial for Mari-Jo P. Ruiz ---A Colleague and Friend in Art and Math.- Mari-Jo P. Ruiz: Mathematician, Mentor, Leader.- Mari-Jo P. Ruiz and Graph Theory.- This Game Is Not Going To Analyze Itself.- Unveil the secret hidden in the Haberdasher's puzzle -Survey on Reversibility.- Multipartite Ramsey Numbers of Double Stars.- Counting $2$-factors of $4$-regular bipartite graphs is $#P$-complete.- The Two-Squirrel Problem and Its Relatives.- A Subquadratic Time Algorithm for the Weighted k-Center Problem on Cactus Graphs.- Complexity of Solo Chess with Unlimited Moves.- Stars in Forbidden Triples Generating a Finite Set of 4-connected Graphs.- Geodesic Paths Passing Through All Faces on A Polyhedron.- Partitions of complete twisted graphs into plane spanning trees.- The Edge-Intersection Graph of Induced Paths in a Graph.- All Paths Lead to Rome.- Numerically balanced dice on convex isohedra.- Nonrealizable Planar and Spherical Occlusion Diagrams.- Maximum numbers of rigid faces and edges in continuous flattening of regular polyhedra.- Find Routes on a Doughnut.- Previous Player's Positions in Impartial Three-Dimensional Chocolate-Bar Games with Constrained Chocolate Size.- Algorithms for Burning Schedule Reconfiguration Problem on Path Forests.- Continuous Folding of the Surface of a Hypercube onto one of its Facets.- Weights of Convex Quadrilaterals and Empty Triangles in Weighted Point Sets.- New Formulation for Coloring Circle Graphs.- On the Computational Complexity of Pushing Machine.
Memorial for Mari-Jo P. Ruiz ---A Colleague and Friend in Art and Math.- Mari-Jo P. Ruiz: Mathematician, Mentor, Leader.- Mari-Jo P. Ruiz and Graph Theory.- This Game Is Not Going To Analyze Itself.- Unveil the secret hidden in the Haberdasher's puzzle -Survey on Reversibility.- Multipartite Ramsey Numbers of Double Stars.- Counting $2$-factors of $4$-regular bipartite graphs is $#P$-complete.- The Two-Squirrel Problem and Its Relatives.- A Subquadratic Time Algorithm for the Weighted k-Center Problem on Cactus Graphs.- Complexity of Solo Chess with Unlimited Moves.- Stars in Forbidden Triples Generating a Finite Set of 4-connected Graphs.- Geodesic Paths Passing Through All Faces on A Polyhedron.- Partitions of complete twisted graphs into plane spanning trees.- The Edge-Intersection Graph of Induced Paths in a Graph.- All Paths Lead to Rome.- Numerically balanced dice on convex isohedra.- Nonrealizable Planar and Spherical Occlusion Diagrams.- Maximum numbers of rigid faces and edges in continuous flattening of regular polyhedra.- Find Routes on a Doughnut.- Previous Player's Positions in Impartial Three-Dimensional Chocolate-Bar Games with Constrained Chocolate Size.- Algorithms for Burning Schedule Reconfiguration Problem on Path Forests.- Continuous Folding of the Surface of a Hypercube onto one of its Facets.- Weights of Convex Quadrilaterals and Empty Triangles in Weighted Point Sets.- New Formulation for Coloring Circle Graphs.- On the Computational Complexity of Pushing Machine.