Google
Google Scholar
MS Academic
CiteSeerX
CORE
Semantic Scholar28. CCCG 2016: Vancouver, British Columbia, Canada
- Thomas C. Shermer:
Proceedings of the 28th Canadian Conference on Computational Geometry, CCCG 2016, August 3-5, 2016, Simon Fraser University, Vancouver, British Columbia, Canada. Simon Fraser University, Vancouver, British Columbia, Canada 2016
Session 1A
- Marcello Mamino, Giovanni Viglietta:
Square Formation by Asynchronous Oblivious Robots. CCCG 2016: 1-6 - Vincent Froese, Iyad A. Kanj, André Nichterlein, Rolf Niedermeier:
Finding Points in General Position. CCCG 2016: 7-14 - Mehrdad Ghadiri, Sina Yazdanbod:
Minimizing the Total Movement for Movement to Independence Problem on a Line. CCCG 2016: 15-20 - Konstantinos Georgiou, Evangelos Kranakis, Alexandra Steau:
Searching with Advice: Robot Fence-Jumping. CCCG 2016: 21-28
Session 1B
- David Letscher, Kyle Sykes:
On the Stability of Medial Axis of a Union of Balls in the Plane. CCCG 2016: 29-33 - Kirk P. Gardner, Donald R. Sheehy:
kth Nearest Neighbor Sampling in the Plane. CCCG 2016: 34-41 - David Hedin, W. Randolph Franklin:
NearptD: A Parallel Implementation of Exact Nearest Neighbor Search using a Uniform Grid. CCCG 2016: 42-47 - Therese C. Biedl, Carsten Grimm, Leonidas Palios, Jonathan Richard Shewchuk, Sander Verdonschot:
Realizing Farthest-Point Voronoi Diagrams. CCCG 2016: 48-56
Session 2
- Martin Derka, Alejandro López-Ortiz, Daniela Maftuleac:
Recognition of Triangulation Duals of Simple Polygons With and Without Holes. CCCG 2016: 57-62 - Therese C. Biedl, Saeed Mehrabi, Ziting Yu:
Sliding k-Transmitters: Hardness and Approximation. CCCG 2016: 63-68 - Bahram Kouhestani, David Rappaport, Kai Salomaa:
The Length of the Beacon Attraction Trajectory. CCCG 2016: 69-74 - Azadeh Tabatabaei, Fardin Shapouri, Mohammad Ghodsi:
A Competitive Strategy for Walking in Generalized Streets for a Simple Robot. CCCG 2016: 75-79
Session 3A
- Farshad Barahimi, Steve Wismath:
Polynomial volume point set embedding of graphs in 3D. CCCG 2016: 80-85 - Martin Fink, Subhash Suri:
Boundary Labeling with Obstacles. CCCG 2016: 86-92 - Stephane Durocher, Ellen Gethner, Debajyoti Mondal:
On the Biplanar Crossing Number of Kn. CCCG 2016: 93-100 - Matej Konecný, Stanislav Kucera, Michal Opler, Jakub Sosnovec, Stepán Simsa, Martin Töpfer:
Squarability of rectangle arrangements. CCCG 2016: 101-106
Session 3B
- Mahmoodreza Jahanseir, Don Sheehy:
Transforming Hierarchical Trees on Metric Spaces. CCCG 2016: 107-113 - Vahideh Keikha, Ali Mohades, Mansoor Davoodi Monfared:
On the Triangulation of non-fat Imprecise Points. CCCG 2016: 114-121 - Michael Deakin, Jack Snoeyink:
On the Precision to Sort Line-Quadric Intersections. CCCG 2016: 122-127 - Nicholas J. Cavanna, Donald R. Sheehy:
Adaptive Metrics for Adaptive Samples. CCCG 2016: 128-132
Session 4A
- Davood Bakhshesh, Mohammad Farshi:
Geometric Spanners Merging and its Applications. CCCG 2016: 133-139 - Ahmad Biniaz, Prosenjit Bose, Ingo van Duijn, Anil Maheshwari, Michiel H. M. Smid:
A Faster Algorithm for the Minimum Red-Blue-Purple Spanning Graph Problem for Points on a Circle. CCCG 2016: 140-146 - Ajit Arvind Diwan, Bodhayan Roy:
Partitions of planar point sets into polygons. CCCG 2016: 147-154 - Martin Fink, Neeraj Kumar, Subhash Suri:
Counting Convex k-gons in an Arrangement of Line Segments. CCCG 2016: 155-160
Session 4B
- Yangdi Lyu, Alper Üngör:
A Fast 2-Approximation Algorithm for Guarding Orthogonal Terrains. CCCG 2016: 161-167 - Eyüp Serdar Ayaz, Alper Üngör:
An Iterative Refinement Scheme of Dominating Guards and Witnesses for Art Gallery Problems. CCCG 2016: 168-174 - Israel Aldana-Galván, Jose Luis Álvarez-Rebollar, Juan Carlos Catana-Salazar, Mazay Jimenez-Salinas, Erick Solis-Villarreal, Jorge Urrutia:
Minimizing the Solid Angle Sum of Orthogonal Polyhedra and Guarding them with π/2-Edge Guards. CCCG 2016: 175-181 - Udo Hoffmann:
The Planar Slope Number. CCCG 2016: 182-186
Session 5A
- Tuong Nguyen, Isabelle Sivignon:
Epsilon-covering: a greedy optimal algorithm for simple shapes. CCCG 2016: 187-194 - Saeed Mehrabi:
Geometric Unique Set Cover on Unit Disks and Unit Squares. CCCG 2016: 195-200 - Raghunath Reddy Madireddy, Apurva Mudgal:
Stabbing Line Segments with Disks and Related Problems. CCCG 2016: 201-207 - Ingo van Duijn, Irina Kostitsyna, Marc J. van Kreveld, Maarten Löffler:
Critical Placements of a Square or Circle amidst Trajectories for Junction Detection. CCCG 2016: 208-215
Session 5B
- Jillian Dicker, Joseph G. Peters:
Smallest Paths with Restricted Orientations in Simple Polygons. CCCG 2016: 216-222 - Maurício J. O. Zambon, Pedro J. de Rezende, Cid C. de Souza:
Exact Solutions for the Geometric Firefighter Problem. CCCG 2016: 223-229 - Ashwin Gopinath, David G. Kirkpatrick, Paul W. K. Rothemund, Chris Thachuk:
Progressive Alignment of Shapes. CCCG 2016: 230-236 - Therese C. Biedl, Anna Lubiw, Saeed Mehrabi, Sander Verdonschot:
Rectangle-of-influence triangulations. CCCG 2016: 237-243
Session 6A
- Bogdan Armaselu, Ovidiu Daescu:
Maximum Area Rectangle Separating Red and Blue Points. CCCG 2016: 244-251 - David G. Kirkpatrick, Paul Liu:
Characterizing minimum-length coordinated motions for two discs. CCCG 2016: 252-259 - David Eppstein:
Maximizing the Sum of Radii of Disjoint Balls or Disks. CCCG 2016: 260-265
Session 6B
- Daniel Berend, Shira Zucker:
On the Number of Forceless Hint Sequences in Paint-by-Numbers Puzzles. CCCG 2016: 266-269 - Henryk Michalewski, Andrzej Nagórko, Jakub Pawlewicz:
An upper bound of 84 for Morpion Solitaire 5D. CCCG 2016: 270-278 - Akanksha Agrawal, Sudeshna Kolay, Saket Saurabh, Roohani Sharma:
Kernelizing Buttons and Scissors. CCCG 2016: 279-286
Session 7A
- Ioana Oriana Bercea, Volkan Isler, Samir Khuller:
Minimizing Uncertainty through Sensor Placement with Angle Constraints. CCCG 2016: 287-294 - Prosenjit Bose, Vida Dujmovic, Pat Morin, Lucas Rioux-Maldague:
New Bounds for Facial Nonrepetitive Colouring. CCCG 2016: 295-302
Session 7A
- Jammigumpula Ajaykumar, Avinandan Das, Navaneeta Saikia, Arindam Karmakar:
Problems on One Way Road Networks. CCCG 2016: 303-308 - Jack Snoeyink:
Creating a robust implementation for segment intersection by refinement: A multistage assignment that defines away degeneracies. CCCG 2016: 309-314
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 2020-07-09 22:35 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
the dblp computer science bibliography is funded by:
