The SCEAS System
Navigation Menu

Conferences in DBLP

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

  1. Watchman route in a simple polygon with a rubberband algorithm. [Citation Graph (, )][DBLP]

  2. Multi-guard covers for polygonal regions. [Citation Graph (, )][DBLP]

  3. The 3-dimensional searchlight scheduling problem. [Citation Graph (, )][DBLP]

  4. Some properties of higher order delaunay and gabriel graphs. [Citation Graph (, )][DBLP]

  5. Existence of zone diagrams in compact subsets of uniformly convex spaces. [Citation Graph (, )][DBLP]

  6. Blocking delaunay triangulations. [Citation Graph (, )][DBLP]

  7. Those ubiquitous cut polyhedra. [Citation Graph (, )][DBLP]

  8. Connected dominating sets on dynamic geometric graphs. [Citation Graph (, )][DBLP]

  9. Stable roommates and geometric spanners. [Citation Graph (, )][DBLP]

  10. 3d local algorithm for dominating sets of unit disk graphs. [Citation Graph (, )][DBLP]

  11. Direction assignment in wireless networks. [Citation Graph (, )][DBLP]

  12. Combinatorial changes of euclidean minimum spanning tree of moving points in the plane. [Citation Graph (, )][DBLP]

  13. k-sets and continuous motion in R3. [Citation Graph (, )][DBLP]

  14. An optimal solution for dynamic polar diagram. [Citation Graph (, )][DBLP]

  15. Towards a dynamic data structure for efficient bounded line range search. [Citation Graph (, )][DBLP]

  16. On degeneracy of lower envelopes of algebraic surfaces. [Citation Graph (, )][DBLP]

  17. Ghost chimneys. [Citation Graph (, )][DBLP]

  18. Deflating polygons to the limit. [Citation Graph (, )][DBLP]

  19. Coloring geometric hypergraph defined by an arrangement of half-planes. [Citation Graph (, )][DBLP]

  20. On a dispersion problem in grid labeling. [Citation Graph (, )][DBLP]

  21. Robot kabaddi. [Citation Graph (, )][DBLP]

  22. Open problem session. [Citation Graph (, )][DBLP]

  23. Compatible pointed pseudo-triangulations. [Citation Graph (, )][DBLP]

  24. Optimal encoding of triangular and quadrangular meshes with fixed topology. [Citation Graph (, )][DBLP]

  25. Bounded-degree polyhedronization of point sets. [Citation Graph (, )][DBLP]

  26. Triangulations with many points of even degree. [Citation Graph (, )][DBLP]

  27. Maximum geodesic routing in the plane with obstacles. [Citation Graph (, )][DBLP]

  28. Evading equilateral triangles without a map. [Citation Graph (, )][DBLP]

  29. Watchman tours for polygons with holes. [Citation Graph (, )][DBLP]

  30. Visibility maintenance of a moving segment observer inside polygons with holes. [Citation Graph (, )][DBLP]

  31. I/O efficient path traversal in well-shaped tetrahedral meshes. [Citation Graph (, )][DBLP]

  32. Regular labelings and geometric structures. [Citation Graph (, )][DBLP]

  33. Approximate euclidean ramsey theorems. [Citation Graph (, )][DBLP]

  34. Finding minimal bases in arbitrary spline spaces. [Citation Graph (, )][DBLP]

  35. Any monotone boolean function can be realized by interlocked polygons. [Citation Graph (, )][DBLP]

  36. Complete enumeration of small realizable oriented matroids. [Citation Graph (, )][DBLP]

  37. Oja medians and centers of gravity. [Citation Graph (, )][DBLP]

  38. The projection median of a set of points in Rd. [Citation Graph (, )][DBLP]

  39. Small strong epsilon nets. [Citation Graph (, )][DBLP]

  40. New epsilon-net constructions. [Citation Graph (, )][DBLP]

  41. On the perimeter of fat objects. [Citation Graph (, )][DBLP]

  42. Sweeping minimum perimeter enclosing parallelograms: Optimal crumb cleanup. [Citation Graph (, )][DBLP]

  43. Minimum enclosing area triangle with a fixed angle. [Citation Graph (, )][DBLP]

  44. Approximate shortest path algorithms for sequences of pairwise disjoint simple polygons. [Citation Graph (, )][DBLP]

  45. Speed-constrained geodesic fréchet distance inside a simple polygon. [Citation Graph (, )][DBLP]

  46. Hausdorff core of a one reflex vertex polygon. [Citation Graph (, )][DBLP]

  47. Computing straight skeletons of planar straight-line graphs based on motorcycle graphs. [Citation Graph (, )][DBLP]

  48. Minimum-area drawings of plane 3-trees. [Citation Graph (, )][DBLP]

  49. Approximating the independent domatic partition problem in random geometric graphs - an experimental study. [Citation Graph (, )][DBLP]

  50. Orthogonal thickness of graphs. [Citation Graph (, )][DBLP]

  51. Shooting bricks with orthogonal laser beams: A first step towards internal/external map labeling. [Citation Graph (, )][DBLP]

  52. Computing the straight skeleton of a monotone polygon in O(n log n) time. [Citation Graph (, )][DBLP]

  53. On the variance of random polygons. [Citation Graph (, )][DBLP]

  54. k-star-shaped polygons. [Citation Graph (, )][DBLP]

  55. Zipper unfoldings of polyhedral complexes. [Citation Graph (, )][DBLP]

  56. On stretch minimization problem on unit strip paper. [Citation Graph (, )][DBLP]

  57. Determining the robustness of sensor barriers. [Citation Graph (, )][DBLP]

  58. A new algorithm and improved lower bound for point placement on a line in two rounds. [Citation Graph (, )][DBLP]

  59. Constrained k-center and movement to independence. [Citation Graph (, )][DBLP]

  60. Computing minimum limited-capacity matching in one-dimensional space and for the points lying on two perpendicular lines. [Citation Graph (, )][DBLP]

  61. New variations of the reverse facility location problem. [Citation Graph (, )][DBLP]

  62. I/O-efficient triangular range search and its application. [Citation Graph (, )][DBLP]

  63. Range aggregate structures for colored geometric objects. [Citation Graph (, )][DBLP]

  64. Approximating range-aggregate queries using coresets. [Citation Graph (, )][DBLP]

  65. The traveling salesman problem for lines and rays in the plane. [Citation Graph (, )][DBLP]

  66. Fast local searches and updates in bounded universes. [Citation Graph (, )][DBLP]

  67. Cluster connecting problem inside a polygon. [Citation Graph (, )][DBLP]

  68. Finding monochromatic l-shapes in bichromatic point sets. [Citation Graph (, )][DBLP]

  69. On polygons excluding point sets. [Citation Graph (, )][DBLP]

  70. Six-way equipartitioning by three lines in the plane. [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