default search action
26. CCCG 2014: Halifax, Nova Scotia, Canada
- Proceedings of the 26th Canadian Conference on Computational Geometry, CCCG 2014, Halifax, Nova Scotia, Canada, 2014. Carleton University, Ottawa, Canada 2014
Plenary talk
- Tamal K. Dey:
Computational Topology in Reconstruction, Mesh Generation, and Data Analysis.
Session 1A
- Zahed Rahmati
, Mohammad Ali Abam, Valerie King, Sue Whitesides:
Kinetic Data Structures for the Semi-Yao Graph and All Nearest Neighbors in R^d. - Michael J. Bannister, William E. Devanny, Michael T. Goodrich, Joseph A. Simons, Lowell Trott:
Windows into Geometric Events: Data Structures for Time-Windowed Querying of Temporal Point Sets.
Session 1B
- Sang Won Bae, Matias Korman, Yoshio Okamoto:
Computing the Geodesic Centers of a Polygonal Domain. - Binay K. Bhattacharya, Subhas C. Nandy, Sasanka Roy:
Space-Efficient Algorithm for Computing a Centerpoint of a Point Set in R^2.
Session 2A
- Michael Hoffmann, Marc J. van Kreveld, Vincent Kusters, Günter Rote:
Quality Ratios of Measures for Graph Drawing Styles. - Stephane Durocher, Debajyoti Mondal:
Drawing Plane Triangulations with Few Segments, pp. 40-45. - Bernardo M. Ábrego, Oswin Aichholzer, Silvia Fernández-Merchant, Pedro Ramos, Birgit Vogtenhuber:
Non-Shellable Drawings of Kn with Few Crossings.
Session 2B
- Alexander Idelberger, Maciej Liskiewicz:
On the Computational Complexity of Partitioning Weighted Points into a Grid of Quadrilaterals. - Aléx F. Brandt, Miguel M. Gaiowski, Cid C. de Souza, Pedro J. de Rezende:
Minimum Dilation Triangulation: Reaching Optimality Efficiently. - Xiao (Brian) Ma, Michael D. Adams:
An Improved Method for Generating Triangle-Mesh Models of Images.
Session 3A
- Sándor P. Fekete, Stephan Friedrichs, Michael Hemmer, Joseph S. B. Mitchell, Christiane Schmidt
On the Chromatic Art Gallery Problem. - Salma Sadat Mahdavi, Saeed Seddighin, Mohammad Ghodsi:
Covering Orthogonal Polygons with Sliding k-Transmitters. - Matt Gibson, Erik Krohn, Qing Wang:
On the VC-Dimension of Visibility in Monotone Polygons. - Matthew P. Johnson, Deniz Sariöz:
Representing a Planar Straight-Line Graph Using Few Obstacles.
Session 3B
- Luis Barba, Prosenjit Bose, Jean-Lou De Carufel, Mirela Damian, Rolf Fagerberg, André van Renssen, Perouz Taslakian, Sander Verdonschot:
Continuous Yao Graphs. - Gokarna Sharma, Costas Busch:
A Note on Online Steiner Tree Problems. - Ahmad Biniaz, Anil Maheshwari, Michiel H. M. Smid:
Approximating Full Steiner Tree in a Unit Disk Graph. - Jiemin Zeng, Jie Gao:
A Linear Time Euclidean Spanner on Imprecise Points.
Session 4A
- Yong-Jin Liu, Chunxu Xu, Ying He, Deok-Soo Kim:
The Duality of Geodesic Voronoi/Delaunay Diagrams For An Intrinsic Discrete Laplace-Beltrami Operator on Simplicial Surfaces. - Cecilia Bohler, Rolf Klein, Chih-Hung Liu:
Forest-Like Abstract Voronoi Diagrams in Linear Time. - Aritra Banik, Jean-Lou De Carufel, Anil Maheshwari, Michiel H. M. Smid:
Voronoi Games and Epsilon Nets. - Stefan Huber, Oswin Aichholzer, Thomas Hackl, Birgit Vogtenhuber:
Straight Skeletons by Means of Voronoi Diagrams Under Polyhedral Distance Functions.
Session 4B
- Mabel Iglesias Ham, Michael Kerber, Caroline Uhler:
Sphere Packing with Limited Overlap. - Shahin Kamali, Alejandro López-Ortiz:
Almost Online Square Packing. - Hee-Kap Ahn, Sang Won Bae, Otfried Cheong, Dongwoo Park, Chan-Su Shin:
Minimum Convex Container of Two Convex Polytopes under Translations. - Qinxuan Pan:
Uniqueness of Optimal Cube Wrapping.
Plenary talk
- Timothy M. Chan:
Cuttings in 2D Revisited.
Session 5A
- Oswin Aichholzer, Michael Hoffmann, Marc J. van Kreveld, Günter Rote:
Graph Drawings with Relative Edge Length Specifications. - Luis Barba, Frank Duque, Ruy Fabila Monroy, Carlos Hidalgo-Toscano:
Drawing the Horton Set in an Integer Grid of Minimun Size.
Session 5B
- Stephane Durocher, Robert Fraser, Alexandre Leblanc, Jason Morrison, Matthew Skala:
On Combinatorial Depth Measures. - Borislav Karaivanov, Minko Markov, Jack Snoeyink, Tzvetalin S. Vassilev:
Decontaminating Planar Regions by Sweeping with Barrier Curves.
Session 6A
- Stephane Durocher, Hicham El-Zein, J. Ian Munro, Sharma V. Thankachan:
Low Space Data Structures for Geometric Range Mode Query. - Prayaag Venkat, David M. Mount:
A Succinct, Dynamic Data Structure for Proximity Queries on Point Sets. - Binay K. Bhattacharya, Minati De, Subhas C. Nandy, Sasanka Roy:
Maximum Independent Set for Interval Graphs and Trees in Space Efficient Models.
Session 6B
- Oswin Aichholzer, Thomas Hackl, Matias Korman, Marc J. van Kreveld, Maarten Löffler, Alexander Pilz, Bettina Speckmann, Emo Welzl:
Packing Plane Spanning Trees and Paths in Complete Geometric Graphs. - André van Renssen:
On the Spanning Ratio of Constrained Yao-Graphs. - Prosenjit Bose, Simon Pratt, Michiel H. M. Smid:
The Convex Hull of Points on a Sphere is a Spanner.
Session 7A
- Fidel Barrera-Cruz, Therese Biedl, Martin Derka, Stephen Kiazyk, Anna Lubiw, Hamideh Vosoughpour:
Turning Orthogonally Convex Polyhedra into Orthoballs. - Zachary Abel, Erik D. Demaine, Martin L. Demaine, Hiro Ito, Jack Snoeyink, Ryuhei Uehara:
Bumpy Pyramid Folding.
Session 7B
- Oswin Aichholzer, Ruy Fabila Monroy, Ferran Hurtado, Pablo Pérez-Lantero, Andres J. Ruiz-Vargas, Jorge Urrutia, Birgit Vogtenhuber:
Order types and cross-sections of line arrangements in R^3. - Tamal K. Dey, Fengtao Fan, Yusu Wang:
Dimension Detection with Local Homology.
Plenary talk
- Jack Snoeyink:
Time, Space, and Precision: Revisiting Classic Problems in Computational Geometry with Degree-Driven Analysis, pp. 280.
Session 8A
- Stuart A. Macgillivray, Bradford G. Nickerson:
Window Queries On Planar Subdivisions Arising From Overlapping Polygons. - Sankalp Khare, Jatin Agarwal, Nadeem Moidu, Kannan Srinathan:
Improved Bounds for Smallest Enclosing Disk Range Queries.
Session 8B
- Aniket Basu Roy, Sathish Govindarajan, Neeldhara Misra, Shreyas Shetty:
On the d-Runaway Rectangle Escape Problem. - AmirMahdi Ahmadinejad, Hamid Zarrabi-Zadeh:
The Maximum Disjoint Set of Boundary Rectangles.
Session 9A
- Adrian Dumitrescu, Csaba D. Tóth:
Covering Grids by Trees. - Apurva Mudgal, Supantha Pandit:
Geometric Hitting Set and Set Cover Problem with Half-Strips.
Session 9B
- Haitao Wang, Wuzhou Zhang:
The τ-Skyline for Uncertain Data. - Joshua Vander Hook, Volkan Isler:
Pursuit and Evasion with Uncertain Bearing Measurements.
Session 10A
- Giuseppe Antonio Di Luna, Paola Flocchini, Federico Poloni, Nicola Santoro, Giovanni Viglietta:
The Mutual Visibility Problem for Oblivious Robots. - Anna Lubiw, Jack Snoeyink, Hamideh Vosoughpour:
Visibility Graphs, Dismantlability, and the Cops and Robbers Game. - Stephan Friedrichs, Michael Hemmer, Christiane Schmidt
A PTAS for the Continuous 1.5D Terrain Guarding Problem. - Bahram Kouhestani, David Rappaport, Kai Salomaa:
Routing in a Polygonal Terrain with the Shortest Beacon Watchtower.
Session 10B
- Nabil H. Mustafa, Rajiv Raman:
A Separator Theorem for Intersecting Objects in the Plane. - Eli Fox-Epstein, Ryuhei Uehara:
The Convex Configurations of "Sei Shonagon Chie no Ita" and Other Dissection Puzzles. - Prosenjit Bose, John Howat, Pat Morin:
Searching by Panning and Zooming. - Boris Aronov, Mark V. Yagnatinsky:
Quickly Placing a Point to Maximize Angles.
Session 11A
- Ruy Fabila Monroy, Alfredo García Olaverri, Ferran Hurtado, Rafel Jaume, Pablo Pérez-Lantero, Maria Saumell, Rodrigo I. Silveira, Javier Tejel, Jorge Urrutia:
Colored Ray Configurations. - Michael Biro:
Planar Graphs with Many Perfect Matchings and Forests. - Stefan Schirra:
On the Use of Adaptive, Exact Decisions Number Types Based on Expression-Dags in Geometric Computing. - Meera Sitharam, Mohamad Tarifi, Menghan Wang:
An Incidence Geometry Approach to Dictionary Learning.
Session 11B
- Ahmad Biniaz, Anil Maheshwari, Michiel H. M. Smid:
Bottleneck Bichromatic Plane Matching of Points. - Ghobad Emadi, Alireza Zarei:
All Approximating Segments for a Sequence of Points. - Paul Accisano, Alper Üngör:
Approximate Matching of Curves to Point Sets.
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-15 19:20 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: