20. CCCG 2008:
Montreal, Canada
Proceedings of the 20th Annual Canadian Conference on Computational Geometry, Montréal, Canada, August 13-15, 2008.
2008 
- Ravi Janardan, Prosenjit Gupta, Yokesh Kumar, Michiel H. M. Smid:
Data Structures for Range-Aggregate Extent Queries.
- Marek Karpinski, Yakov Nekrich:
Searching for Frequent Colors in Rectangles.
- Mashhood Ishaque, Diane L. Souvaine, Nadia Benbernou:
Data Structures for Restricted Triangular Range Searching.
- Gerhard Guettler, Colin L. Mallows:
A generalization of Apollonian packing of circles.
- Svetlana Stolpner, Jonathan Lenchner, Giuseppe Liotta, David Bremner, Christophe Paul, Marc Pouget, Stephen K. Wismath:
A note on alpha-drawable k-trees.
- James King:
VC-Dimension of Visibility on Terrains.
- Ryuhei Uehara:
Polygons Folding to Plural Incongruent Orthogonal Boxes.
- Alex Benton, Joseph O'Rourke:
A Class of Convex Polyhedra with Few Edge Unfoldings.
- Youichi Fujimoto, Mitsuo Motoki, Ryuhei Uehara:
Inverting Linkages with Stretch.
- Deepanjan Kesh, Shashank K. Mehta:
Polynomial irreducibility testing through Minkowski summand computation.
- Jérémy Barbay, Eric Y. Chen:
Convex Hull of the Union of Convex Objects in the Plane: an Adaptive Analysis.
- Mojtaba Nouri Bygi, Mohammad Ghodsi:
Polar Diagram of Moving Objects.
- Prosenjit Bose, Joseph O'Rourke, Chang Shu, Stefanie Wuhrer:
Isometric Morphing of Triangular Meshes.
- Christian Wulff-Nilsen:
Computing the Stretch Factor of Paths, Trees, and Cycles in Weighted Fixed Orientation Metrics.
- Manjish Pal:
The Focus of Attention Problem Revisited.
- Adrian Dumitrescu:
On distinct distances among points in general position and other related problems.
- Adrian Dumitrescu, Minghui Jiang:
Monochromatic simplices of any volume.
- Oswin Aichholzer, Ruy Fabila Monroy, David Flores-Peñaloza, Thomas Hackl, Clemens Huemer, Jorge Urrutia:
Empty Monochromatic Triangles.
- Greg Aloupis, Jean Cardinal, Sébastien Collette, Ferran Hurtado, Stefan Langerman, Joseph O'Rourke:
Draining a Polygon - or - Rolling a Ball out of a Polygon.
- Eric McCreath:
Partial Matching of Planar Polygons Under Translation and Rotation.
- Subhas C. Nandy, Krishnendu Mukhopadhyaya, Bhargab B. Bhattacharya:
Recognition of Largest Empty Orthoconvex Polygon in a Point Set.
- Natasa Jovanovic, Jan H. M. Korst, Augustus J. E. M. Janssen:
Minimum blocking sets of circles for a set of lines in the plane.
- Mohammad Ali Abam, Mark de Berg, Sheung-Hung Poon:
Fault-Tolerant Conflict-Free Coloring.
- Joseph O'Rourke, Perouz Taslakian, Godfried T. Toussaint:
A Pumping Lemma for Homometric Rhythms.
- Priya Ranjan Sinha Mahapatra, Partha P. Goswami, Sandip Das:
Maximal Covering by Two Isothetic Unit Squares.
- Greg Aloupis, Prosenjit Bose, Vida Dujmovic, Chris Gray, Stefan Langerman, Bettina Speckmann:
Triangulating and Guarding Realistic Polygons.
- Marcus Schaefer, Eric Sedgwick, Daniel Stefankovic:
Computing Dehn Twists and Geometric Intersection Numbers in Polynomial Time.
- Benoît Hudson, Duru Türkoglu:
An Efficient Query Structure for Mesh Refinement.
- Qiaosheng Shi, Binay K. Bhattacharya:
Application of computational geometry to network p-center location problems.
- Jihui Zhao, William Steiger:
Generalized Ham-Sandwich Cuts for Well Separated Point Sets.
- Selim G. Akl, Kamrul Islam, Henk Meijer:
Direct Planar Tree Transformation and Counterexample.
- Dania El-Khechen, John Iacono, Thomas Fevens, Günter Rote:
Partitioning a Polygon into Two Mirror Congruent Pieces.
- Esther M. Arkin, George Hart, Joondong Kim, Irina Kostitsyna, Joseph S. B. Mitchell, Girishkumar Sabhnani, Steven Skiena:
The Embroidery Problem.
- Erik D. Demaine, Martin L. Demaine, Vi Hart:
Computational Balloon Twisting: The Theory of Balloon Polyhedra.
- Henk Meijer, Yurai Núñez Rodríguez, David Rappaport:
On the Complexity of Point Recolouring in Geometric Graphs.
- A. Karim Abu-Affash, Matthew J. Katz:
Improved Bounds on the Average Distance to the Fermat-Weber Center of a Convex Object.
- Mohammad Moharrami, Avner Magen:
On the nonexistence of dimension reduction for $\ell2_2$ metrics.
- Mina Razaghpour, Anna Lubiw:
The Steiner Ratio for Obstacle-Avoiding Rectilinear Steiner Trees.
- Hamid Zarrabi-Zadeh:
Core-Preserving Algorithms.
- Jonathan Derryberry, Don Sheehy, Maverick Woo, Danny Dominic Sleator:
Achieving Spatial Adaptivity while Finding Approximate Nearest Neighbors.
- Prosenjit Bose, Stefan Langerman, Sasanka Roy:
Smallest enclosing circle centered on a query line segment.
- Khaled M. Elbassioni, Hans Raj Tiwary:
On a Cone Covering Problem.
- Don Sheehy, Gary L. Miller, Todd Phillips:
Linear-Size Meshes.
- Hamid Reza Chitsaz, Steven M. LaValle, Jason M. O'Kane:
Exact Pareto-Optimal Coordination of Two Translating Polygonal Robots on a Cyclic Roadmap.
- Ovidiu Daescu, Anastasia Kurdia:
Polygonal Chain Simplification with Small Angle Constraints.
- Maia Fraser, Evangelos Kranakis, Jorge Urrutia:
Memory Requirements for Local Geometric Routing and Traversal in Digraphs.
- Yurai Núñez Rodríguez, Henry Xiao, Kamrul Islam, Waleed Alsalih:
A Distributed Algorithm for Computing Voronoi Diagram in the Unit Disk Graph Model.
- Stefan Näher, Daniel Schmitt:
A Framework for Multi-Core Implementations of Divide and Conquer Algorithms and its Application to the Convex Hull Problem.
- Jeff Sember, William S. Evans:
Guaranteed Voronoi Diagrams of Uncertain Sites.
- Joachim Giesen, Madhusudan Manjunath, Michael Eigensatz:
The Solution Path of the Slab Support Vector Machine.
- Reza Dorrigiv, Alejandro López-Ortiz:
Adaptive Searching in One and Two Dimensions.
- Peter Damaschke:
Competitive Search for Longest Empty Intervals.
Last update Mon May 20 09:53:20 2013
CET by the DBLP Team — 
Data released under the ODC-BY 1.0 license — See also our legal information page
