CCCG

Keyphrases

Publications

2023

Mook Kwon Jung, Sang Duk Yoon, Hee-Kap Ahn, Takeshi Tokuyama
Universal convex covering problems under affine dihedral group actions. CCCG (2023)
Sariel Har-Peled, Benjamin Raichel
On the Budgeted Hausdorff Distance Problem. CCCG (2023)
Ahmad Biniaz, Mohammad Hashemi
City Guarding with Cameras of Bounded Field of View. CCCG (2023)
Ovidiu Daescu, Ka Yaw Teo
Approximate Line Segment Nearest Neighbor Search amid Polyhedra in 3-Space. CCCG (2023)
Ahmad Biniaz, Prosenjit Bose, Thomas C. Shermer
Piercing Unit Geodesic Disks. CCCG (2023)
Qizheng He
On the FPT Status of Monotone Convex Chain Cover. CCCG (2023)
David Eppstein, Rose McCarty
Geometric Graphs with Unbounded Flip-Width. CCCG (2023)
Simon Weber, Josiah Rohrer
Reducing Nearest Neighbor Training Sets Optimally and Exactly. CCCG (2023)
Peter Schäfer, Sabine Storandt, Johannes Zink
Optimal Polyline Simplification under the Local Fréchet Distance in 2D in (Near-)Quadratic Time. CCCG (2023)
Diego Ihara, Karine Chubarian, Bohan Fan, Francesco Sgherzi, Thiruvenkadam S. Radhakrishnan, Anastasios Sidiropoulos, Angelo Straight
Geometric Algorithms for k-NN Poisoning. CCCG (2023)
Chaeyoon Chung, Taehoon Ahn, Sang Won Bae, Hee-Kap Ahn
Parallel Line Centers with Guaranteed Separation. CCCG (2023)
Oliver A. Chubet, Parth Parikh, Donald R. Sheehy, Siddharth S. Sheth
Approximating the Directed Hausdorff Distance. CCCG (2023)
Proceedings of the 35th Canadian Conference on Computational Geometry, CCCG 2023, Concordia University, Montreal, Quebec, Canada, July 31 - August 4, 2023 CCCG (2023)
Nilanjana G. Basu, Subhashis Majumder, Partha Bhowmick
On Density Extrema for Digital '1-Balls in 2D and 3D. CCCG (2023)
Kyuseo Park, Markus Schneider
Partition, Reduction, and Conquer: A Geometric Feature-Based Approach to Convex Hull Computation. CCCG (2023)
Georgiy Klimenko, Benjamin Raichel
Square Hardness for Clustering with Neighborhoods. CCCG (2023)
Jesper Jansson, Christos Levcopoulos, Andrzej Lingas
Convex Hulls and Triangulations of Planar Point Sets on the Congested Clique. CCCG (2023)
Prosenjit Bose, Anthony D'Angelo, Stephane Durocher
CCOSKEG Discs in Simple Polygons. CCCG (2023)
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. CCCG (2023)
Therese Biedl, David Eppstein, Torsten Ueckerdt
On the complexity of embedding in graph products. CCCG (2023)
Stephane Durocher, J. Mark Keil, Debajyoti Mondal
Minimum Ply Covering of Points with Unit Disks. CCCG (2023)
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. CCCG (2023)
Nathan Wachholz, Subhash Suri
Spanning Tree, Matching, and TSP for Moving Points: Complexity and Regret. CCCG (2023)
Yeganeh Bahoo, Onur Cagirici, Kody Manastyrski, Rahnuma Islam Nishat, Christopher Kolios, Roni Sherman
Conflict-Free Chromatic Guarding of Orthogonal Polygons with Sliding Cameras. CCCG (2023)
Sushovan Majhi
Graph Mover's Distance: An Efficiently Computable Distance Measure for Geometric Graphs. CCCG (2023)
Shahin Kamali, Mohammadmasoud Shabanijou
Improved Algorithms for Burning Planar Point Sets. CCCG (2023)
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. CCCG (2023)
Emily Downing, Stephanie Einstein, Elizabeth Hartung, Aaron Williams
Catalan Squares and Staircases: Relayering and Repositioning Gray Codes. CCCG (2023)
Stephane Durocher, Shahin Kamali, Pouria Zamani Nezhad
Online Square Packing with Predictions. CCCG (2023)
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. CCCG (2023)
Pilar Cano, Sujoy Bhore, Prosenjit Bose, Jean Cardinal, John Iacono
Dynamic Schnyder woods. CCCG (2023)
Michael A. Bekos, Michael Kaufmann, Maria Eleni Pavlidi, Xenia Rieger
On the Deque and Rique Numbers of Complete and Complete Bipartite Graphs. CCCG (2023)
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. CCCG (2023)
David Eppstein
A Parameterized Algorithm for Flat Folding. CCCG (2023)
Takumi Shiota, Tonan Kamata, Ryuhei Uehara
Overlapping of Lattice Unfolding for Cuboids. CCCG (2023)
Tuyen Pham, Hubert Wagner
Computing Representatives of Persistent Homology Generators with a Double Twist. CCCG (2023)
Joseph O'Rourke
Every Combinatorial Polyhedron Can Unfold with Overlap. CCCG (2023)

2022