The SCEAS System
Navigation Menu

Conferences in DBLP

Canadian Conference on Computational Geometry (cccg)
2008 (conf/cccg/2008)


  1. Polynomial irreducibility testing through Minkowski summand computation. [Citation Graph (, )][DBLP]


  2. Empty Monochromatic Triangles. [Citation Graph (, )][DBLP]


  3. Guaranteed Voronoi Diagrams of Uncertain Sites. [Citation Graph (, )][DBLP]


  4. Draining a Polygon - or - Rolling a Ball out of a Polygon. [Citation Graph (, )][DBLP]


  5. Competitive Search for Longest Empty Intervals. [Citation Graph (, )][DBLP]


  6. Data Structures for Range-Aggregate Extent Queries. [Citation Graph (, )][DBLP]


  7. Maximal Covering by Two Isothetic Unit Squares. [Citation Graph (, )][DBLP]


  8. Triangulating and Guarding Realistic Polygons. [Citation Graph (, )][DBLP]


  9. Polygons Folding to Plural Incongruent Orthogonal Boxes. [Citation Graph (, )][DBLP]


  10. Searching for Frequent Colors in Rectangles. [Citation Graph (, )][DBLP]


  11. A Distributed Algorithm for Computing Voronoi Diagram in the Unit Disk Graph Model. [Citation Graph (, )][DBLP]


  12. Partitioning a Polygon into Two Mirror Congruent Pieces. [Citation Graph (, )][DBLP]


  13. On distinct distances among points in general position and other related problems. [Citation Graph (, )][DBLP]


  14. On a Cone Covering Problem. [Citation Graph (, )][DBLP]


  15. Improved Bounds on the Average Distance to the Fermat-Weber Center of a Convex Object. [Citation Graph (, )][DBLP]


  16. Minimum blocking sets of circles for a set of lines in the plane. [Citation Graph (, )][DBLP]


  17. Linear-Size Meshes. [Citation Graph (, )][DBLP]


  18. Exact Pareto-Optimal Coordination of Two Translating Polygonal Robots on a Cyclic Roadmap. [Citation Graph (, )][DBLP]


  19. A Framework for Multi-Core Implementations of Divide and Conquer Algorithms and its Application to the Convex Hull Problem. [Citation Graph (, )][DBLP]


  20. Generalized Ham-Sandwich Cuts for Well Separated Point Sets. [Citation Graph (, )][DBLP]


  21. A Class of Convex Polyhedra with Few Edge Unfoldings. [Citation Graph (, )][DBLP]


  22. Application of computational geometry to network p-center location problems. [Citation Graph (, )][DBLP]


  23. Recognition of Largest Empty Orthoconvex Polygon in a Point Set. [Citation Graph (, )][DBLP]


  24. Smallest enclosing circle centered on a query line segment. [Citation Graph (, )][DBLP]


  25. Direct Planar Tree Transformation and Counterexample. [Citation Graph (, )][DBLP]


  26. Polygonal Chain Simplification with Small Angle Constraints. [Citation Graph (, )][DBLP]


  27. Achieving Spatial Adaptivity while Finding Approximate Nearest Neighbors. [Citation Graph (, )][DBLP]


  28. Inverting Linkages with Stretch. [Citation Graph (, )][DBLP]


  29. VC-Dimension of Visibility on Terrains. [Citation Graph (, )][DBLP]


  30. Convex Hull of the Union of Convex Objects in the Plane: an Adaptive Analysis. [Citation Graph (, )][DBLP]


  31. A Pumping Lemma for Homometric Rhythms. [Citation Graph (, )][DBLP]


  32. Computational Balloon Twisting: The Theory of Balloon Polyhedra. [Citation Graph (, )][DBLP]


  33. Data Structures for Restricted Triangular Range Searching. [Citation Graph (, )][DBLP]


  34. A generalization of Apollonian packing of circles. [Citation Graph (, )][DBLP]


  35. The Embroidery Problem. [Citation Graph (, )][DBLP]


  36. The Focus of Attention Problem Revisited. [Citation Graph (, )][DBLP]


  37. Fault-Tolerant Conflict-Free Coloring. [Citation Graph (, )][DBLP]


  38. The Steiner Ratio for Obstacle-Avoiding Rectilinear Steiner Trees. [Citation Graph (, )][DBLP]


  39. A note on alpha-drawable k-trees. [Citation Graph (, )][DBLP]


  40. On the Complexity of Point Recolouring in Geometric Graphs. [Citation Graph (, )][DBLP]


  41. Isometric Morphing of Triangular Meshes. [Citation Graph (, )][DBLP]


  42. Memory Requirements for Local Geometric Routing and Traversal in Digraphs. [Citation Graph (, )][DBLP]


  43. An Efficient Query Structure for Mesh Refinement. [Citation Graph (, )][DBLP]


  44. On the nonexistence of dimension reduction for $\ell2_2$ metrics. [Citation Graph (, )][DBLP]


  45. Computing the Stretch Factor of Paths, Trees, and Cycles in Weighted Fixed Orientation Metrics. [Citation Graph (, )][DBLP]


  46. Monochromatic simplices of any volume. [Citation Graph (, )][DBLP]


  47. The Solution Path of the Slab Support Vector Machine. [Citation Graph (, )][DBLP]


  48. Adaptive Searching in One and Two Dimensions. [Citation Graph (, )][DBLP]


  49. Partial Matching of Planar Polygons Under Translation and Rotation. [Citation Graph (, )][DBLP]


  50. Computing Dehn Twists and Geometric Intersection Numbers in Polynomial Time. [Citation Graph (, )][DBLP]


  51. Core-Preserving Algorithms. [Citation Graph (, )][DBLP]


  52. Polar Diagram of Moving Objects. [Citation Graph (, )][DBLP]

NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002