×

Found 170 Documents (Results 1–100)

Compacting squares: input-sensitive in-place reconfiguration of sliding squares. (English) Zbl 07853676

Czumaj, Artur (ed.) et al., 18th Scandinavian symposium and workshops on algorithm theory, SWAT 2022, Tórshavn, Faroe Islands, June 27–29, 2022. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 227, Article 4, 19 p. (2022).
MSC:  68Wxx
PDFBibTeX XMLCite
Full Text: DOI arXiv

Flat folding an unassigned single-vertex complex (Combinatorially Embedded Planar Graph with Specified Edge Lengths) without flat angles. (English) Zbl 07849027

Goaoc, Xavier (ed.) et al., 38th international symposium on computational geometry, SoCG 2022, Berlin, Germany, June 7–10, 2022. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 224, Article 29, 17 p. (2022).
MSC:  68U05
PDFBibTeX XMLCite
Full Text: DOI arXiv

Packing cube nets into rectangles with \(O(1)\) holes. (English) Zbl 07670965

Akiyama, Jin (ed.) et al., Discrete and computational geometry, graphs, and games. 21st Japanese conference, JCDCGGG 2018, Quezon City, Philippines, September 1–3, 2018. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 13034, 152-164 (2021).
MSC:  68R10 68U05 91A80
PDFBibTeX XMLCite
Full Text: DOI

Toward unfolding doubly covered \(n\)-stars. (English) Zbl 07670963

Akiyama, Jin (ed.) et al., Discrete and computational geometry, graphs, and games. 21st Japanese conference, JCDCGGG 2018, Quezon City, Philippines, September 1–3, 2018. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 13034, 122-135 (2021).
MSC:  68R10 68U05 91A80
PDFBibTeX XMLCite
Full Text: DOI

Negative instance for the edge patrolling beacon problem. (English) Zbl 07670956

Akiyama, Jin (ed.) et al., Discrete and computational geometry, graphs, and games. 21st Japanese conference, JCDCGGG 2018, Quezon City, Philippines, September 1–3, 2018. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 13034, 28-35 (2021).
MSC:  68R10 68U05 91A80
PDFBibTeX XMLCite
Full Text: DOI arXiv

Finding closed quasigeodesics on convex polyhedra. (English) Zbl 1533.68358

Cabello, Sergio (ed.) et al., 36th international symposium on computational geometry, SoCG 2020, Zürich, Switzerland (virtual conference), June 23–26, 2020. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 164, Article 33, 13 p. (2020).
MSC:  68U05
PDFBibTeX XMLCite
Full Text: DOI arXiv

Walking through doors is hard, even without staircases: proving PSPACE-hardness via planar assemblies of door gadgets. (English) Zbl 1515.68148

Farach-Colton, Martin (ed.) et al., 10th international conference on fun with algorithms. FUN 2021, May 30 – June 1, 2021, Favignana Island, Sicily, Italy. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 157, Article 3, 23 p. (2020).
MSC:  68Q17 68U05 91A46
PDFBibTeX XMLCite
Full Text: DOI arXiv

Coordinated motion planning: reconfiguring a swarm of labeled robots with bounded stretch. (English) Zbl 1489.68349

Speckmann, Bettina (ed.) et al., 34th international symposium on computational geometry, SoCG 2018, June 11–14, 2018, Budapest, Hungary. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 99, Article 29, 15 p. (2018).
PDFBibTeX XMLCite
Full Text: DOI

Folding triangular and hexagonal mazes. (English) Zbl 1443.51012

Lang, Robert J. (ed.) et al., Origami\(^7\). The proceedings from the 7th international meeting on origami in science, mathematics, and education, 7 OSME, Oxford, UK, September 4–7, 2018. Volume 2. Mathematics. St. Albans: Tarquin. 647-652 (2018).
MSC:  51M15 68U05
PDFBibTeX XMLCite

Efficient origami construction of orthogonal terrains using cross section evolution. (English) Zbl 1443.51011

Lang, Robert J. (ed.) et al., Origami\(^7\). The proceedings from the 7th international meeting on origami in science, mathematics, and education, 7 OSME, Oxford, UK, September 4–7, 2018. Volume 2. Mathematics. St. Albans: Tarquin. 631-646 (2018).
MSC:  51M15
PDFBibTeX XMLCite

Conic crease patterns with reflecting rule lines. (English) Zbl 1443.51025

Lang, Robert J. (ed.) et al., Origami\(^7\). The proceedings from the 7th international meeting on origami in science, mathematics, and education, 7 OSME, Oxford, UK, September 4–7, 2018. Volume 2. Mathematics. St. Albans: Tarquin. 573-589 (2018).
MSC:  51M20 51N20
PDFBibTeX XMLCite
Full Text: arXiv

Upward partitioned book embeddings. (English) Zbl 1503.68200

Frati, Fabrizio (ed.) et al., Graph drawing and network visualization. 25th international symposium, GD 2017, Boston, MA, USA, September 25–27, 2017. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 10692, 210-223 (2018).
MSC:  68R10 68U05
PDFBibTeX XMLCite
Full Text: DOI arXiv Link

Origamizer: a practical algorithm for folding any polyhedron. (English) Zbl 1432.68509

Aronov, Boris (ed.) et al., 33rd international symposium on computational geometry. SoCG 2017, Brisbane, Australia, July 4–7, 2017. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 77, Article 34, 16 p. (2017).
MSC:  68U05 52B70
PDFBibTeX XMLCite
Full Text: DOI

Three colors suffice: conflict-free coloring of planar graphs. (English) Zbl 1410.05062

Klein, Philip N. (ed.), Proceedings of the 28th annual ACM-SIAM symposium on discrete algorithms, SODA 2017, Barcelona, Spain, January 16–19, 2017. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 1951-1963 (2017).
PDFBibTeX XMLCite
Full Text: DOI

Universal hinge patterns for folding strips efficiently into any grid polyhedron. (English) Zbl 1476.68272

Ellen, Faith (ed.) et al., Algorithms and data structures. 15th international symposium, WADS 2017, St. John’s, NL, Canada, July 31 – August 2, 2017. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 10389, 109-120 (2017).
MSC:  68U05 52C25 68W25
PDFBibTeX XMLCite
Full Text: DOI arXiv Link

Who needs crossings? Hardness of plane graph rigidity. (English) Zbl 1387.68175

Fekete, Sándor (ed.) et al., 32nd international symposium on computational geometry, SoCG’16, Boston, MA, USA, June 14–17, 2016. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-009-5). LIPIcs – Leibniz International Proceedings in Informatics 51, Article 3, 15 p. (2016).
MSC:  68R10 68Q17 68U05
PDFBibTeX XMLCite
Full Text: DOI

Symmetric assembly puzzles are hard, beyond a few pieces. (English) Zbl 1482.05034

Akiyama, Jin (ed.) et al., Discrete and computational geometry and graphs. 18th Japan conference, JCDCGG 2015, Kyoto, Japan, September 14–16, 2015. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 9943, 180-192 (2016).
PDFBibTeX XMLCite
Full Text: DOI arXiv Link

Box pleating is hard. (English) Zbl 1482.68104

Akiyama, Jin (ed.) et al., Discrete and computational geometry and graphs. 18th Japan conference, JCDCGG 2015, Kyoto, Japan, September 14–16, 2015. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 9943, 167-179 (2016).
PDFBibTeX XMLCite
Full Text: DOI

Bust-a-Move/Puzzle Bobble is NP-complete. (English) Zbl 1482.68105

Akiyama, Jin (ed.) et al., Discrete and computational geometry and graphs. 18th Japan conference, JCDCGG 2015, Kyoto, Japan, September 14–16, 2015. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 9943, 94-104 (2016).
MSC:  68Q17 91A68
PDFBibTeX XMLCite
Full Text: DOI arXiv Link

Continuous flattening of orthogonal polyhedra. (English) Zbl 1436.51020

Akiyama, Jin (ed.) et al., Discrete and computational geometry and graphs. 18th Japan conference, JCDCGG 2015, Kyoto, Japan, September 14–16, 2015. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 9943, 85-93 (2016).
MSC:  51M20 52B10
PDFBibTeX XMLCite
Full Text: DOI

Single-player and two-player buttons & scissors games (extended abstract). (English) Zbl 1482.68106

Akiyama, Jin (ed.) et al., Discrete and computational geometry and graphs. 18th Japan conference, JCDCGG 2015, Kyoto, Japan, September 14–16, 2015. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 9943, 60-72 (2016).
PDFBibTeX XMLCite
Full Text: DOI arXiv

Mario Kart is hard. (English) Zbl 1425.68131

Akiyama, Jin (ed.) et al., Discrete and computational geometry and graphs. 18th Japan conference, JCDCGG 2015, Kyoto, Japan, September 14–16, 2015. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 9943, 49-59 (2016).
MSC:  68Q17 68T20
PDFBibTeX XMLCite
Full Text: DOI Link

Dissection with the fewest pieces is hard, even to approximate. (English) Zbl 1425.68427

Akiyama, Jin (ed.) et al., Discrete and computational geometry and graphs. 18th Japan conference, JCDCGG 2015, Kyoto, Japan, September 14–16, 2015. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 9943, 37-48 (2016).
PDFBibTeX XMLCite
Full Text: DOI arXiv

Scaling any surface down to any fraction. (English) Zbl 1486.52039

Miura, Koryo (ed.) et al., Origami\(^6\). I: Mathematics. II: Technology, art, education. Proceedings of the sixth international meeting of origami science, mathematics, and education (6OSME), Tokyo, Japan, August 10–13, 2014. Providence, RI: American Mathematical Society (AMS). 201-208 (2015).
MSC:  52B70 68U05
PDFBibTeX XMLCite
Full Text: DOI

Filling a hole in a crease pattern: isometric mapping from prescribed boundary folding. (English) Zbl 1486.52040

Miura, Koryo (ed.) et al., Origami\(^6\). I: Mathematics. II: Technology, art, education. Proceedings of the sixth international meeting of origami science, mathematics, and education (6OSME), Tokyo, Japan, August 10–13, 2014. Providence, RI: American Mathematical Society (AMS). 177-188 (2015).
MSC:  52B70 68U05
PDFBibTeX XMLCite
Full Text: DOI arXiv Link

Rigid flattening of polyhedra with slits. (English) Zbl 1486.52033

Miura, Koryo (ed.) et al., Origami\(^6\). I: Mathematics. II: Technology, art, education. Proceedings of the sixth international meeting of origami science, mathematics, and education (6OSME), Tokyo, Japan, August 10–13, 2014. Providence, RI: American Mathematical Society (AMS). 109-117 (2015).
MSC:  52B70 68U05
PDFBibTeX XMLCite
Full Text: DOI

Tilt: the video – designing worlds to control robot swarms with only global signals. (English) Zbl 1378.68142

Arge, Lars (ed.) et al., 31st international symposium on computational geometry, SoCG’15, Eindhoven, Netherlands, June 22–25, 2015. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-939897-83-5). LIPIcs – Leibniz International Proceedings in Informatics 34, 16-18 (2015).
MSC:  68T40 68U05 93C85
PDFBibTeX XMLCite
Full Text: DOI

New geometric algorithms for fully connected staged self-assembly. (English) Zbl 1404.68044

Phillips, Andrew (ed.) et al., DNA computing and molecular programming. 21st international conference, DNA 21, Boston and Cambridge, MA, USA, August 17–21, 2015. Proceedings. Cham: Springer (ISBN 978-3-319-21998-1/pbk; 978-3-319-21999-8/ebook). Lecture Notes in Computer Science 9211, 104-116 (2015).
MSC:  68Q05 68Q10 68Q25 68U05
PDFBibTeX XMLCite
Full Text: DOI arXiv

Folding a paper strip to minimize thickness. (English) Zbl 1350.68262

Rahman, M. Sohel (ed.) et al., WALCOM: algorithms and computation. 9th international workshop, WALCOM 2015, Dhaka, Bangladesh, February 26–28, 2015. Proceedings. Cham: Springer (ISBN 978-3-319-15611-8/pbk). Lecture Notes in Computer Science 8973, 113-124 (2015).
MSC:  68U05 52B70 68Q17
PDFBibTeX XMLCite
Full Text: DOI arXiv Link

Reconfiguring massive particle swarms with limited, global control. (English) Zbl 1397.68195

Flocchini, Paola (ed.) et al., Algorithms for sensor systems. 9th international symposium on algorithms and experiments for sensor systems, wireless networks and distributed robotics, ALGOSENSORS 2013, Sophia Antipolis, France, September 5–6, 2013. Revised selected papers. Berlin: Springer (ISBN 978-3-642-45345-8/pbk; 978-3-642-45346-5/ebook). Lecture Notes in Computer Science 8243, 51-66 (2014).
MSC:  68U05 68Q17 68R05
PDFBibTeX XMLCite
Full Text: DOI

Continuously flattening polyhedra using straight skeletons. (English) Zbl 1395.68274

Proceedings of the 30th annual symposium on computational geometry, SoCG ’14, Kyoto, Japan, June 8–11, 2014. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-2594-3). 396-405 (2014).
MSC:  68U05 52B70 52C25
PDFBibTeX XMLCite
Full Text: DOI Link

On wrapping spheres and cubes with rectangular paper. (English) Zbl 1456.51011

Akiyama, Jin (ed.) et al., Discrete and computational geometry and graphs. 16th Japanese conference, JCDCGG 2013, Tokyo, Japan, September 17–19, 2013. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 8845, 31-43 (2014).
MSC:  51M15
PDFBibTeX XMLCite
Full Text: DOI Link

Flat foldings of plane graphs with prescribed angles and edge lengths. (English) Zbl 1417.68219

Duncan, Christian (ed.) et al., Graph drawing. 22nd international symposium, GD 2014, Würzburg, Germany, September 24–26, 2014. Revised selected papers. Berlin: Springer. Lect. Notes Comput. Sci. 8871, 272-283 (2014).
MSC:  68U05 68R10
PDFBibTeX XMLCite
Full Text: DOI

Algorithms for designing pop-up cards. (English) Zbl 1354.68272

Portier, Natacha (ed.) et al., 30th international symposium on theoretical aspects of computer science, STACS’ 13, Kiel, Germany, February 27 – March 2, 2013. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-939897-50-7). LIPIcs – Leibniz International Proceedings in Informatics 20, 269-280 (2013).
MSC:  68U05
PDFBibTeX XMLCite
Full Text: DOI

Meshes preserving minimum feature size. (English) Zbl 1374.68633

Márquez, Alberto (ed.) et al., Computational geometry. XIV Spanish meeting on computational geometry, EGC 2011, dedicated to Ferran Hurtado on the occasion of his 60th birthday, Alcalá de Henares, Spain, June 27–30, 2011. Revised selected papers. Berlin: Springer (ISBN 978-3-642-34190-8/pbk). Lecture Notes in Computer Science 7579, 258-273 (2012).
PDFBibTeX XMLCite
Full Text: DOI Link

A generalization of the source unfolding of convex polyhedra. (English) Zbl 1374.52019

Márquez, Alberto (ed.) et al., Computational geometry. XIV Spanish meeting on computational geometry, EGC 2011, dedicated to Ferran Hurtado on the occasion of his 60th birthday, Alcalá de Henares, Spain, June 27–30, 2011. Revised selected papers. Berlin: Springer (ISBN 978-3-642-34190-8/pbk). Lecture Notes in Computer Science 7579, 185-199 (2012).
MSC:  52B70
PDFBibTeX XMLCite
Full Text: DOI Link

Embedding stacked polytopes on a polynomial-size grid. (English) Zbl 1377.52017

Randall, Dana (ed.), Proceedings of the 22nd annual ACM-SIAM symposium on discrete algorithms, SODA 2011, San Francisco, CA, USA, January 23–25, 2011. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 1177-1187 (2011).
MSC:  52B55 52B20 68U05
PDFBibTeX XMLCite
Full Text: arXiv Link

Self-assembly of arbitrary shapes using RNAse enzymes: meeting the Kolmogorov bound with small scale factor (extended abstract). (English) Zbl 1230.68069

Schwentick, Thomas (ed.) et al., STACS 2011. 28th international symposium on theoretical aspects of computer science, Dortmund, Germany, March 10–12, 2011. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-939897-25-5). LIPIcs – Leibniz International Proceedings in Informatics 9, 201-212, electronic only (2011).
MSC:  68Q05 05B45 68Q30 52C20
PDFBibTeX XMLCite
Full Text: DOI Link

Folding equilateral plane graphs. (English) Zbl 1350.68253

Asano, Takao (ed.) et al., Algorithms and computation. 22nd international symposium, ISAAC 2011, Yokohama, Japan, December 5–8, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-25590-8/pbk). Lecture Notes in Computer Science 7074, 574-583 (2011).
MSC:  68U05 68Q17 68R10
PDFBibTeX XMLCite
Full Text: DOI Link

Common unfoldings of polyominoes and polycubes. (English) Zbl 1349.52011

Akiyama, Jin (ed.) et al., Computational geometry, graphs and applications. 9th international conference, CGGA 2010, Dalian, China, November 3–6, 2010. Revised selected papers. Berlin: Springer (ISBN 978-3-642-24982-2/pbk). Lecture Notes in Computer Science 7033, 44-54 (2011).
MSC:  52B10 05B50 52B05
PDFBibTeX XMLCite
Full Text: DOI Link

Making polygons by simple folds and one straight cut. (English) Zbl 1349.68292

Akiyama, Jin (ed.) et al., Computational geometry, graphs and applications. 9th international conference, CGGA 2010, Dalian, China, November 3–6, 2010. Revised selected papers. Berlin: Springer (ISBN 978-3-642-24982-2/pbk). Lecture Notes in Computer Science 7033, 27-43 (2011).
MSC:  68U05
PDFBibTeX XMLCite
Full Text: DOI Link

Matching points with things. (English) Zbl 1283.52016

López-Ortiz, Alejandro (ed.), LATIN 2010: Theoretical informatics. 9th Latin American symposium, Oaxaca, Mexico, April 19–23, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-12199-9/pbk). Lecture Notes in Computer Science 6034, 456-467 (2010).
MSC:  52B55 52C22 68Q17
PDFBibTeX XMLCite
Full Text: DOI Link

The geometry of binary search trees. (English) Zbl 1409.68305

Mathieu, Claire (ed.), Proceedings of the 20th annual ACM-SIAM symposium on discrete algorithms, SODA 2009, New York, NY, USA, January 4–6, 2009. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 496-505 (2009).
MSC:  68U05 68P05
PDFBibTeX XMLCite
Full Text: Link

Folding a better checkerboard. (English) Zbl 1273.52018

Dong, Yingfei (ed.) et al., Algorithms and computation. 20th international symposium, ISAAC 2009, Honolulu, Hawaii, USA, December 16–18, 2009. Proceedings. Berlin: Springer (ISBN 978-3-642-10630-9/pbk). Lecture Notes in Computer Science 5878, 1074-1083 (2009).
MSC:  52B55 68U05
PDFBibTeX XMLCite
Full Text: DOI Link

A pseudopolynomial algorithm for Alexandrov’s theorem. (English) Zbl 1253.65028

Dehne, Frank (ed.) et al., Algorithms and data structures. 11th international symposium, WADS 2009, Banff, Canada, August 21–23, 2009. Proceedings. Berlin: Springer (ISBN 978-3-642-03366-7/pbk). Lecture Notes in Computer Science 5664, 435-446 (2009).
MSC:  65D18 52B55 65Y20
PDFBibTeX XMLCite
Full Text: DOI Link

Minimal locked trees. (English) Zbl 1253.68328

Dehne, Frank (ed.) et al., Algorithms and data structures. 11th international symposium, WADS 2009, Banff, Canada, August 21–23, 2009. Proceedings. Berlin: Springer (ISBN 978-3-642-03366-7/pbk). Lecture Notes in Computer Science 5664, 61-73 (2009).
MSC:  68U05 68R10
PDFBibTeX XMLCite
Full Text: DOI Link

Filter Results by …

Document Type

Database

all top 5

Author

all top 5

Year of Publication

all top 3

Main Field