The SCEAS System
Navigation Menu

Conferences in DBLP

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

  1. New Algorithms for Computing Maximum Perimeter and Maximum Area of the Convex Hull of Imprecise Inputs Based On the Parallel Line Segment Model. [Citation Graph (, )][DBLP]

  2. Optimal Empty Pseudo-Triangles in a Point Set. [Citation Graph (, )][DBLP]

  3. Clarkson's Algorithm for Violator Spaces. [Citation Graph (, )][DBLP]

  4. On Graph Thickness, Geometric Thickness, and Separator Theorems. [Citation Graph (, )][DBLP]

  5. Colored Simultaneous Geometric Embeddings and Universal Pointsets. [Citation Graph (, )][DBLP]

  6. On Directed Graphs with an Upward Straight-line. [Citation Graph (, )][DBLP]

  7. Computational Geometry of Contour Extraction. [Citation Graph (, )][DBLP]

  8. Enumeration of Polyominoes for p4 Tiling. [Citation Graph (, )][DBLP]

  9. Packing 2×2 unit squares into grid polygons is NP-complete. [Citation Graph (, )][DBLP]

  10. Symmetry Restoration by Stretching. [Citation Graph (, )][DBLP]

  11. On symmetric realizations of the simplicial complex of 3-crossing-free sets of diagonals of the octagon. [Citation Graph (, )][DBLP]

  12. Generalized jewels and the point placement problem. [Citation Graph (, )][DBLP]

  13. Generalizations of Interval Graphs. [Citation Graph (, )][DBLP]

  14. A Comparison of Two Fully-Dynamic Delaunay Triangulation Methods. [Citation Graph (, )][DBLP]

  15. Minimizing Slope Change in Imprecise 1.5D terrains. [Citation Graph (, )][DBLP]

  16. Slope Preserving Terrain Simplification - An Experimental Study. [Citation Graph (, )][DBLP]

  17. Rigid Components of Random Graphs. [Citation Graph (, )][DBLP]

  18. Angular rigidity in 3D: combinatorial characterizations and algorithms. [Citation Graph (, )][DBLP]

  19. Nucleation-free 3D rigidity. [Citation Graph (, )][DBLP]

  20. Open Problems from CCCG 2008. [Citation Graph (, )][DBLP]

  21. The Centervertex Theorem for Wedge Depth. [Citation Graph (, )][DBLP]

  22. Streaming 1-Center with Outliers in High Dimensions. [Citation Graph (, )][DBLP]

  23. Constant-Working-Space Algorithms for Geometric Problems. [Citation Graph (, )][DBLP]

  24. Every four-colorable graph is isomorphic to a subgraph of the Visibility Graph of the Integer Lattice. [Citation Graph (, )][DBLP]

  25. Planar Packing of Diameter-Four Trees. [Citation Graph (, )][DBLP]

  26. Every Large Point Set contains Many Collinear Points or an Empty Pentagon. [Citation Graph (, )][DBLP]

  27. On the Height of a Homotopy. [Citation Graph (, )][DBLP]

  28. Computing Fréchet Distance with Speed Limits. [Citation Graph (, )][DBLP]

  29. General minisum circle location. [Citation Graph (, )][DBLP]

  30. Approximating Maximum Flow in Polygonal Domains using Spanners. [Citation Graph (, )][DBLP]

  31. Bold Graph Drawings. [Citation Graph (, )][DBLP]

  32. Defining and computing accessibility radius. [Citation Graph (, )][DBLP]

  33. Intrinsic Multiscale Geometry. [Citation Graph (, )][DBLP]

  34. Data Structures for Reporting Extension Violations in a Query Range. [Citation Graph (, )][DBLP]

  35. Data Structures for Range Aggregation by Categories. [Citation Graph (, )][DBLP]

  36. How to make a picturesque maze. [Citation Graph (, )][DBLP]

  37. An Inequality on the Edge Lengths of Triangular Meshes. [Citation Graph (, )][DBLP]

  38. Integer Point Sets Minimizing Average Pairwise l1 Distance: What is the Optimal Shape of a Town? [Citation Graph (, )][DBLP]

  39. Wireless Localization with Vertex Guards is NP-hard. [Citation Graph (, )][DBLP]

  40. Inapproximability of the Perimeter Defense Problem. [Citation Graph (, )][DBLP]

  41. The Bichromatic Rectangle Problem in High Dimensions. [Citation Graph (, )][DBLP]

  42. On the Dilation of Delaunay Triangulations of Points in Convex Position. [Citation Graph (, )][DBLP]

  43. The spanning ratio of the Delaunay triangulation is greater than pi/2. [Citation Graph (, )][DBLP]

  44. Relaxed Gabriel Graphs. [Citation Graph (, )][DBLP]

  45. Teaching Computational Geometry, II. [Citation Graph (, )][DBLP]

System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
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 [] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002