×

Found 96 Documents (Results 1–96)

Observation routes and external watchman routes. (English) Zbl 07789717

Morin, Pat (ed.) et al., Algorithms and data structures. 18th international symposium, WADS 2023, Montreal, QC, Canada, July 31 – August 2, 2023. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 14079, 401-415 (2023).
MSC:  68P05 68Wxx
PDFBibTeX XMLCite
Full Text: DOI arXiv

Maximal distortion of geodesic diameters in polygonal domains. (English) Zbl 07781736

Hsieh, Sun-Yuan (ed.) et al., Combinatorial algorithms. 34th international workshop, IWOCA 2023, Tainan, Taiwan, June 7–10, 2023. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13889, 197-208 (2023).
MSC:  68Rxx 68Wxx
PDFBibTeX XMLCite
Full Text: DOI arXiv

Sparse hop spanners for unit disk graphs. (English) Zbl 07765415

Cao, Yixin (ed.) et al., 31st international symposium on algorithms and computation, ISAAC 2020, Hong Kong, China, virtual conference, December 14–18, 2020. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 181, Article 57, 17 p. (2020).
MSC:  68Wxx
PDFBibTeX XMLCite
Full Text: DOI

Cutting polygons into small pieces with chords: laser-based localization. (English) Zbl 07651146

Grandoni, Fabrizio (ed.) et al., 28th annual European symposium on algorithms. ESA 2020, September 7–9, 2020, Pisa, Italy, virtual conference. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 173, Article 7, 23 p. (2020).
MSC:  68Wxx
PDFBibTeX XMLCite
Full Text: DOI arXiv

Simple topological drawings of \(k\)-planar graphs. (English) Zbl 07436633

Auber, David (ed.) et al., Graph drawing and network visualization. 28th international symposium, GD 2020, Vancouver, BC, Canada, September 16–18, 2020. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 12590, 390-402 (2020).
MSC:  68R10 68U05
PDFBibTeX XMLCite
Full Text: DOI arXiv

Polygons with prescribed angles in 2D and 3D. (English) Zbl 07436613

Auber, David (ed.) et al., Graph drawing and network visualization. 28th international symposium, GD 2020, Vancouver, BC, Canada, September 16–18, 2020. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 12590, 135-147 (2020).
MSC:  68R10 68U05
PDFBibTeX XMLCite
Full Text: DOI arXiv

Quantitative restrictions on crossing patterns. (English) Zbl 1476.05142

Hong, Seok-Hee (ed.) et al., Beyond planar graphs. Communications of National Institute of Informatics (NII) Shonan meetings, Shonan, Japan, November 27 – December 1, 2016. Singapore: Springer. 11-29 (2020).
MSC:  05C62 05C10
PDFBibTeX XMLCite
Full Text: DOI

On the stretch factor of polygonal chains. (English) Zbl 07561700

Rossmanith, Peter (ed.) et al., 44th international symposium on mathematical foundations of computer science, MFCS 2019, Aachen, Germany, August 26–30, 2019. Proceedings. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 138, Article 56, 14 p. (2019).
MSC:  68Qxx
PDFBibTeX XMLCite
Full Text: DOI

Convex polygons in Cartesian products. (English) Zbl 07559222

Barequet, Gill (ed.) et al., 35th international symposium on computational geometry, SoCG 2019, Portland, Oregon, USA, June 18–21, 2019. Proceedings. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 129, Article 22, 17 p. (2019).
MSC:  68U05
PDFBibTeX XMLCite
Full Text: DOI arXiv

Circumscribing polygons and polygonizations for disjoint line segments. (English) Zbl 07559209

Barequet, Gill (ed.) et al., 35th international symposium on computational geometry, SoCG 2019, Portland, Oregon, USA, June 18–21, 2019. Proceedings. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 129, Article 9, 17 p. (2019).
MSC:  68U05
PDFBibTeX XMLCite
Full Text: DOI

Reconstruction of the crossing type of a point set from the compatible exchange graph of noncrossing spanning trees. (English) Zbl 1522.68670

Couprie, Michel (ed.) et al., Discrete geometry for computer imagery. 21st IAPR international conference, DGCI 2019, Marne-la-Vallée, France, March 26–28, 2019, Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11414, 234-245 (2019).
MSC:  68U05 68R10
PDFBibTeX XMLCite
Full Text: DOI

Maximum area axis-aligned square packings. (English) Zbl 1512.68399

Potapov, Igor (ed.) et al., 43rd international symposium on mathematical foundations of computer science. MFCS 2018, Liverpool, United Kingdom, August 27–31, 2018. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 117, Article 77, 15 p. (2018).
MSC:  68U05 68Q17 68Q25
PDFBibTeX XMLCite
Full Text: DOI arXiv

Gap-planar graphs. (English) Zbl 1503.68203

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, 531-545 (2018).
MSC:  68R10 68Q25
PDFBibTeX XMLCite
Full Text: DOI arXiv

Two-planar graphs are quasiplanar. (English) Zbl 1441.68187

Larsen, Kim G. (ed.) et al., 42nd international symposium on mathematical foundations of computer science, MFCS 2017, August 21–25, 2017, Aalborg, Denmark. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 83, Article 47, 14 p. (2017).
MSC:  68R10 05C10
PDFBibTeX XMLCite
Full Text: DOI arXiv

Constant-factor approximation for TSP with disks. (English) Zbl 1394.90479

Loebl, Martin (ed.) et al., A journey through discrete mathematics. A tribute to Jiří Matoušek. Cham: Springer (ISBN 978-3-319-44478-9/hbk; 978-3-319-44479-6/ebook). 375-390 (2017).
MSC:  90C27 90C59
PDFBibTeX XMLCite
Full Text: DOI arXiv

Minimum weight connectivity augmentation for planar straight-line graphs. (English) Zbl 1430.68171

Poon, Sheung-Hung (ed.) et al., WALCOM: algorithms and computation. 11th international conference and workshops, WALCOM 2017, Hsinchu, Taiwan, March 29–31, 2017. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 10167, 204-216 (2017).
MSC:  68R10 68U05
PDFBibTeX XMLCite
Full Text: DOI arXiv

Multi-colored spanning graphs. (English) Zbl 1478.68207

Hu, Yifan (ed.) et al., Graph drawing and network visualization. 24th international symposium, GD 2016, Athens, Greece, September 19–21, 2016. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 9801, 81-93 (2016).
PDFBibTeX XMLCite
Full Text: DOI arXiv

Monotone paths in geometric triangulations. (English) Zbl 1391.68108

Mäkinen, Veli (ed.) et al., Combinatorial algorithms. 27th international workshop, IWOCA 2016, Helsinki, Finland, August 17–19, 2016. Proceedings. Cham: Springer (ISBN 978-3-319-44542-7/pbk; 978-3-319-44543-4/ebook). Lecture Notes in Computer Science 9843, 411-422 (2016).
MSC:  68U05 68R10
PDFBibTeX XMLCite
Full Text: DOI arXiv

Convex polygons in geometric triangulations. (English) Zbl 1372.68262

Dehne, Frank (ed.) et al., Algorithms and data structures. 14th international symposium, WADS 2015, Victoria, BC, Canada, August 5–7, 2015. Proceedings. Cham: Springer (ISBN 978-3-319-21839-7/pbk; 978-3-319-21840-3/ebook). Lecture Notes in Computer Science 9214, 289-300 (2015).
MSC:  68U05 52B55 05C76
PDFBibTeX XMLCite
Full Text: DOI arXiv

On the number of anchored rectangle packings for a planar point set. (English) Zbl 1432.05007

Xu, Dachuan (ed.) et al., Computing and combinatorics. 21st international conference, COCOON 2015, Beijing, China, August 4–6, 2015. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 9198, 377-389 (2015).
MSC:  05A15 05C10 05B40
PDFBibTeX XMLCite
Full Text: DOI

Monotone paths in planar convex subdivisions and polytopes. (English) Zbl 1275.52019

Bezdek, Károly (ed.) et al., Discrete geometry and optimization. Selected papers based on the presentations at the conference and workshop, Toronto, Canada, September 19–23, 2011. New York, NY: Springer (ISBN 978-3-319-00199-9/hbk; 978-3-319-00200-2/ebook). Fields Institute Communications 69, 79-104 (2013).
MSC:  52C45 68U05
PDFBibTeX XMLCite
Full Text: DOI

Simultaneously flippable edges in triangulations. (English) Zbl 1374.05073

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, 138-145 (2012).
MSC:  05C10
PDFBibTeX XMLCite
Full Text: DOI

Open guard edges and edge guards in simple polygons. (English) Zbl 1374.68671

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, 54-64 (2012).
MSC:  68U05
PDFBibTeX XMLCite
Full Text: DOI

Convex partitions with 2-edge connected dual graphs. (English) Zbl 1248.68517

Ngo, Hung Q. (ed.), Computing and combinatorics. 15th annual international conference, COCOON 2009, Niagara Falls, NY, USA, July 13–15, 2009. Proceedings. Berlin: Springer (ISBN 978-3-642-02881-6/pbk). Lecture Notes in Computer Science 5609, 192-204 (2009).
MSC:  68U05
PDFBibTeX XMLCite
Full Text: DOI

Connectivity augmentation in plane straight line graphs. (English) Zbl 1267.05158

Ossona de Mendez, Patrice (ed.) et al., The international conference on topological and geometric graph theory. Papers from the conference (TGGT 2008) held at the École Normale Supérieure, Paris, France, May 19–23, 2008. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 31, 49-52 (2008).
MSC:  05C40 05C62 05C76
PDFBibTeX XMLCite
Full Text: DOI

Filter Results by …

Document Type

all top 5

Author

all top 5

Year of Publication

all top 3

Main Field

Software