default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID30th CCCG 2018: Winnipeg, Manitoba, Canada
- Stephane Durocher, Shahin Kamali:
Proceedings of the 30th Canadian Conference on Computational Geometry, CCCG 2018, August 8-10, 2018, University of Manitoba, Winnipeg, Manitoba, Canada. 2018
Paul Erdös Memorial Lecture
- Matthew J. Katz:
Geometric Problems and Structures Arising from the Study of Wireless Networks. 1
Session 1A
- Michael T. Goodrich, Timothy Johnson:
Low Ply Drawings of Trees and 2-Trees. 2-10 - Petra Mutzel, Lutz Oettershagen:
The Crossing Number of Semi-Pair-Shellable Drawings of Complete Graphs. 11-17 - Robin Lynne Belton, Brittany Terese Fasy, Rostik Mertz, Samuel Micka, David L. Millman, Daniel Salinas, Anna Schenfisch, Jordan Schupbach, Lucia Williams:
Learning Simplicial Complexes from Persistence Diagrams. 18-27
Session 1B
- Addison Allen, Aaron Williams:
Sto-Stone is NP-Complete. 28-34 - Daniel Packer, Sophia White, Aaron Williams:
A Paper on Pencils: A Pencil and Paper Puzzle - Pencils is NP-Complete. 35-41 - Jonathan Gabor, Aaron Williams:
Switches are PSPACE-Complete. 42-48
Session 2A
- Ahmad Biniaz, Alfredo García:
Packing Plane Spanning Trees into a Point Set. 49-53 - Elena Arseneva, Yeganeh Bahoo, Ahmad Biniaz, Pilar Cano, Farah Chanchary, John Iacono, Kshitij Jain, Anna Lubiw, Debajyoti Mondal, Khadijeh Sheikhan, Csaba D. Tóth:
Compatible Paths on Labelled Point Sets. 54-60 - Katsuhisa Yamanaka, Takashi Horiyama, Takeaki Uno, Kunihiro Wasa:
Ladder-Lottery Realization. 61-67
Session 2B
- Kazuyuki Amano, Shin-Ichi Nakano:
Away from Rivals. 68-71 - Mahdi Imanparast, Seyed Naser Hashemi, Ali Mohades:
An Efficient Approximation for Point-set Diameter in Higher Dimensions. 72-77 - Don Sheehy, Oliver Kisielius, Nicholas J. Cavanna:
Computing the Shift-Invariant Bottleneck Distance for Persistence Diagrams. 78-84
Session 3A
- Xiaozhou He, Zhihui Liu, Bing Su, Yinfeng Xu, Feifeng Zheng, Binhai Zhu:
Hitting a Set of Line Segments with One or Two Discrete Centers. 85-90 - Joseph Masterjohn, Victor Milenkovic, Elisha Sacks:
Finding Intersections of Algebraic curves in a Convex Region using Encasement. 91-97 - David Eppstein, Michael T. Goodrich, Jordan Jorgensen, Manuel R. Torres:
Geometric Fingerprint Recognition via Oriented Point-Set Pattern Matching. 98-113
Session 3B
- Kaiying Hou, Jayson Lynch:
The Computational Complexity of Finding Hamiltonian Cycles in Grid Graphs of Semiregular Tessellations. 114-128 - Ioana Oriana Bercea:
Improved Bounds for the Traveling Salesman Problem with Neighborhoods on Uniform Disks. 129-141 - Vahideh Keikha, Maarten Löffler, Ali Mohades, Zahed Rahmati:
Width and Bounding Box of Imprecise Points. 142-148
Open Problem Session
- Joseph O'Rourke:
Open Problems from CCCG 2017. 149-154
Distinguished Lecture
- Carola Wenk:
On Map Construction, Map Comparison, and Trajectory Clustering. 155-157
Session 4A
- Logan Pedersen, Haitao Wang:
On the Coverage of Points in the Plane by Disks Centered at a Line. 158-164 - Sepideh Aghamolaei, Mohammad Ghodsi:
A Composable Coreset for k-Center in Doubling Metrics. 165-171 - Christopher Liaw, Paul Liu, Robert Reiss:
Approximation Schemes for Covering and Packing in the Streaming Model. 172-179 - Woojin Kim, Facundo Mémoli:
Formigrams: Clustering Summaries of Dynamic Data. 180-188
Session 4B
- Mirela Damian, Robin Y. Flatland:
Unfolding Low-Degree Orthotrees with Constant Refinement. 189-208 - Nina Amenta, Carlos Rojas:
Dihedral Rigidity and Deformation. 209-216 - Luis Garcia, Andres Gutierrez, Isaac Ruiz, Andrew Winslow:
Vertex Unfoldings of Orthogonal Polyhedra: Positive, Negative, and Inconclusive Results. 217-222 - Chloe Arluck, Victor Milenkovic, Elisha Sacks:
Approximate Free Space Construction and Maximum Clearance Path Planning for a Four Degree of Freedom Robot. 223-229
Session 5A
- Therese Biedl, Ahmad Biniaz, Veronika Irvine, Philipp Kindermann, Anurag Murty Naredla, Alexi Turcotte:
Integral Unit Bar-Visibility Graphs. 230-246 - Wei-Yu Lai, Tien-Ruey Hsiang:
Continuous Terrain Guarding with Two-Sided Guards. 247-252 - Israel Aldana-Galván, Carlos Alegría-Galicia, Jose Luis Álvarez-Rebollar, Nestaly Marín-Nevárez, Erick Solís-Villarreal, Jorge Urrutia, Carlos Velarde:
Finding Minimum Witness Sets in Orthogonal Polygons. 253-258
Session 5B
- Matthew P. Johnson:
Red-Blue-Partitioned MST, TSP, and Matching. 259-264 - Rafael G. Cano, Cid C. de Souza, Pedro J. de Rezende:
Optimal Solutions for a Geometric Knapsack Problem using Integer Programming. 265-271 - David Bremner, Rasoul Shahsavarifar:
Approximate Data Depth Revisited. 272-281
Session 6A
- Jie Xue, Yuan Li, Ravi Janardan:
Approximate Range Closest-Pair Search. 282-287 - Anil Maheshwari, Arash Nouri, Jörg-Rüdiger Sack:
Time-Dependent Shortest Path Queries Among Growing Discs. 288-295 - Ovidiu Daescu, Kyle Fox, Ka Yaw Teo:
Trajectory Planning for an Articulated Probe. 296-303
Session 6B
- Tomás Feder, Pavol Hell, Carlos S. Subi:
Distance-Two Coloring of Barnette Graphs. 304-310 - Bardia Hamedmohseni, Zahed Rahmati, Debajyoti Mondal:
Emanation Graph: A New t-Spanner. 311-317 - Konstantinos Mastakas:
Uniform 2D-Monotone Minimum Spanning Graphs. 318-325
Ferran Hurtado Memorial Lecture
- Marc J. van Kreveld:
On Nonogram and Graph Planarity Puzzle Generation. 326-327
Session 7A
- Joseph O'Rourke, Emmely Rogers:
Threadable Curves. 328-333 - Ali Gholami Rudi:
Looking for Bird Nests: Identifying Stay Points with Bounded Gaps. 334-339 - Parasara Sridhar Duggirala, Donald R. Sheehy:
When Can We Treat Trajectories as Points? 340-345 - Ahmad Biniaz, Anil Maheshwari, Michiel H. M. Smid:
Compatible 4-Holes in Point Sets. 346-352
Session 7B
- Erin W. Chambers, Tao Ju, David Letscher, Mao Li, Christopher N. Topp, Yajie Yan:
Some Heuristics for the Homological Simplification Problem. 353-359 - Takashi Horiyama, Masahiro Miyasaka, Riku Sasaki:
Isomorphism Elimination by Zero-Suppressed Binary Decision Diagrams. 360-366 - Martin Wilhelm:
On Error Representation in Exact-Decisions Number Types. 367-373
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-07 20:18 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:
