default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID36th CCCG 2024: St. Catharines, ON, Canada
- Rahnuma Islam Nishat:
Proceedings of the 36th Canadian Conference on Computational Geometry, CCCG 2024, Brock University, St. Catharines, Canada, July 17-19, 2024. 2024
Session 1A
- Hadi Khodabandeh, David Eppstein:
Maintaining Light Spanners via Minimal Updates. 1-15 - Gill Barequet, Noga Keren, Neal Madras, Johann Peters, Adi Rivkin:
On Totally-Concave Polyominoes. 17-24 - Joseph O'Rourke, Costin Vîlcu:
Skeletal Cut Loci on Convex Polyhedra. 25-31
Session 1B
- Sándor P. Fekete, Joseph S. B. Mitchell, Christian Rieck, Christian Scheffer, Christiane Schmidt:
Dispersive Vertex Guarding for Simple and Non-Simple Polygons. 33-40 - Byeonguk Kang, Junhyeok Choi, Jeesun Han, Hee-Kap Ahn:
Guarding Points on a Terrain by Watchtowers. 41-47 - Linh Nguyen, Joseph S. B. Mitchell:
Multirobot Watchman Routes in a Simple Polygon. 49-55
Session 2A
- Bruce W. Brewer, Haitao Wang:
An Improved Algorithm for Shortest Paths in Weighted Unit-Disk Graphs. 57-64 - Klára Pernicová:
Grid-edge unfolding orthostacks with rectangular slabs. 65-70 - Ulrike Stege, Sue Whitesides, Laurie J. Heyer, William J. Lenhart:
On 3-layered Cornerhedra: Optimum Box Partitions for Niches. 71-82
Session 2B
- John Stuart, Jean-Lou De Carufel, Prosenjit Bose:
The Exact Routing and Spanning Ratio of arbitrary triangle Delaunay graphs. 83-89 - Sarita de Berg, Guillermo Esteban, Rodrigo I. Silveira, Frank Staals:
Exact solutions to the Weighted Region Problem. 91-102 - Prosenjit Bose, Jean-Lou De Carufel, Guillermo Esteban, Anil Maheshwari:
Computing shortest paths amid non-overlapping weighted disks. 103-116
Session 3A
- Justin G. Bruss, William Evans, Jiaxuan Li:
Burning Simple Polygons. 117-126 - Hyuk Jun Kweon, Honglin Zhu:
Maximum Overlap Area of Several Convex Polygons Under Translations. 127-136 - Gleb Dilman, David Eppstein, Valentin Polishchuk, Christiane Schmidt:
Well-Separated Multiagent Path Traversal. 137-144
Session 3B
- Eliot W. Robson, Jack Spalding-Jamieson, Da Wei Zheng:
Carving Polytopes with Saws in 3D. 145-151 - Rishikesh Gajjala, Jayanth Ravi:
Improved upper bounds for the Heilbronn's Problem for k-gons. 153-157 - Gabriela Araujo-Pardo, Silvia Fernández-Merchant, Adriana Hansberg, Dolores Lara, Amanda Montejano, Déborah Oliveros:
The exact balanced upper chromatic number of the n-cube over t elements. 159-165
Open Problem Session
- Reymond Akpanya, Bastien Rivier, Frederick B. Stock:
Open Problems from CCCG 2024. 167-170
Session 4A
- Pitchayut Saengrungkongka, Erik D. Demaine, Nithid Anchaleenukoon, Kaylee Ji, Alex Dang:
Complexity of 2D Snake Cube Puzzles. 171-178 - Arun Kumar Das, Tomás Valla:
On Erdős-Szekeres Maker-Breaker games. 179-184 - Jaroslav Opatrny, Danny Krizanc, Denis Pankratov, Lata Narayanan:
The En Route Truck-Drone Delivery Problem. 185-197
Session 4B
- Saeed Odak, Cyril Gavoille, Nicolas Bonichon, Nicolas Hanusse:
Euclidean Freeze-Tag Problem on Plane. 199-205 - Amirhossein Mashghdoust, Stephane Durocher:
Hyperplane Distance Depth. 207-213 - J. Mark Keil, Fraser McLeod, Debajyoti Mondal:
Quantum Speedup for Some Geometric 3SUM-Hard. 215-222
Session 5A
- Antonia Kalb, Kevin Buchin, Carolin Rehs, Guangping Li:
Experimental analysis of oriented spanners on one-dimensional point sets. 223-231 - Vinesh Sridhar, Rolf Svenning:
Fast Area-Weighted-Peeling of Convex Hulls for Outlier Detection. 233-240 - Amritendu Dhar, Vijay Natarajan, Abhishek Rathod:
Geometric Localization of Homology Cycles. 241-248
Session 5B
- Myroslav Kryven, Stephane Durocher:
Generalizing Combinatorial Depth Measures to Line Segments. 249-256 - Brittany Terese Fasy, David L. Millman, Anna Schenfisch:
How Small Can Faithful Sets Be? Ordering Topological Descriptors. 257-269 - Bernardo M. Ábrego, Silvia Fernández-Merchant:
On the crossing number of symmetric configurations. 271-277
Session 6A
- Jonathan James Perry, Benjamin Raichel:
Local Frechet Permutation. 279-286 - Jens Kristian Refsgaard Schou, Bei Wang:
PersiSort: A New Perspective on Adaptive Sorting Based on Persistence. 287-301
Session 6B
- Oswin Aichholzer, Anna Brötzner, Daniel Perz, Patrick Schnider:
Flips in Odd Matchings. 303-307 - Therese Biedl, Prashant Gokhale:
Finding maximum matchings in RDV graphs efficiently. 309-316
Session 7A
- Robert D. Barish, Tetsuo Shibuya:
Polyhedral roll-connected colorings of partial tilings. 317-324 - Jayson Lynch, Jack Spalding-Jamieson:
Slant/Gokigen Naname is NP-complete. 325-332 - Guangya Cai, Ravi Janardan:
Top-k colored orthogonal range search. 333-345
Session 7B
- Minati De, Ratnadip Mandal, Subhas C. Nandy:
Set Cover and Hitting Set Problems for Some Restricted Classes of Rectangles. 347-354 - Ryan Knobel, Adrian Salinas, Robert Schweller, Tim Wylie:
Building Discrete Self-Similar Fractals in Seeded Tile Automata. 355-363
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 2026-07-29 23:47 CEST 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, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
