default search action
34th CCCG 2023: Montreal, QC, Canada
- Denis Pankratov:
Proceedings of the 35th Canadian Conference on Computational Geometry, CCCG 2023, Concordia University, Montreal, Quebec, Canada, July 31 - August 4, 2023. 2023 - Nathan Wachholz, Subhash Suri:
Spanning Tree, Matching, and TSP for Moving Points: Complexity and Regret. 1-7 - Stephane Durocher, Shahin Kamali, Pouria Zamani Nezhad:
Online Square Packing with Predictions. 9-18 - Stephane Durocher, J. Mark Keil, Debajyoti Mondal:
Minimum Ply Covering of Points with Unit Disks. 19-25 - Takumi Shiota, Tonan Kamata, Ryuhei Uehara:
Overlapping of Lattice Unfolding for Cuboids. 27-33 - David Eppstein:
A Parameterized Algorithm for Flat Folding. 35-42 - Ahmad Biniaz, Prosenjit Bose, Thomas C. Shermer:
Piercing Unit Geodesic Disks. 43-49 - Joseph O'Rourke, Hugo A. Akitaya, Erik D. Demaine, Adam Hesterberg, Anna Lubiw, Jayson Lynch, Frederick Stock:
Super Guarding and Dark Rays in Art Galleries. 51-61 - Yeganeh Bahoo, Onur Cagirici, Kody Manastyrski, Rahnuma Islam Nishat, Christopher Kolios, Roni Sherman:
Conflict-Free Chromatic Guarding of Orthogonal Polygons with Sliding Cameras. 63-70 - Ahmad Biniaz, Mohammad Hashemi:
City Guarding with Cameras of Bounded Field of View. 71-76 - Therese Biedl, David Eppstein, Torsten Ueckerdt:
On the complexity of embedding in graph products. 77-88 - Michael A. Bekos, Michael Kaufmann, Maria Eleni Pavlidi, Xenia Rieger:
On the Deque and Rique Numbers of Complete and Complete Bipartite Graphs. 89-95 - Pilar Cano, Sujoy Bhore, Prosenjit Bose, Jean Cardinal, John Iacono:
Dynamic Schnyder woods. 97-104 - Diego Ihara, Karine Chubarian, Bohan Fan, Francesco Sgherzi, Thiruvenkadam S. Radhakrishnan, Anastasios Sidiropoulos, Angelo Straight:
Geometric Algorithms for k-NN Poisoning. 105-112 - Simon Weber, Josiah Rohrer:
Reducing Nearest Neighbor Training Sets Optimally and Exactly. 113-121 - Georgiy Klimenko, Benjamin Raichel:
Square Hardness for Clustering with Neighborhoods. 123-127 - Prosenjit Bose, Anthony D'Angelo, Stephane Durocher:
CCOSKEG Discs in Simple Polygons. 129-152 - Chaeyoon Chung, Taehoon Ahn, Sang Won Bae, Hee-Kap Ahn:
Parallel Line Centers with Guaranteed Separation. 153-159 - Shahin Kamali, Mohammadmasoud Shabanijou:
Improved Algorithms for Burning Planar Point Sets. 161-167 - Sariel Har-Peled, Benjamin Raichel:
On the Budgeted Hausdorff Distance Problem. 169-173 - Oliver A. Chubet, Parth Parikh, Donald R. Sheehy, Siddharth S. Sheth:
Approximating the Directed Hausdorff Distance. 175-189 - Jesper Jansson, Christos Levcopoulos, Andrzej Lingas:
Convex Hulls and Triangulations of Planar Point Sets on the Congested Clique. 183-189 - Yuki Kawakami, Shun Takahashi, Kazuhisa Seto, Takashi Horiyama, Yuki Kobayashi, Yuya Higashikawa, Naoki Katoh:
Lower Bounds for the Thickness and the Total Number of Edge Crossings of Euclidean Minimum Weight Laman Graphs and (2,2)-Tight Graphs. 191-196 - David Eppstein, Rose McCarty:
Geometric Graphs with Unbounded Flip-Width. 197-206 - Sushovan Majhi:
Graph Mover's Distance: An Efficiently Computable Distance Measure for Geometric Graphs. 207-212 - Erin W. Chambers, Benjamin Holmgren, Brittany Terese Fasy, Sushovan Majhi, Carola Wenk:
Metric and Path-Connectedness Properties of the Fréchet Distance for Paths and Graphs. 213-224 - Peter Schäfer, Sabine Storandt, Johannes Zink:
Optimal Polyline Simplification under the Local Fréchet Distance in 2D in (Near-)Quadratic Time. 225-238 - Kyuseo Park, Markus Schneider:
Partition, Reduction, and Conquer: A Geometric Feature-Based Approach to Convex Hull Computation. 239-247 - Auguste H. Gezalyan, Madeline Bumpus, Xufeng Dai, Sam Muñoz, Renita Santhoshkumar, Songyu Ye, David M. Mount:
Software and Analysis for Dynamic Voronoi Diagrams in the Hilbert Metric. 249-255 - Joseph O'Rourke:
Every Combinatorial Polyhedron Can Unfold with Overlap. 257-263 - Robert M. Alaniz, Michael J. Coulombe, Erik D. Demaine, Bin Fu, Ryan Knobel, Timothy Gomez, Elise Grizzell, Andrew Rodriguez, Robert T. Schweller, Tim Wylie:
Reconfiguration of Linear Surface Chemical Reaction Networks with Bounded State Change. 265-271 - Emily Downing, Stephanie Einstein, Elizabeth Hartung, Aaron Williams:
Catalan Squares and Staircases: Relayering and Repositioning Gray Codes. 273-281 - Tuyen Pham, Hubert Wagner:
Computing Representatives of Persistent Homology Generators with a Double Twist. 283-290 - Ovidiu Daescu, Ka Yaw Teo:
Approximate Line Segment Nearest Neighbor Search amid Polyhedra in 3-Space. 291-297 - Mook Kwon Jung, Sang Duk Yoon, Hee-Kap Ahn, Takeshi Tokuyama:
Universal convex covering problems under affine dihedral group actions. 299-305 - Qizheng He:
On the FPT Status of Monotone Convex Chain Cover. 307-312 - Nilanjana G. Basu, Subhashis Majumder, Partha Bhowmick:
On Density Extrema for Digital '1-Balls in 2D and 3D. 313-319
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-11-22 19:32 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: