- 2017
- Mohammad Ali Abam, Sharareh Alipour, Mohammad Ghodsi, Mohammad Mahdian:
Visibility Testing and Counting for Uncertain Segments. CCCG 2017: 84-88 - Ahmed Abdelkader, Chandrajit L. Bajaj, Mohamed S. Ebeida, Scott A. Mitchell:
A Seed Placement Strategy for Conforming Voronoi Meshing. CCCG 2017: 95-100 - A. Karim Abu-Affash, Sujoy Bhore, Paz Carmi:
Monochromatic Plane Matchings in Bicolored Point Set. CCCG 2017: 7-12 - A. Karim Abu-Affash, Sujoy Bhore, Paz Carmi, Dibyayan Chakraborty:
Bottleneck Bichromatic Full Steiner Trees. CCCG 2017: 13-18 - Ankush Acharyya, Minati De, Subhas C. Nandy:
Range Assignment of Base-Stations Maximizing Coverage Area without Interference. CCCG 2017: 126-131 - Akash Agrawal, Yuan Li, Jie Xue, Ravi Janardan:
The Most-Likely Skyline Problem for Stochastic Points. CCCG 2017: 78-83 - AmirMahdi Ahmadinejad, Fatemeh Baharifard, Khadijeh Sheikhan, Hamid Zarrabi-Zadeh:
Optimal Orientation of Symmetric Directional Antennas on a Line. CCCG 2017: 120-125 - Israel Aldana-Galván, Jose Luis Álvarez-Rebollar, Juan C. Catana-Salazar, Erick Solis-Villarreal, Jorge Urrutia, Carlos Velarde:
Planarity Preserving Augmentation of Topological and Geometric Plane Graphs to Meet Parity Constraints. CCCG 2017: 107-112 - Israel Aldana-Galván, Jose Luis Álvarez-Rebollar, Juan C. Catana-Salazar, Nestaly Marín-Nevárez, Erick Solís-Villarreal, Jorge Urrutia, Carlos Velarde:
Beacon Coverage in Orthogonal Polyhedra. CCCG 2017: 156-161 - Byoungkwon An, Erik D. Demaine, Martin L. Demaine, Jason S. Ku:
Computing 3SAT on a Fold-and-Cut Machine. CCCG 2017: 208-213 - Boris Aronov, John Iacono, Khadijeh Sheikhan:
Nearest-Neighbor Search Under Uncertainty. CCCG 2017: 89-94 - Yeganeh Bahoo, Stephane Durocher, Sahar Mehrpour, Debajyoti Mondal:
Exploring Increasing-Chord Paths and Trees. CCCG 2017: 19-24 - Luis Barba, Patrick Schnider:
Sharing a Pizza: Bisecting Masses with Two Cuts. CCCG 2017: 174-178 - Mark de Berg, Ali D. Mehrabi, Tim Ophelders:
Data Structures for Fréchet Queries in Trajectory Data. CCCG 2017: 214-219 - Binay Bhattacharya, Lily Li:
Minimum Enclosing Circle Problem with Base Point. CCCG 2017: 50-55 - Therese Biedl:
Upward Order-Preserving 8-Grid-Drawings of Binary Trees. CCCG 2017: 232-237 - Therese Biedl, Ahmad Biniaz, Anil Maheshwari, Saeed Mehrabi:
Packing Boundary-Anchored Rectangles. CCCG 2017: 138-143 - Therese Biedl, Saeed Mehrabi:
On Guarding Orthogonal Polygons with Bounded Treewidth. CCCG 2017: 150-155 - Amartya Shankha Biswas, Erik D. Demaine:
Common Development of Prisms, Anti-Prisms, Tetrahedra, and Wedges. CCCG 2017: 202-207 - Prosenjit Bose, Claire Pennarun, Sander Verdonschot:
Power Domination on Triangular Grids. CCCG 2017: 2-6 - David Bremner, Rasoul Shahsavarifar:
On the Planar Spherical Depth and Lens Depth. CCCG 2017: 43-49 - Nicholas J. Cavanna, Marc Khoury, Donald R. Sheehy:
Supporting Ruled Polygons. CCCG 2017: 191-196 - Erin Wolf Chambers:
Burning the Medial Axis. CCCG 2017: 77 - Ovidiu Daescu, Ka Yaw Teo:
2D Closest Pair Problem: A Closer Look. CCCG 2017: 185-190 - Erik D. Demaine, Matias Korman, André van Renssen, Marcel Roeloffzen:
Snipperclips: Cutting Tools into Desired Polygons using Themselves. CCCG 2017: 56-61 - Hu Ding:
Balanced k-Center Clustering When k Is A Constant. CCCG 2017: 179-184 - Adrian Dumitrescu:
On the Shortest Separating Cycle. CCCG 2017: 68-72 - Adrian Dumitrescu, Csaba D. Tóth:
A Problem on Track Runners. CCCG 2017: 198-201 - Stephane Durocher, Sahar Mehrpour:
Interference Minimization in k-Connected Wireless Networks. CCCG 2017: 113-119 - David Eppstein:
Forbidden Configurations in Discrete Geometry. CCCG 2017: 1