default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID34th CCCG 2022: Toronto, ON, Canada
- Yeganeh Bahoo, Konstantinos Georgiou:
Proceedings of the 34th Canadian Conference on Computational Geometry, CCCG 2022, Toronto Metropolitan University, Toronto, Ontario, Canada, August 25-27, 2022. 2022 - Aditya Acharya, David M. Mount:
Optimally Tracking Labels on an Evolving Tree. CCCG 2022: 1-8 - Elena Arseneva, Erik D. Demaine, Tonan Kamata, Ryuhei Uehara:
Discretization to Prove the Nonexistence of "Small" Common Unfoldings Between Polyhedra. CCCG 2022: 9-23 - Gill Barequet, Shion Fukuzawa, Michael T. Goodrich, David M. Mount, Martha C. Osegueda, Evrim Ozel:
Optimally Confining Lattice Polymers. CCCG 2022: 24-15 - Robert D. Barish, Tetsuo Shibuya:
Diamonds are Forever in the Blockchain: Geometric Polyhedral Point-Set Pattern Matching. CCCG 2022: 16-31 - Aya Bernstine, Yehonatan Mizrahi:
Efficiently Enumerating Scaled Copies of Point Set Patterns. CCCG 2022: 32-39 - Binay Bhattacharya, Tsunehiko Kameda, Amirhossein Mozafari:
A Sub-quadratic Time Algorithm for the Proximity Connected k-center Problem on Paths via Modular Arithmetic. CCCG 2022: 40-47 - Therese Biedl:
Drawing complete outer-1-planar graphs in linear area. CCCG 2022: 48-54 - Ahmad Biniaz, Prosenjit Bose, Patrick Devaney:
A 13/9-approximation of the average-2π/3-MST. CCCG 2022: 55-59 - Prosenjit Bose, Guillermo Esteban, Anil Maheshwari:
Weighted shortest path in equilateral triangular meshes. CCCG 2022: 60-67 - Oliver A. Chubet:
Maximum Subbarcode Matching and Subbarcode Distance. CCCG 2022: 68-74 - Jaehoon Chung, Sang Won Bae, Chan-Su Shin, Sang Duk Yoon, Hee-Kap Ahn:
Approximating Convex Polygons by Histogons. CCCG 2022: 75-82 - Ovidiu Daescu, Ka Yaw Teo:
Fast Deterministic Approximation of Medoid in Rd. CCCG 2022: 83-90 - Ovidiu Daescu, Ka Yaw Teo:
The Median Line Segment Problem: Computational Complexity and Constrained Variants. CCCG 2022: 91-97 - Erik D. Demaine, Hiro Ito, Jayson Lynch, Ryuhei Uehara:
Computational Complexity of Flattening Fixed-Angle Orthogonal Chains. CCCG 2022: 98-104 - Loïc Dubois:
A bound for Delaunay flip algorithms on flat tori (Best Student Paper Award). CCCG 2022: 105-112 - Stephane Durocher, Alexandre Leblanc, Sachini Rajapakse:
Computing Batched Depth Queries and the Depth of a Set of Points. CCCG 2022: 113-120 - Stephane Durocher, Spencer Szabados:
Curve Stabbing Depth: Data Depth for Plane Curves. CCCG 2022: 121-128 - David Eppstein:
Reflections in an Octagonal Mirror Maze. CCCG 2022: 129-134 - David Eppstein:
Locked and Unlocked Smooth Embeddings of Surfaces. CCCG 2022: 135-142 - David Eppstein:
Orthogonal Dissection into Few Rectangles. CCCG 2022: 143-150 - Mohammad Javad Eslamibidgoli, Hamid Zarrabi-Zadeh:
Minimum Enclosing Spherical/Cylindrical Shells in High-Dimensional Streams. CCCG 2022: 151-155 - James Freitag, Neshat Mohammadi, Aditya Potukuchi, Lev Reyzin:
On the Geometry of Stable Steiner Tree Instances. CCCG 2022: 156-161 - Dániel Garamvölgyi, Tibor Jordán:
Globally linked pairs in braced maximal outerplanar graphs. CCCG 2022: 162-168 - Kirby Gordon, Jacob Lezberg, Aaron Williams:
Unstacking Slabs Safely in Megalit is NP-Hard. CCCG 2022: 169-176 - Junnosuke Hoshido, Tonan Kamata, Tsutomu Ansai, Ryuhei Uehara:
Computational Complexity of One-Dimensional Origami and Its Application to Digital Signature. CCCG 2022: 177-183 - Attila Jung:
Quantitative Helly-type Hypergraph Chains. CCCG 2022: 184-188 - Shahin Kamali, Pooya Nikbakht:
Online Square Packing with Rotation. CCCG 2022: 189-197 - Shahin Kamali, Pooya Nikbakht, Arezoo Sajadpour:
A Randomized Algorithm for Non-crossing Matching of Online Points. CCCG 2022: 198-204 - J. Mark Keil, Debajyoti Mondal, Ehsan Moradi:
Burning Number for the Points in the Plane. CCCG 2022: 205-211 - Hwi Kim, Jaegun Lee, Hee-Kap Ahn:
Uniformly Monotone Partitioning of Polygons Revisited. CCCG 2022: 212-218 - Erik Krohn, Bengt J. Nilsson, Christiane Schmidt:
Opposing Half Guards. CCCG 2022: 219-226 - Anna Lubiw, Graeme Stroud:
Computing Realistic Terrains from Imprecise Elevations. CCCG 2022: 227-234 - Victor Milenkovic, Elisha Sacks:
Efficient Predicate Evaluation using Statistical Degeneracy Detection. CCCG 2022: 235-242 - Josef Minarík:
Unfolding Some Classes of One-Layer Polycubes. CCCG 2022: 243-248 - Neeldhara Misra, Harshil Mittal, Saraswati Nanoti:
Diverse Non Crossing Matchings. CCCG 2022: 249-256 - Ali Mohammad Lavasani, Denis Pankratov, Mohammad Ali Abam:
Maximum Weight Convex Polytope. CCCG 2022: 257-263 - Ali Mostafavi, Ali Hamzeh:
High-Dimensional Axis-Aligned Bounding Box with Outliers. CCCG 2022: 264-269 - Joseph O'Rourke, Anna Lubiw, Ryuhei Uehara, Chie Nara, Thomas C. Hull, Klara Mundilova, Josef Tkadlec:
Quasi-Twisting Convex Polyhedra. CCCG 2022: 270-276 - Sagnik Saha, Erik D. Demaine:
ZHED is NP-complete. CCCG 2022: 277-283 - Anna Schenfisch, Brittany Terese Fasy, Samuel Micka, David L. Millman, Lucia Williams:
Efficient Graph Reconstruction and Representation Using Augmented Persistence Diagrams. CCCG 2022: 284-292 - Alireza Shavali, Hamid Zarrabi-Zadeh:
On the Biplanar and k-Planar Crossing Numbers. CCCG 2022: 293-297 - Randal Tuggle, Davis Murphy, Nicholas Lorch:
A Constant Time Algorithm for Solving Simple Rolling Cube Mazes. CCCG 2022: 298-305 - Giovanni Viglietta:
A Theory of Spherical Diagrams. CCCG 2022: 306-313 - Austin Watkins, Jeff M. Phillips:
Using Existential Theory of the Reals to Bound VC Dimension. CCCG 2022: 314-321 - Jingjin Yu, Mario Szegedy:
Budgeted Steiner Networks: Three Terminals with Equal Path Weights. CCCG 2022: 322-329
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-12-23 19:41 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:
