Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID23. CCCG 2011: Toronto, Ontario, Canada
- Proceedings of the 23rd Annual Canadian Conference on Computational Geometry, Toronto, Ontario, Canada, August 10-12, 2011. 2011
Invited speaker 1
- William Steiger:
Geometric Partitioning.
Session 1α
- Canek Peláez, José Miguel Díaz-Báñez, Marco A. Heredia, Joan Antoni Sellarès, Jorge Urrutia, Inmaculada Ventura:
Convex blocking and partial orders on the plane. - Birgit Vogtenhuber, Oswin Aichholzer, Ruy Fabila Monroy, Clemens Huemer, Jorge Urrutia, Marco A. Heredia, Hernán González-Aguilar, Thomas Hackl, Pavel Valtr:
On k-Gons and k-Holes in Point Sets. - David G. Kirkpatrick, Irina Kostitsyna, Valentin Polishchuk:
Hardness Results for Two-Dimensional Curvature-Constrained Motion Planning.
Session 1β
- Boaz Ben-Moshe, Eran Omri, Michael Elkin:
Optimizing Budget Allocation in Graphs. - A. Karim Abu-Affash, Paz Carmi, Matthew J. Katz:
Bottleneck Steiner Tree with Bounded Number of Steiner Vertices. - Mong-Jen Kao, Bastian Katz, Marcus Krug, D. T. Lee, Martin Nöllenburg, Ignaz Rutter, Dorothea Wagner:
Connecting Two Trees with Optimal Routing Cost.
Session 1γ
- David Rappaport, Godfried T. Toussaint, Mustafa Mohamad:
Minimum Many to Many Matchings for Computing the Distance Between Two Sequences. - Anil Maheshwari, Jörg-Rüdiger Sack, Kaveh Shahbaz, Hamid Zarrabi-Zadeh:
Staying Close to a Curve. - Erin W. Chambers, David Letscher, Tao Ju, Lu Liu:
Isotopic Fréchet Distance.
Session 2α
- Takashi Horiyama, Wataru Shoji:
Edge Unfoldings of Platonic Solids Never Overlap. - Joseph O'Rourke, Costin Vîlcu:
Development of Curves on Polyhedra via Conical Existence. - Zachary Abel, Erik D. Demaine, Martin L. Demaine, Hiroaki Matsui, Günter Rote, Ryuhei Uehara:
Common Developments of Several Different Orthogonal Boxes. - Zachary Abel, Erik D. Demaine:
Edge-Unfolding Orthogonal Polyhedra is Strongly NP-Complete. - Zachary Abel, Erik D. Demaine, Martin L. Demaine:
A Topologically Convex Vertex-Ununfoldable Polyhedron.
Session 2β
- Prosenjit Bose, Jean-Lou De Carufel:
Isoperimetric Triangular Enclosure with a Fixed Angle. - Elisha Sacks, Victor Milenkovic, Yujun Wu:
Robust approximate assembly partitioning. - Karim Douïeb, Matthew Eastman, Anil Maheshwari, Michiel H. M. Smid:
Approximation Algorithms for a Triangle Enclosure Problem. - Kai Jin, Kevin Matulef:
Finding the Maximum Area Parallelogram in a Convex Polygon. - Nikolay Dimitrov:
Illumination problems on translation surfaces with planar infinities.
Session 2γ
- Ananda Swarup Das, Prosenjit Gupta, Kannan Srinathan:
Detecting VLSI Layout, Connectivity Errors in a Query Window. - Ananda Swarup Das, Prosenjit Gupta, Kannan Srinathan, Kishore Kothapalli:
Finding Maximum Density Axes Parallel Regions for Weighted Point Sets. - Timothy M. Chan, Bryan T. Wilkinson:
Bichromatic Line Segment Intersection Counting in O(n sqrt(log n)) Time. - Gruia Calinescu, Howard J. Karloff:
Sequential Dependency Computation via Geometric Data Structures. - Jean-Lou De Carufel, Craig Dillabaugh, Anil Maheshwari:
Point Location in Well-Shaped Meshes Using Jump-and-Walk.
Session 3α
- Alexander Rand:
Where and How Chew's Second Delaunay Refinement Algorithm Works. - Esther M. Arkin, Antonio Fernández Anta, Joseph S. B. Mitchell, Miguel A. Mosteiro:
Probabilistic Bounds on the Length of a Longest Edge in Delaunay Graphs of Random Points in d-Dimensions. - Md. Ashraful Alam, Igor Rivin, Ileana Streinu:
Outerplanar graphs and Delaunay triangulations. - Ge Xia, Liang Zhang:
Toward the Tight Bound of the Stretch Factor of Delaunay Triangulations.
Session 3β
- Matthew Berardi, Brent Heeringa, Justin Malestein, Louis Theran:
Rigid components in fixed-lattice and cone frameworks. - Emeric Gioan, Kevin Sol, Gérard Subsol:
Orientations of Simplices Determined by Orderings on the Coordinates of their Vertices. - David Bremner, Antoine Deza, William Hua, Lars Schewe:
Pushing the boundaries of polytopal realizability. - Jürgen Bokowski, Vincent Pilaud:
On the generation of topological (nk)-configurations.
Session 3γ
- Andreas Gemsa, Martin Nöllenburg, Ignaz Rutter:
Sliding labels for dynamic point labeling. - Hakan Yildiz, John Hershberger, Subhash Suri:
A Discrete and Dynamic Version of Klee's Measure Problem. - Chen Gu, Xiaoye Jiang, Leonidas J. Guibas:
Kinetically-aware Conformational Distances in Molecular Dynamics. - Ben D. Lund, George B. Purdy, Justin W. Smith, Csaba D. Tóth:
Collinearities in Kinetic Point Sets.
Session 4α
- Oswin Aichholzer, Greg Aloupis, Erik D. Demaine, Martin L. Demaine, Vida Dujmovic, Ferran Hurtado, Anna Lubiw, Günter Rote, André Schulz, Diane L. Souvaine, Andrew Winslow:
Convexifying Polygons Without Losing Visibilities. - Sarah Eisenstat, Erik D. Demaine:
Expansive Motions for d-Dimensional Open Chains. - Prosenjit Bose, Dana Jansens, André van Renssen, Maria Saumell, Sander Verdonschot:
Making triangulations 4-connected using flips.
Session 4β
- Svetlana Stolpner, Kaleem Siddiqi, Sue Whitesides:
Approximating the Medial Axis by Shooting Rays: 3D Case. - Khuong Vu, Rong Zheng:
An Incremental Algorithm for High Order Maximum Voronoi Diagram Construction. - Stefan Huber, Martin Held:
Approximating a Motorcycle Graph by a Straight Skeleton.
Session 4γ
- Grant Custard, Antoine Deza, Tamon Stephen, Feng Xie:
Small Octahedral Systems. - Carsten Lange:
Combinatorics of Minkowski decomposition of associahedra. - Xiaoye Jiang, Jian Sun, Leonidas J. Guibas:
A Fourier-Theoretic Approach for Inferring Symmetries.
Invited speaker 2
- Noga Alon:
List coloring and Euclidean Ramsey Theory.
Session 5α
- Timothy Sun:
Rigidity-Theoretic Constructions of Integral Fary Embeddings. - Therese Biedl:
Drawing some planar graphs with integer edge-lengths. - Deniz Sariöz:
Approximating the Obstacle Number for a Graph Drawing Efficiently. - Stephane Durocher, Debajyoti Mondal, Rahnuma Islam Nishat, Sue Whitesides:
A Note on Minimum-Segment Drawings of Planar Graphs.
Session 5β
- Gutemberg Guerra-Filho, Pedro J. de Rezende:
Characterization of Shortest Paths on Directional Frictional Polyhedral Surfaces. - Tetsuo Asano, Benjamin Doerr:
Memory-Constrained Algorithms for Shortest Path Problem. - Amit M. Bhosle, Teofilo F. Gonzalez:
Finding Optimal Geodesic Bridges Between Two Simple Polygons. - Christian Scheffer, Jan Vahrenhold:
Approximating Geodesic Distances on 2-Manifolds in R3.
Session 5γ
- Minati De, Anil Maheshwari, Subhas C. Nandy, Michiel H. M. Smid:
An In-Place Priority Search Tree. - Pouya Bisadi, Bradford G. Nickerson:
Orthogonal Range Search using a Distributed Computing Model. - Anil Kishore Kalavagattu, Ananda Swarup Das, Kishore Kothapalli, Kannan Srinathan:
On Finding Skyline Points for Range Queries in Plane. - Minati De, Subhas C. Nandy:
Space-efficient Algorithms for Empty Space Recognition among a Point Set in 2D and 3D.
Session 6α
- Stephane Durocher, Saeed Mehrabi, Debajyoti Mondal, Matthew Skala:
Realizing Site Permutations. - Greg Aloupis, Mirela Damian, Robin Y. Flatland, Matias Korman, Özgür Özkan, David Rappaport, Stefanie Wuhrer:
Establishing Strong Connectivity using Optimal Radius Half-Disk Antennas. - MohammadAmin Fazli, MohammadAli Safari, Nima Anari, Pooya Jalaly Khalilabadi, Mohammad Ghodsi:
Euclidean Movement Minimization. - Abbas Mehrabian:
A Randomly Embedded Random Graph is Not a Spanner.
Session 6β
- Minati De, Gautam K. Das, Subhas C. Nandy:
Approximation Algorithms for the Discrete Piercing Set Problem for Unit Disks. - Chia-Hong Hsu, Chung-Shou Liao:
New Lower Bounds for the Three-dimensional Orthogonal Bin Packing Problem. - André van Renssen, Bettina Speckmann:
The 2x2 Simple Packing Problem. - Yosuke Okayama, Masashi Kiyomi
, Ryuhei Uehara:
On covering of any point configuration by disjoint unit disks.
Session 6γ
- Boaz Ben-Moshe, Elazar Elkin, Harel Levi, Ayal Weissman:
Improving Accuracy of GNSS Devices in Urban Canyons. - Sherif Ghali:
Geometry-Free Polygon Splitting. - Peter Saveliev:
Robustness of topology of digital images and point clouds. - Brandon Rowekamp:
Planar Pixelations, Shape Reconstruction.
Invited speaker 3
- Emo Welzl:
Counting Simple Polygonizations of Planar Point Sets.
Session 7α
- Dan Chen, Pat Morin:
Algorithms for Bivariate Majority Depth. - Elyot Grant, Timothy M. Chan:
Exact Algorithms and APX-Hardness Results for Geometric Set Cover. - Khaled M. Elbassioni, Imran Rauf, Saurabh Ray:
Enumerating Minimal Transversals of Geometric Hypergraphs. - Jean Cardinal, Hiro Ito, Matias Korman, Stefan Langerman:
Helly Numbers of Polyominoes.
Session 7β
- Csaba D. Tóth, Godfried T. Toussaint, Andrew Winslow:
Open Guard Edges and Edge Guards in Simple Polygons. - Salma Sadat Mahdavi, Ali Mohades, Bahram Kouhestani:
Computing k-Link Visibility Polygons in Environments with a Reflective Edge. - Giovanni Viglietta, Nadia M. Benbernou, Erik D. Demaine, Martin L. Demaine, Anastasia Kurdia, Joseph O'Rourke, Godfried T. Toussaint, Jorge Urrutia:
Edge-guarding Orthogonal Polyhedra. - Tobias Christ, Michael Hoffmann:
Wireless Localization within Orthogonal Polyhedra. - Mojtaba Nouri Bygi, Mohammad Ghodsi:
Weak Visibility Queries in Simple Polygons.
Session 7γ
- Jeff Sember, William S. Evans:
The Possible Hull of Imprecise Points. - David L. Millman, Vishal Verma:
A Slow Algorithm for Computing the Gabriel Graph with Double Precision. - Martin Held, Willi Mann:
An Experimental Analysis of Floating-Point Versus Exact Arithmetic. - Marjan Abedin, Ali Mohades, Marzieh Eskandari:
On Inducing n-gons. - Fatemeh Panahi, Ali Mohades, Mansoor Davoodi, Marzieh Eskandari:
Weak Matching Points with Triangles.
a service of 
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-05-02 22:12 CEST 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:
