Complexity Inside NP - A Computational Geometry Perspective | CGinsideNP | Project | Results | H2020 | CORDIS

Long plane trees

Autorzy: Cabello, Sergio; Hoffmann, Michael; Klost, Katharina; Mulzer, Wolfgang; Tkadlec, Josef
Opublikowane w: EuroCG 2021, 2021
Wydawca: EuroCG Workshop

Drawings of Complete Multipartite Graphs up to Triangle Flips

Autorzy: Oswin Aichholzer, Man-Kwun Chiu, Hung P. Hoang, Michael Hoffmann, Jan Kyncl, Yannic Maus, Birgit Vogtenhuber, Alexandra Weinberger
Opublikowane w: SoCG 2023, 2023, Strona(/y) 6:1-6:16
Wydawca: LIPIcs
DOI: 10.4230/lipics.socg.2023.6

Unique Sink Orientations of Grids is in Unique End of Potential Line

Autorzy: Michaela Borzechowski and Wolfgang Mulzer
Opublikowane w: EuroCG 2022, 2022, Strona(/y) 34:134:8
Wydawca: University of Perugia

Distance bounds for high dimensional consistent digital rays and 2-D partially-consistent digital rays

Autorzy: Chiu, Man-Kwun; Korman, Matias; Suderland, Martin; Tokuyama, Takeshi
Opublikowane w: ESA 2020, 2020, Strona(/y) 34:1-34:22
Wydawca: LIPIcs
DOI: 10.4230/lipics.esa.2020.34

Long plane trees

Autorzy: Cabello, Sergio; Hoffmann, Michael; Klost, Katharina; Mulzer, Wolfgang; Tkadlec, Josef
Opublikowane w: Proceedings of the 38th International Symposium on Computational Geometry (SoCG), Numer 224, 2022, Strona(/y) 23:1-23:17
Wydawca: LIPIcs
DOI: 10.48550/arxiv.2101.00445

Edge Partitions of Complete Geometric Graphs

Autorzy: Oswin Aichholzer, Johannes Obenaus, Joachim Orthaber, Rosna Paul, Patrick Schnider, Raphael Steiner, Tim Taubner, Birgit Vogtenhuber
Opublikowane w: 38th International Symposium on Computational Geometry, 2022, Strona(/y) 6:1-6:16
Wydawca: LIPIcs
DOI: 10.4230/lipics.socg.2022.6

Weak Unit Disk Contact Representations for Graphs without Embedding

Autorzy: Jonas Cleve
Opublikowane w: EuroCG 2020, 2020, Strona(/y) 28:1-28:9
Wydawca: Universität Würzburg

Insertion-Only Dynamic Connectivity in General Disk Graphs

Autorzy: Haim Kaplan, Katharina Klost, Kristin Knorr, Wolfgang Mulzer, and Liam Roditty
Opublikowane w: EuroCG 2023, 2023, Strona(/y) 47:1–47:7
Wydawca: UPC Barcelona

Recognizing embedded caterpillars with weak unit disk contact representations is NP-hard

Autorzy: Man-Kwun Chiu, Jonas Cleve, Martin Nöllenburg
Opublikowane w: EuroCG 2019, 2019, Strona(/y) 47:1-47:9
Wydawca: Utrecht University

Flipping Plane Spanning Paths

Autorzy: Oswin Aichholzer, Kristin Knorr, Wolfgang Mulzer, Johannes Obenaus, Rosna Paul, and Birgit Vogtenhuber
Opublikowane w: WALCOM 2023, 2023, Strona(/y) 49-60
Wydawca: Springer Verlag
DOI: 10.1007/978-3-031-27051-2_5

Asymmetric Convex Intersection Testing

Autorzy: Barba, Luis; Mulzer, Wolfgang
Opublikowane w: SOSA 2019, Numer 69, 2019, Strona(/y) 9:1-9:14, ISBN 978-3-95977-099-6
Wydawca: OASIcs
DOI: 10.4230/oasics.sosa.2019.9

Approximate Minimum-Weight Matching with Outliers under Translation

Autorzy: Agarwal, Pankaj K.; Kaplan, Haim; Kipper, Geva; Mulzer, Wolfgang; Rote, Günter; Sharir, Micha; Xiao, Allen
Opublikowane w: ISAAC 2018, Numer 123, 2018, Strona(/y) 26:1--26:13, ISBN 978-3-95977-094-1
Wydawca: LIPIcs
DOI: 10.4230/lipics.isaac.2018.26

Maintaining the Union of Unit Discs under Insertions with Near-Optimal Overhead

Autorzy: Agarwal, Pankaj K.; Cohen, Ravid; Halperin, Dan; Mulzer, Wolfgang
Opublikowane w: SoCG 2019, Numer 129, 2019, Strona(/y) 26:1-26:15, ISBN 978-3-95977-104-7
Wydawca: LIPIcs
DOI: 10.4230/lipics.socg.2019.26

Combinatorics of Beacon-Based Routing in Three Dimensions

Autorzy: Jonas Cleve, Wolfgang Mulzer
Opublikowane w: LATIN 2018: Theoretical Informatics, Numer 10807, 2018, Strona(/y) 346-360, ISBN 978-3-319-77403-9
Wydawca: Springer International Publishing
DOI: 10.1007/978-3-319-77404-6_26

Recognizing Generalized Transmission Graphs of Line Segments and Circular Sectors

Autorzy: Katharina Klost, Wolfgang Mulzer
Opublikowane w: LATIN 2018: Theoretical Informatics, Numer 10807, 2018, Strona(/y) 683-696, ISBN 978-3-319-77403-9
Wydawca: Springer International Publishing
DOI: 10.1007/978-3-319-77404-6_50

Improved Topological Approximations by Digitization

Autorzy: Aruni Choudhary, Michael Kerber, Sharath Raghvendra
Opublikowane w: Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019, Strona(/y) 2675-2688, ISBN 978-1-61197-548-2
Wydawca: Society for Industrial and Applied Mathematics
DOI: 10.1137/1.9781611975482.166

On the Stretch Factor of Polygonal Chains

Autorzy: Chen, Ke; Dumitrescu, Adrian; Mulzer, Wolfgang; Tóth, Csaba D.
Opublikowane w: MFCS 2019, Numer 138, 2019, Strona(/y) 56:1–56:14, ISBN 978-3-95977-117-7
Wydawca: LIPIcs
DOI: 10.4230/lipics.mfcs.2019.56

An Experimental Study of Algorithms for Geodesic Shortest Paths in the Constant-Workspace Model

Autorzy: Jonas Cleve, Wolfgang Mulzer
Opublikowane w: Analysis of Experimental Algorithms - Special Event, SEA² 2019, Kalamata, Greece, June 24-29, 2019, Revised Selected Papers, Numer 11544, 2019, Strona(/y) 317-331, ISBN 978-3-030-34028-5
Wydawca: Springer International Publishing
DOI: 10.1007/978-3-030-34029-2_21

Triangles and Girth in Disk Graphs and Transmission Graphs

Autorzy: Haim Kaplan, Katharina Klost, Wolfgang Mulzer, Liam Roditty, Paul Seiferth, Micha Sharir
Opublikowane w: ESA 2019, Numer 144, 2019, Strona(/y) 64:1-64:14, ISBN 978-3-95977-124-5
Wydawca: LIPIcs
DOI: 10.4230/lipics.esa.2019.64

Long Alternating Paths Exist

Autorzy: Mulzer, Wolfgang; Valtr, Pavel
Opublikowane w: SoCG 2020, Numer 164, 2020, Strona(/y) 57:1-57:16, ISBN 978-3-95977-143-6
Wydawca: LIPIcs
DOI: 10.4230/lipics.socg.2020.57

A Generalization of Self-Improving Algorithms

Autorzy: Cheng, Siu-Wing; Chiu, Man-Kwun; Jin, Kai; Wong, Man Ting
Opublikowane w: SoCG 2020, Numer 164, 2020, Strona(/y) 29:1-29:13, ISBN 978-3-95977-143-6
Wydawca: LIPIcs
DOI: 10.4230/lipics.socg.2020.29

No-Dimensional Tverberg Theorems and Algorithms

Autorzy: Choudhary, Aruni; Mulzer, Wolfgang
Opublikowane w: SoCG 2020, Numer 164, 2020, Strona(/y) 31:1-31:17, ISBN 978-3-95977-143-6
Wydawca: LIPIcs
DOI: 10.4230/lipics.socg.2020.31

Routing in Unit Disk Graphs without Dynamic Headers

Autorzy: Mulzer, Wolfgang; Willert, Max
Opublikowane w: ISAAC 2020, 2020, Strona(/y) 16:1--16:14
Wydawca: LIPIcs
DOI: 10.4230/lipics.isaac.2020.16

The Tree Stabbing Number is not Monotone

Autorzy: Mulzer, Wolfgang; Obenaus, Johannes
Opublikowane w: EuroCG 2020, 2020, Strona(/y) 78:1-78:8
Wydawca: Universität Würzburg

Maximum Matchings in Geometric Intersection Graphs

Autorzy: Bonnet, Édouard; Cabello, Sergio; Mulzer, Wolfgang
Opublikowane w: STACS 2020, Numer 154, 2020, Strona(/y) 31:1-31:17, ISBN 978-3-95977-140-5
Wydawca: LIPIcs
DOI: 10.4230/lipics.stacs.2020.31

Routing in Histograms

Autorzy: Man-Kwun Chiu, Jonas Cleve, Katharina Klost, Matias Korman, Wolfgang Mulzer, André van Renssen, Marcel Roeloffzen, Max Willert
Opublikowane w: WALCOM: Algorithms and Computation - 14th International Conference, WALCOM 2020, Singapore, Singapore, March 31 – April 2, 2020, Proceedings, Numer 12049, 2020, Strona(/y) 43-54, ISBN 978-3-030-39880-4
Wydawca: Springer International Publishing
DOI: 10.1007/978-3-030-39881-1_5

Minimal Representations of Order Types by Geometric Graphs

Autorzy: Oswin Aichholzer, Martin Balko, Michael Hoffmann, Jan Kynčl, Wolfgang Mulzer, Irene Parada, Alexander Pilz, Manfred Scheucher, Pavel Valtr, Birgit Vogtenhuber, Emo Welzl
Opublikowane w: Graph Drawing and Network Visualization - 27th International Symposium, GD 2019, Prague, Czech Republic, September 17–20, 2019, Proceedings, Numer 11904, 2019, Strona(/y) 101-113, ISBN 978-3-030-35801-3
Wydawca: Springer International Publishing
DOI: 10.1007/978-3-030-35802-0_8

Computational Complexity of the $\alpha$-Ham-Sandwich Problem

Autorzy: Chiu, Man-Kwun; Choudhary, Aruni; Mulzer, Wolfgang
Opublikowane w: ICALP 2020, Numer 168, 2020, Strona(/y) 31:1-31:18, ISBN 978-3-95977-138-2
Wydawca: LIPIcs
DOI: 10.4230/lipics.icalp.2020.31

Compatible Spanning Trees in Simple Drawings of K_n

Autorzy: Oswin Aichholzer, Kristin Knorr, Wolfgang Mulzer, Nicolas El Maalouly, Johannes Obenaus, Rosna Paul, Meghana M. Reddy, Birgit Vogtenhuber, Alexandra Weinberger
Opublikowane w: Graph Drawing and Network Visualization - 30th International Symposium, GD 2022, 2023, Strona(/y) 16-24, ISBN 978-3-031-22202-3
Wydawca: Springer
DOI: 10.1007/978-3-031-22203-0_2

Dynamic Connectivity in Disk Graphs

Autorzy: Kaplan, Haim; Kauer, Alexander; Klost, Katharina; Knorr, Kristin; Mulzer, Wolfgang; Roditty, Liam; Seiferth, Paul
Opublikowane w: Proceedings of the 38th International Symposium on Computational Geometry (SoCG), Numer 224, 2022, Strona(/y) 49:1-49:17
Wydawca: LIPIcs
DOI: 10.4230/lipics.socg.2022.49

Flipping Plane Spanning Paths

Autorzy: Oswin Aichholzer, Kristin Knorr, Maarten Löffler, Zuzana Masárová, Wolfgang Mulzer, Johannes Obenaus, Rosna Paul, Birgit Vogtenhuber
Opublikowane w: EuroCG 2022, 2022, Strona(/y) 66:1-66:7
Wydawca: University of Perugia

Well-Separation and Hyperplane Transversals in High Dimensions

Autorzy: Helena Bergold, Daniel Bertschinger, Nicolas Grelier, Wolfgang Mulzer, Patrick Schnider
Opublikowane w: 18th Scandinavian Symposium and Workshops on Algorithm Theory, 2022, Strona(/y) 16:1-16:14
Wydawca: LIPIcs
DOI: 10.4230/lipics.swat.2022.16

Nearest-Neighbor Decompositions of Drawings

Autorzy: Jonas Cleve, Nicolas Grelier, Kristin Knorr, Maarten Löffler, Wolfgang Mulzer, Daniel Perz:
Opublikowane w: 18th Scandinavian Symposium and Workshops on Algorithm Theory, 2022, Strona(/y) 21:1-21:16
Wydawca: LIPIcs
DOI: 10.4230/lipics.swat.2022.21

Plane Spanning Trees in Edge-Colored Simple Drawings of $$K_{n}$$

Autorzy: Oswin Aichholzer, Michael Hoffmann, Johannes Obenaus, Rosna Paul, Daniel Perz, Nadja Seiferth, Birgit Vogtenhuber, Alexandra Weinberger
Opublikowane w: Graph Drawing and Network Visualization - 28th International Symposium, GD 2020, Vancouver, BC, Canada, September 16–18, 2020, Revised Selected Papers, Numer 12590, 2020, Strona(/y) 482-489, ISBN 978-3-030-68765-6
Wydawca: Springer International Publishing
DOI: 10.1007/978-3-030-68766-3_37

Stabbing pairwise intersecting disks by five points

Autorzy: Sariel Har-Peled, Haim Kaplan, Wolfgang Mulzer, Liam Roditty, Paul Seiferth, Micha Sharir, Max Willert:
Opublikowane w: ISAAC 2018, 2018
Wydawca: LIPIcs
DOI: 10.4230/lipics.isaac.2018.50

Time-Space Trade-Offs for Computing Euclidean Minimum Spanning Trees

Autorzy: Bahareh Banyassady, Luis Barba, Wolfgang Mulzer
Opublikowane w: LATIN 2018: Theoretical Informatics, Numer 10807, 2018, Strona(/y) 108-119, ISBN 978-3-319-77403-9
Wydawca: Springer International Publishing
DOI: 10.1007/978-3-319-77404-6_9

Delaunay simplices in diagonally distorted lattices

Autorzy: Aruni Choudhary, Arijit Ghosh
Opublikowane w: Computational Geometry, Numer 81, 2019, Strona(/y) 33-44, ISSN 0925-7721
Wydawca: Elsevier BV
DOI: 10.1016/j.comgeo.2019.01.010

Distance Bounds for High Dimensional Consistent Digital Rays and 2-D Partially-Consistent Digital Rays

Autorzy: Man-Kwun Chiu, Matias Korman, Martin Suderland, Takeshi Tokuyama
Opublikowane w: Discrete & Computational Geometry, Numer 68, 2022, Strona(/y) 902–944, ISSN 0179-5376
Wydawca: Springer Verlag
DOI: 10.1007/s00454-021-00349-6

Improved approximate rips filtrations with shifted integer lattices and cubical complexes.

Autorzy: Aruni Choudhary; Michael Kerber; Sharath Raghvendra
Opublikowane w: Journal of Applied and Computational Topolog, Numer 5, 2021, Strona(/y) 425-458, ISSN 2367-1734
Wydawca: Springer Verlag
DOI: 10.1007/s41468-021-00072-4

No-Dimensional Tverberg Theorems and Algorithms

Autorzy: Aruni Choudhary, Wolfgang Mulzer
Opublikowane w: Discret. Comput. Geom., Numer 68(4), 2023, Strona(/y) 964-996, ISSN 0179-5376
Wydawca: Springer Verlag
DOI: 10.1007/s00454-022-00380-1

Snipperclips: Cutting tools into desired polygons using themselves

Autorzy: Zachary Abel; Hugo A. Akitaya; Man-Kwun Chiu; Erik D. Demaine; Martin L. Demaine; Adam Hesterberg; Matias Korman; Jayson Lynch; André van Renssen; Marcel Roeloffzen
Opublikowane w: Computational Geometry: Theory and Applications, 98:101784. Elsevier, Numer 98, 2021, Strona(/y) 101784, ISSN 0925-7721
Wydawca: Elsevier BV
DOI: 10.48550/arxiv.2105.08305

On the Stretch Factor of Polygonal Chains

Autorzy: Ke Chen, Adrian Dumitrescu, Wolfgang Mulzer, Csaba D. Tóth
Opublikowane w: SIAM J. Discret. Math., Numer 35(3), 2021, Strona(/y) 1592-1614, ISSN 0895-4801
Wydawca: Society for Industrial and Applied Mathematics
DOI: 10.1137/20m1335698

Time-space trade-offs for computing Euclidean minimum spanning trees

Autorzy: Bahareh Banyassady, Luis Barba, Wolfgang Mulzer
Opublikowane w: Journal of Computational Geometry, Numer 11(1), 2020, Strona(/y) 525–547, ISSN 1920-180X
Wydawca: MacOdrum Library, Carleton University
DOI: 10.20382/jocg.v11i1a21

Stabbing pairwise intersecting disks by five points

Autorzy: Sariel Har-Peled, Haim Kaplan, Wolfgang Mulzer, Liam Roditty, Paul Seiferth, Micha Sharir, Max Willert
Opublikowane w: Discrete Mathematics, Numer Volume 344, Numer 7, 2021, Strona(/y) 112403, ISSN 0012-365X
Wydawca: Elsevier BV
DOI: 10.1016/j.disc.2021.112403

Maintaining the Union of Unit Discs under Insertions with Near-Optimal Overhead

Autorzy: Pankaj K. Agarwal, Ravid Cohen, Dan Halperin, Wolfgang Mulzer
Opublikowane w: ACM Trans. Algorithms, 2022, Strona(/y) 26:1-26:27, ISSN 1549-6325
Wydawca: Association for Computing Machinary, Inc.
DOI: 10.1145/3527614

The dual diameter of triangulations

Autorzy: Matias Korman, Stefan Langerman, Wolfgang Mulzer, Alexander Pilz, Maria Saumell, Birgit Vogtenhuber
Opublikowane w: Computational Geometry, Numer 68, 2018, Strona(/y) 243-252, ISSN 0925-7721
Wydawca: Elsevier BV
DOI: 10.1016/j.comgeo.2017.06.008

Improved time-space trade-offs for computing Voronoi diagrams

Autorzy: Bahareh Banyassady, Matias Korman, Wolfgang Mulzer, André van Renssen, Marcel Roeloffzen, Paul Seiferth, Yannik Stein
Opublikowane w: Journal of Computational Geometry, Numer 9(1), 2018, Strona(/y) 191-212, ISSN 1920-180X
Wydawca: MacOdrum Library, Carleton University
DOI: 10.20382/jocg.v9i1a6

Computational Aspects of the Colorful Carathéodory Theorem

Autorzy: Wolfgang Mulzer, Yannik Stein
Opublikowane w: Discrete & Computational Geometry, Numer 60/3, 2018, Strona(/y) 720-755, ISSN 0179-5376
Wydawca: Springer Verlag
DOI: 10.1007/s00454-018-9979-y

Faster algorithms for growing prioritized disks and rectangles

Autorzy: Hee-Kap Ahn, Sang Won Bae, Jongmin Choi, Matias Korman, Wolfgang Mulzer, Eunjin Oh, Ji-won Park, André van Renssen, Antoine Vigneron
Opublikowane w: Computational Geometry, Numer 80, 2019, Strona(/y) 23-39, ISSN 0925-7721
Wydawca: Elsevier BV
DOI: 10.1016/j.comgeo.2019.02.001

Routing in Unit Disk Graphs

Autorzy: Haim Kaplan, Wolfgang Mulzer, Liam Roditty, Paul Seiferth
Opublikowane w: Algorithmica, Numer 80/3, 2018, Strona(/y) 830-848, ISSN 0178-4617
Wydawca: Springer Verlag
DOI: 10.1007/s00453-017-0308-2

Spanners for Directed Transmission Graphs

Autorzy: Haim Kaplan, Wolfgang Mulzer, Liam Roditty, Paul Seiferth
Opublikowane w: SIAM Journal on Computing, Numer 47/4, 2018, Strona(/y) 1585-1609, ISSN 0097-5397
Wydawca: Society for Industrial and Applied Mathematics
DOI: 10.1137/16m1059692

Time–space trade-offs for triangulations and Voronoi diagrams

Autorzy: Matias Korman, Wolfgang Mulzer, André van Renssen, Marcel Roeloffzen, Paul Seiferth, Yannik Stein
Opublikowane w: Computational Geometry, Numer 73, 2018, Strona(/y) 35-45, ISSN 0925-7721
Wydawca: Elsevier BV
DOI: 10.1016/j.comgeo.2017.01.001

A constructive proof of a concentration bound for real-valued random variables

Autorzy: Wolfgang Mulzer, Natalia Shenkman
Opublikowane w: Information Processing Letters, Numer 158, 2020, Strona(/y) 105942, ISSN 0020-0190
Wydawca: Elsevier BV
DOI: 10.1016/j.ipl.2020.105942

Implicit Manifold Reconstruction

Autorzy: Siu-Wing Cheng, Man-Kwun Chiu
Opublikowane w: Discrete & Computational Geometry, Numer 62/3, 2019, Strona(/y) 700-742, ISSN 0179-5376
Wydawca: Springer Verlag
DOI: 10.1007/s00454-019-00095-w

Routing in polygonal domains

Autorzy: Bahareh Banyassady, Man-Kwun Chiu, Matias Korman, Wolfgang Mulzer, André van Renssen, Marcel Roeloffzen, Paul Seiferth, Yannik Stein, Birgit Vogtenhuber, Max Willert
Opublikowane w: Computational Geometry, Numer 87, 2020, Strona(/y) 101593, ISSN 0925-7721
Wydawca: Elsevier BV
DOI: 10.1016/j.comgeo.2019.101593

Combinatorics of beacon-based routing in three dimensions

Autorzy: Jonas Cleve, Wolfgang Mulzer
Opublikowane w: Computational Geometry, Numer 91, 2020, Strona(/y) 101667, ISSN 0925-7721
Wydawca: Elsevier BV
DOI: 10.1016/j.comgeo.2020.101667

Reachability Oracles for Directed Transmission Graphs

Autorzy: Haim Kaplan, Wolfgang Mulzer, Liam Roditty, Paul Seiferth
Opublikowane w: Algorithmica, Numer 82/5, 2020, Strona(/y) 1259-1276, ISSN 0178-4617
Wydawca: Springer Verlag
DOI: 10.1007/s00453-019-00641-1

Balanced line separators of unit disk graphs

Autorzy: Paz Carmi, Man Kwun Chiu, Matthew J. Katz, Matias Korman, Yoshio Okamoto, André van Renssen, Marcel Roeloffzen, Taichi Shiitada, Shakhar Smorodinsky
Opublikowane w: Computational Geometry, Numer 86, 2020, Strona(/y) 101575, ISSN 0925-7721
Wydawca: Elsevier BV
DOI: 10.1016/j.comgeo.2019.101575

A time–space trade-off for computing the k-visibility region of a point in a polygon

Autorzy: Yeganeh Bahoo, Bahareh Banyassady, Prosenjit K. Bose, Stephane Durocher, Wolfgang Mulzer
Opublikowane w: Theoretical Computer Science, Numer 789, 2019, Strona(/y) 13-21, ISSN 0304-3975
Wydawca: Elsevier BV
DOI: 10.1016/j.tcs.2018.06.017

On the Average Complexity of the $k$-Level

Autorzy: Steiner, Raphael; id_orcid0000-0001-8391-8949; Scheucher, Manfred; Felsner, Stefan; Valtr, Pavel; Chiu, Man-Kwun; Schnider, Patrick
Opublikowane w: Journal of Computational Geometry, Numer 11 (1), 2020, Strona(/y) 493-506, ISSN 1920-180X
Wydawca: MacOdrum Library, Carleton University
DOI: 10.3929/ethz-b-000464326

Minimum cuts in geometric intersection graphs

Autorzy: Sergio Cabello, Wolfgang Mulzer
Opublikowane w: Computational Geometry, Numer 94, 2021, Strona(/y) 101720, ISSN 0925-7721
Wydawca: Elsevier BV
DOI: 10.1016/j.comgeo.2020.101720

Rectilinear link diameter and radius in a rectilinear polygonal domain

Autorzy: Elena Arseneva, Man-Kwun Chiu, Matias Korman, Aleksandar Markovic, Yoshio Okamoto, Aurélien Ooms, André van Renssen, Marcel Roeloffzen
Opublikowane w: Computational Geometry, Numer 92, 2021, Strona(/y) 101685, ISSN 0925-7721
Wydawca: Elsevier BV
DOI: 10.1016/j.comgeo.2020.101685

Dynamic Planar Voronoi Diagrams for General Distance Functions and Their Algorithmic Applications

Autorzy: Haim Kaplan, Wolfgang Mulzer, Liam Roditty, Paul Seiferth, Micha Sharir
Opublikowane w: Discrete & Computational Geometry, Numer 64/3, 2020, Strona(/y) 838-904, ISSN 0179-5376
Wydawca: Springer Verlag
DOI: 10.1007/s00454-020-00243-7

Minimal Representations of Order Types by Geometric Graphs

Autorzy: Oswin Aichholzer, Martin Balko, Michael Hoffmann, Jan Kynčl, Wolfgang Mulzer, Irene Parada, Alexander Pilz, Manfred Scheucher, Pavel Valtr, Birgit Vogtenhuber, Emo Welzl
Opublikowane w: Journal of Graph Algorithms and Applications, Numer 24/4, 2020, Strona(/y) 551-572, ISSN 1526-1719
Wydawca: Brown University
DOI: 10.7155/jgaa.00545

Coxeter Triangulations Have Good Quality

Autorzy: Aruni Choudhary, Siargey Kachanovich, Mathijs Wintraecken
Opublikowane w: Mathematics in Computer Science, Numer 14/1, 2020, Strona(/y) 141-176, ISSN 1661-8270
Wydawca: Birkhauser Verlag
DOI: 10.1007/s11786-020-00461-5

A Generalization of Self-Improving Algorithms

Autorzy: Kai Jin, Siu-Wing Cheng, Man-Kwun Chiu, Man Ting Wong
Opublikowane w: ACM Transactions on Algorithms, Numer 18, 2022, Strona(/y) 29:1-29:32, ISSN 1549-6325
Wydawca: Association for Computing Machinary, Inc.
DOI: 10.1145/3531227

Coloring circle arrangements: New 4-chromatic planar graphs

Autorzy: Man-Kwun Chiu, Stefan Felsner, Manfred Scheucher, Felix Schröder, Raphael Steiner, Birgit Vogtenhuber
Opublikowane w: arXiv, 2022
Wydawca: arXiv

Dynamic Maintenance of the Lower Envelope of Pseudo-Lines

Autorzy: Agarwal, Pankaj K.; Cohen, Ravid; Halperin, Dan; Mulzer, Wolfgang
Opublikowane w: Numer 1, 2019
Wydawca: arXiv.rg

Special Issue on the 34th European Workshop on Computational Geometry, Guest Editors' Foreword

Autorzy: Matias Korman, Wolfgang Mulzer
Opublikowane w: Computational Geometry, Numer 84, 2019, Strona(/y) 1-2, ISSN 0925-7721
Wydawca: Elsevier BV
DOI: 10.1016/j.comgeo.2019.07.001

New Results in Sona Drawing: Hardness and TSP Separation

Autorzy: Man-Kwun Chiu, Erik D. Demaine, Yevhenii Diomidov, David Eppstein, Robert A. Hearn, Adam Hesterberg, Matias Korman, Irene Parada, Mikhail Rudoy
Opublikowane w: 2020
Wydawca: arXiv

Edge Partitions of Complete Geometric Graphs (Part 1)

Autorzy: Obenaus, Johannes; Orthaber, Joachim
Opublikowane w: arXiv, 2021
Wydawca: arXiv
DOI: 10.48550/arxiv.2108.05159

Five Proofs of Chernoff's Bound with Applications

Autorzy: Mulzer, Wolfgang
Opublikowane w: Bulletin of the EATCS, Numer 3, 2018, ISSN 0252-9742
Wydawca: European Association of Theoretical Computer Science

Computational Geometry Column 67

Autorzy: Bahareh Banyassady, Matias Korman, Wolfgang Mulzer
Opublikowane w: ACM SIGACT News, Numer 49/2, 2018, Strona(/y) 77-94, ISSN 0163-5700
Wydawca: ACM SigACT
DOI: 10.1145/3232679.3232692

A Simple Randomized $O(n \log n)$--Time Closest-Pair Algorithm in Doubling Metrics

Autorzy: Maheshwari, Anil; Mulzer, Wolfgang; Smid, Michiel
Opublikowane w: Journal of Computational Geometry, Numer 11 (1), 2020, Strona(/y) 507–524, ISSN 1920-180X
Wydawca: MacOdrum Library, Carleton University
DOI: 10.20382/jocg.v11i1a20

Complexity Inside NP - A Computational Geometry Perspective

Publikacje

Udostępnij tę stronę

Pobierz