default search action
25. CCCG 2013: Waterloo, Ontario, Canada
- Proceedings of the 25th Canadian Conference on Computational Geometry, CCCG 2013, Waterloo, Ontario, Canada, August 8-10, 2013. Carleton University, Ottawa, Canada 2013
Plenary talk
- Sue Whitesides:
Kinetic Data Structures on The Move.
Session 1A
- Therese Biedl, Martin Held, Stefan Huber, Dominik Kaaser, Peter Palfrader:
Weighted Straight Skeletons In The Plane. - Erin W. Chambers, Tao Ju, David Letscher:
Medial Residues of Piecewise Linear Manifolds.
Session 1B
- Akitoshi Kawamura, Takuma Okamoto, Yuichi Tatsu, Yushi Uno, Masahide Yamato:
Morpion Solitaire 5D: a new upper bound 121 on the maximum score. - Erik D. Demaine, Yoshio Okamoto, Ryuhei Uehara, Yushi Uno:
Computational complexity and an integer programming model of Shakashaka.
Session 2A
- Aritra Banik, Bhaswar B. Bhattacharya, Sandip Das, Satyaki Mukherjee:
One-Round Discrete Voronoi Game in ℝ2 in Presence of Existing Facilities. - Erik D. Demaine, Martin L. Demaine, Ryuhei Uehara:
Zipper Unfoldability of Domes and Prismoids. - Rahnuma Islam Nishat, Sue Whitesides:
Map Folding.
Session 2B
- Giovanni Viglietta:
Partial Searchlight Scheduling is Strongly PSPACE-complete. - David Eppstein, Michael T. Goodrich, Joseph A. Simons:
Set-Difference Range Queries. - David P. Wagner:
The Unified Segment Tree and its Application to the Rectangle Intersection Problem.
Session 3A
- Oswin Aichholzer, Greg Aloupis, Erik D. Demaine, Martin L. Demaine, Sándor P. Fekete, Michael Hoffmann, Anna Lubiw, Jack Snoeyink, Andrew Winslow:
Covering Folded Shapes. - Joseph O'Rourke:
Unfolding Face-Neighborhood Convex Patches: Counterexamples and Positive Results. - Victor Alvarez, Karl Bringmann, Saurabh Ray, Raimund Seidel:
Counting Triangulations Approximately.
Session 3B
- Haitao Wang:
Aggregate-Max Nearest Neighbor Searching in the Plane. - Blagoy Genov:
Data structures for incremental extreme ray enumeration algorithms. - Nirman Kumar, Benjamin Raichel:
Fault Tolerant Clustering Revisited.
Open Problems Session
- Joseph S. B. Mitchell:
Open Problems from CCCG 2012.
Plenary talk
- Alla Shaffer:
Quantifying Design: the geometric properties behind designer choices and human perception.
Session 4A
- Patrizio Angelini, David Eppstein, Fabrizio Frati, Michael Kaufmann, Sylvain Lazard, Tamara Mchedlidze, Monique Teillaud, Alexander Wolff:
Universal Point Sets for Planar Graph Drawings with Circular Arcs. - Amin Gheibi, Anil Maheshwari, Jörg-Rüdiger Sack:
Weighted Region Problem in Arrangement of Lines.
Session 4B
- Michael Biro, Jie Gao, Justin Iwerks, Irina Kostitsyna, Joseph S. B. Mitchell:
Combinatorics of Beacon Routing and Coverage. - Victor Alvarez, Erin W. Chambers, László Kozma
:
Privacy by Fake Data: A Geometric Approach.
Session 5A
- Steven Chaplick, Elad Cohen, Gila Morgenstern:
Stabbing Polygonal Chains with Rays is Hard to Approximate. - Travis Gagie, Pawel Gawrychowski, Yakov Nekrich:
Heaviest Induced Ancestors and Longest Common Substrings. - Jérémy Barbay, Timothy M. Chan, Gonzalo Navarro, Pablo Pérez-Lantero:
Maximum-Weight Planar Boxes in O(n2) Time (and Better).
Session 5B
- Mikkel Abrahamsen:
An Optimal Algorithm Computing Edge-to-Edge Visibility in a Simple Polygon. - Maarten Löffler, André Schulz, Csaba D. Tóth:
Counting Carambolas. - Oswin Aichholzer, Jean Cardinal, Thomas Hackl, Ferran Hurtado, Matias Korman, Alexander Pilz, Rodrigo I. Silveira, Ryuhei Uehara, Birgit Vogtenhuber, Emo Welzl:
Cell-Paths in Mono- and Bichromatic Line Arrangements in the Plane.
Session 6A
- Prosenjit Bose, Jean-Lou De Carufel, Carsten Grimm, Anil Maheshwari, Michiel H. M. Smid:
Optimal Data Structures for Farthest-Point Queries in Cactus Networks. - Michael T. Goodrich, Pawel Pszona:
Cole's Parametric Search Technique Made Practical. - Yusuke Yokosuka, Keiko Imai:
Polynomial Time Algorithms for Label Size Maximization on Rotating Maps. - Nadeem Moidu, Jatin Agarwal, Kishore Kothapalli:
Planar Convex Hull Range Query and Related Problems.
Session 6B
- Christopher Clement, Audrey Lee-St. John, Jessica Sidman:
Hyperbanana Graphs. - Oswin Aichholzer, Sang Won Bae, Luis Barba, Prosenjit Bose, Matias Korman, André van Renssen, Perouz Taslakian, Sander Verdonschot:
Theta-3 is connected. - Boris Aronov, John Iacono, Özgür Özkan, Mark V. Yagnatinsky:
How to Cover Most of a Point Set with a V-Shape of Minimum Width. - Luis Barba, Alexis Beingessner, Prosenjit Bose, Michiel H. M. Smid:
Computing Covers of Plane Forests.
Session 7A
- Bruno E. Crepaldi, Pedro J. de Rezende, Cid C. de Souza:
An Efficient Exact Algorithm for the Natural Wireless Localization Problem. - Luis Barba, Stephane Durocher, Robert Fraser, Ferran Hurtado, Saeed Mehrabi, Debajyoti Mondal, Jason Morrison, Matthew Skala, Mohammad Abdul Wahid:
On k-Enclosing Objects in a Coloured Point Set. - Sepehr Assadi, Ehsan Emamjomeh-Zadeh, Sadra Yazdanbod, Hamid Zarrabi-Zadeh:
On the Rectangle Escape Problem. - River Allen, Laurie J. Heyer, Rahnuma Islam Nishat, Sue Whitesides:
Grid Proximity Graphs: LOGs, GIGs and GIRLs.
Session 7B
- Fatemeh Panahi, A. Frank van der Stappen:
Bounding the Locus of the Center of Mass for a Part with Shape Variation. - Donald R. Sheehy:
Geometric Separators and the Parabolic Lift. - Boris Aronov, Mark V. Yagnatinsky:
How To Place a Point to Maximize Angles. - Payam Khanteimouri, Ali Mohades, Mohammad Ali Abam, Mohammad Reza Kazemi:
Spanning Colored Points with Intervals.
Session 8A
- Ke Chen, Adrian Dumitrescu, Anirban Ghosh:
On Fence Patrolling by Mobile Agents. - Giovanni Viglietta:
Face-Guarding Polyhedra. - Daniel Busto, William S. Evans, David G. Kirkpatrick:
On k-Guarding Polygons. - Timothy M. Chan, Nan Hu:
Geometric Red-Blue Set Cover for Unit Squares and Related Problems.
Session 8B
- Michael Hoffmann, Vincent Kusters, Günter Rote, Maria Saumell, Rodrigo I. Silveira:
Convex hull alignment through translation. - Gruia Calinescu:
Faster approximation for Symmetric Min-Power Broadcast. - Timothy Sun:
Drawing some 4-regular planar graphs with integer edge lengths.
Plenary talk
- Peter Widmeyer:
What's in a gaze? How to reconstruct a simple polygon from local snapshots.
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-15 01:33 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: