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