The SCEAS System
Navigation Menu

Conferences in DBLP

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

  1. Kumar Gaurav Bijay, Antoine Vigneron
    A practical approach to approximating diameter of point-set in low dimensions. [Citation Graph (0, 0)][DBLP]
    CCCG, 2005, pp:3-6 [Conf]
  2. Bradford G. Nickerson, Qingxiu Shi
    Approximate Orthogonal Range Search using Patricia Tries. [Citation Graph (0, 0)][DBLP]
    CCCG, 2005, pp:7-10 [Conf]
  3. Daya Ram Gaur, Ramesh Krishnamurti
    Faster approximation algorithms for scheduling tasks with a choice of start times. [Citation Graph (0, 0)][DBLP]
    CCCG, 2005, pp:11-14 [Conf]
  4. Timothy M. Chan, Abdullah-Al Mahmood
    Approximating the piercing number for unit-height rectangles. [Citation Graph (0, 0)][DBLP]
    CCCG, 2005, pp:15-18 [Conf]
  5. Peyman Afshani, Timothy M. Chan
    Approximation Algorithms for Maximum Cliques in 3D Unit-Disk Graphs. [Citation Graph (0, 0)][DBLP]
    CCCG, 2005, pp:19-22 [Conf]
  6. Lilian Buzer
    The min-# problem, a hybrid error criterion for near linear time performance. [Citation Graph (0, 0)][DBLP]
    CCCG, 2005, pp:23-26 [Conf]
  7. Eric Y. Chen, Timothy M. Chan
    Space-Efficient Algorithms for Klee's Measure Problem. [Citation Graph (0, 0)][DBLP]
    CCCG, 2005, pp:27-30 [Conf]
  8. Gill Barequet, Jonathan Naor
    Large k-D Simplices in the d-Dimensional Cube. [Citation Graph (0, 0)][DBLP]
    CCCG, 2005, pp:31-34 [Conf]
  9. Craig Falls, Yuanxin Liu, Jack Snoeyink, Diane L. Souvaine
    Testing Shortcuts to Maintain Simplicity in Subdivision Simplification. [Citation Graph (0, 0)][DBLP]
    CCCG, 2005, pp:35-38 [Conf]
  10. Andreas Spillner
    Optimal convex partitions of point sets with few inner points. [Citation Graph (0, 0)][DBLP]
    CCCG, 2005, pp:39-42 [Conf]
  11. Pankaj K. Agarwal, Mark de Berg, Jie Gao, Leonidas J. Guibas, Sariel Har-Peled
    Staying in the Middle: Exact and Approximate Medians in R1 and R2 for Moving Points. [Citation Graph (0, 0)][DBLP]
    CCCG, 2005, pp:43-46 [Conf]
  12. Stephane Durocher, David G. Kirkpatrick
    The Projection Median of a Set of Points in R2. [Citation Graph (0, 0)][DBLP]
    CCCG, 2005, pp:47-51 [Conf]
  13. Boris Aronov, Franz Aurenhammer, Ferran Hurtado, Stefan Langerman, David Rappaport, Shakhar Smorodinsky, Carlos Seara
    Small weak epsilon nets. [Citation Graph (0, 0)][DBLP]
    CCCG, 2005, pp:52-56 [Conf]
  14. Jonathan Lenchner, Hervé Brönnimann
    Observations and Computations in Sylvester-Gallai Theory. [Citation Graph (0, 0)][DBLP]
    CCCG, 2005, pp:57-60 [Conf]
  15. Timothy Abbott, Erik D. Demaine, Martin L. Demaine, Daniel Kane, Stefan Langerman, Jelani Nelson, Vincent Yeung
    Dynamic Ham-Sandwich Cuts of Convex Polygons in the Plane. [Citation Graph (0, 0)][DBLP]
    CCCG, 2005, pp:61-64 [Conf]
  16. Paz Carmi, Matthew J. Katz
    Minimum-Cost Load-Balancing Partitions. [Citation Graph (0, 0)][DBLP]
    CCCG, 2005, pp:65-67 [Conf]
  17. Sergio Cabello, José Miguel Díaz-Báñez, Stefan Langerman, Carlos Seara, Inmaculada Ventura
    Reverse facility location problems. [Citation Graph (0, 0)][DBLP]
    CCCG, 2005, pp:68-71 [Conf]
  18. Iris Ashkenazi, Boaz Ben-Moshe, Jihad El-Sana
    Approximating Radio Maps. [Citation Graph (0, 0)][DBLP]
    CCCG, 2005, pp:72-75 [Conf]
  19. Robert Benkoczi, Binay K. Bhattacharya, Sandip Das, Jeff Sember
    Collection depot location problem in the plane. [Citation Graph (0, 0)][DBLP]
    CCCG, 2005, pp:76-79 [Conf]
  20. Boaz Ben-Moshe, Binay K. Bhattacharya, Qiaosheng Shi
    Computing the Widest Empty Boomerang. [Citation Graph (0, 0)][DBLP]
    CCCG, 2005, pp:80-83 [Conf]
  21. Sándor P. Fekete, Michael Kaufmann, Alexander Kröller, Katharina Anna Lehmann
    A New Approach for Boundary Recognition in Geometric Sensor Networks. [Citation Graph (0, 0)][DBLP]
    CCCG, 2005, pp:84-87 [Conf]
  22. George Kao, Thomas Fevens, Jaroslav Opatrny
    Position-Based Routing on 3-D Geometric Graphs in Mobile Ad Hoc Networks. [Citation Graph (0, 0)][DBLP]
    CCCG, 2005, pp:88-91 [Conf]
  23. Jean Cardinal, Martine Labbé, Stefan Langerman, Belén Palop
    Pricing of Geometric Transportation Networks. [Citation Graph (0, 0)][DBLP]
    CCCG, 2005, pp:92-96 [Conf]
  24. Robert L. Scot Drysdale, Clifford Stein, David P. Wagner
    An O(n5/2log n) Algorithm for the Rectilinear Minimum Link-Distance Problem. [Citation Graph (0, 0)][DBLP]
    CCCG, 2005, pp:97-100 [Conf]
  25. Valentin Polishchuk, Joseph S. B. Mitchell
    k-Link Rectilinear Shortest Paths Among Rectilinear Obstacles in the Plane. [Citation Graph (0, 0)][DBLP]
    CCCG, 2005, pp:101-104 [Conf]
  26. Therese C. Biedl, Franz-Josef Brandenburg
    Drawing planar bipartite graphs with small area. [Citation Graph (0, 0)][DBLP]
    CCCG, 2005, pp:105-108 [Conf]
  27. Therese C. Biedl, Anna Lubiw, Michael J. Spriggs
    Morphing Polyhedra Preserving Face Normals: A Counterexample. [Citation Graph (0, 0)][DBLP]
    CCCG, 2005, pp:109-112 [Conf]
  28. Carla Binucci, Walter Didimo
    Experiments on Area Compaction Algorithms for Orthogonal Drawings. [Citation Graph (0, 0)][DBLP]
    CCCG, 2005, pp:113-116 [Conf]
  29. Therese C. Biedl, Burkay Genc
    Complexity of Octagonal and Rectangular Cartograms. [Citation Graph (0, 0)][DBLP]
    CCCG, 2005, pp:117-120 [Conf]
  30. Stirling Chow, Frank Ruskey
    Area-Proportional Drawings of Intersecting Families of Simple Closed Curves. [Citation Graph (0, 0)][DBLP]
    CCCG, 2005, pp:121-124 [Conf]
  31. Oswin Aichholzer, Franz Aurenhammer, Paola Gonzalez-Nava, Thomas Hackl, Clemens Huemer, Ferran Hurtado, Hannes Krasser, Saurabh Ray, Birgit Vogtenhuber
    Matching Edges and Faces in Polygonal Partitions. [Citation Graph (0, 0)][DBLP]
    CCCG, 2005, pp:126-129 [Conf]
  32. André Schulz
    New results on Pseudo-triangulations with low vertex degree. [Citation Graph (0, 0)][DBLP]
    CCCG, 2005, pp:130-133 [Conf]
  33. Luca Castelli Aleardi, Olivier Devillers, Gilles Schaeffer
    Dynamic updates of succinct triangulations. [Citation Graph (0, 0)][DBLP]
    CCCG, 2005, pp:134-137 [Conf]
  34. Csaba D. Tóth, Diane L. Souvaine
    A vertex-face assignment for plane graphs. [Citation Graph (0, 0)][DBLP]
    CCCG, 2005, pp:138-141 [Conf]
  35. Raquel Viaña
    Compactly Encoding and Decoding the Connectivity of a Plane Graph in Linear Time. [Citation Graph (0, 0)][DBLP]
    CCCG, 2005, pp:142-145 [Conf]
  36. N. Madhusudhanan, Prosenjit Gupta, Abhijit Mitra
    Efficient Algorithms for Range Queries in Protein Sequence Analysis. [Citation Graph (0, 0)][DBLP]
    CCCG, 2005, pp:146-149 [Conf]
  37. Rabiul Islam, Nahid Afroz, Subir Bandyopadhyay, Bhabani P. Sinha
    Computational Geometry on Optical Multi-Trees (OMULT) Computer System. [Citation Graph (0, 0)][DBLP]
    CCCG, 2005, pp:150-154 [Conf]
  38. Sasanka Roy, Subhasis Bhattacharjee, Sandip Das, Subhas C. Nandy
    A Fast Algorithm for Point Labeling Problem. [Citation Graph (0, 0)][DBLP]
    CCCG, 2005, pp:155-158 [Conf]
  39. Sherif Ghali, Chris Smith
    Computing the Boundary of a Class of Labeled-Leaf BSP Solids. [Citation Graph (0, 0)][DBLP]
    CCCG, 2005, pp:159-162 [Conf]
  40. Erik D. Demaine, Francisco Gomez-Martin, Henk Meijer, David Rappaport, Perouz Taslakian, Godfried T. Toussaint, Terry Winograd, David R. Wood
    The Distance Geometry of Deep Rhythms and Scales. [Citation Graph (0, 0)][DBLP]
    CCCG, 2005, pp:163-166 [Conf]
  41. Subhashis Majumder, Bhargab B. Bhattacharya
    Density or Discrepancy: A VLSI Designer's Dilemma in Hot Spot Analysis. [Citation Graph (0, 0)][DBLP]
    CCCG, 2005, pp:167-170 [Conf]
  42. Stefan Schirra
    Feasibility of the Exact Geometric Computation Paradigm for Largest Empty Anchored Cylinder Computation in the Plane. [Citation Graph (0, 0)][DBLP]
    CCCG, 2005, pp:171-174 [Conf]
  43. Gill Barequet, Yuval Scharf
    The Translation-Scale-Rotation Diagram for Point-Containing Placements of a Convex Polygon. [Citation Graph (0, 0)][DBLP]
    CCCG, 2005, pp:175-178 [Conf]
  44. Prosenjit Bose, Jason Morrison
    Translating a Star over a Point Set. [Citation Graph (0, 0)][DBLP]
    CCCG, 2005, pp:179-182 [Conf]
  45. Ramaswamy Chandrasekaran, Ovidiu Daescu, Jun Luo
    Cutting Out Polygons. [Citation Graph (0, 0)][DBLP]
    CCCG, 2005, pp:183-186 [Conf]
  46. Therese C. Biedl
    The complexity of domino tiling. [Citation Graph (0, 0)][DBLP]
    CCCG, 2005, pp:187-190 [Conf]
  47. Theocharis Malamatos
    Lower bounds for expected-case planar point location. [Citation Graph (0, 0)][DBLP]
    CCCG, 2005, pp:191-194 [Conf]
  48. Maike Buchin, Joachim Giesen
    Minimizing the Total Absolute Gaussian Curvature in a Terrain is Hard. [Citation Graph (0, 0)][DBLP]
    CCCG, 2005, pp:195-198 [Conf]
  49. Therese C. Biedl, Joseph Douglas Horton, Alejandro López-Ortiz
    Cross-Stitching Using Little Thread. [Citation Graph (0, 0)][DBLP]
    CCCG, 2005, pp:199-202 [Conf]
  50. Chris Worman, Boting Yang
    On the Computation and Chromatic Number of Colored Domino Tilings. [Citation Graph (0, 0)][DBLP]
    CCCG, 2005, pp:203-206 [Conf]
  51. James Factor
    Designing Modern Linkages to Trace Bezier Curves. [Citation Graph (0, 0)][DBLP]
    CCCG, 2005, pp:207-210 [Conf]
  52. Mirela Damian, Robin Y. Flatland, Joseph O'Rourke
    Unfolding Manhattan Towers. [Citation Graph (0, 0)][DBLP]
    CCCG, 2005, pp:211-214 [Conf]
  53. Dominique Michelucci, Sebti Foufou, Loïc Lamarque, David Ménegaux
    Bernstein based arithmetic featuring de Casteljau. [Citation Graph (0, 0)][DBLP]
    CCCG, 2005, pp:215-218 [Conf]
  54. Audrey Lee, Ileana Streinu, Louis Theran
    Finding and Maintaining Rigid Components. [Citation Graph (0, 0)][DBLP]
    CCCG, 2005, pp:219-222 [Conf]
  55. Jack Snoeyink, Ileana Streinu
    Computing Rigid Components of Pseudo-triangulation Mechanisms in Linear Time. [Citation Graph (0, 0)][DBLP]
    CCCG, 2005, pp:223-226 [Conf]
  56. Ovidiu Daescu, Jun Luo, David M. Mount
    Proximity Problems on Line Segments Spanned by Points. [Citation Graph (0, 0)][DBLP]
    CCCG, 2005, pp:227-231 [Conf]
  57. Kathryn Duffy, Chris McAloney, Henk Meijer, David Rappaport
    Closest Segments. [Citation Graph (0, 0)][DBLP]
    CCCG, 2005, pp:232-234 [Conf]
  58. John Fischer, Sariel Har-Peled
    Dynamic Well-Separated Pair Decomposition Made Easy. [Citation Graph (0, 0)][DBLP]
    CCCG, 2005, pp:235-238 [Conf]
  59. Wm. Randolph Franklin
    Nearest Point Query on 184M Points in E3 with a Uniform Grid. [Citation Graph (0, 0)][DBLP]
    CCCG, 2005, pp:239-242 [Conf]
  60. Boaz Ben-Moshe, Binay K. Bhattacharya, Qiaosheng Shi
    Farthest Neighbor Voronoi Diagram in the Presence of Rectangular Obstacles. [Citation Graph (0, 0)][DBLP]
    CCCG, 2005, pp:243-246 [Conf]
  61. Amr Elmasry, Khaled M. Elbassioni
    Output-Sensitive Algorithms for Enumerating and Counting Simplices Containing a Given Point in the Plane. [Citation Graph (0, 0)][DBLP]
    CCCG, 2005, pp:248-251 [Conf]
  62. Nejib Zaguia, Guy-Vincent Jourdan, Mustafa Alhashem
    On the Pagenumber of Bipartite Orders. [Citation Graph (0, 0)][DBLP]
    CCCG, 2005, pp:252-255 [Conf]
  63. Christophe Weibel, Komei Fukuda
    Computing faces up to k dimensions of a Minkowski Sum of Polytopes. [Citation Graph (0, 0)][DBLP]
    CCCG, 2005, pp:256-259 [Conf]
  64. Michael Burr, Alexandra Lauric, Katelyn Mann
    Searching for the Center of an Ellipse. [Citation Graph (0, 0)][DBLP]
    CCCG, 2005, pp:260-263 [Conf]
  65. Jack Snoeyink
    Maximum Independent Set for Intervals by Divide-Prune-and-Conquer. [Citation Graph (0, 0)][DBLP]
    CCCG, 2005, pp:264-265 [Conf]
  66. Jean-Daniel Boissonnat, Camille Wormser, Mariette Yvinec
    Anisotropic Diagrams: Labelle Shewchuk approach revisited. [Citation Graph (0, 0)][DBLP]
    CCCG, 2005, pp:266-269 [Conf]
  67. Kevin Buchin, Joachim Giesen
    Flow Complex: General Structure and Algorithm. [Citation Graph (0, 0)][DBLP]
    CCCG, 2005, pp:270-273 [Conf]
  68. Shin-ichi Tanigawa, Naoki Katoh
    Finding a triangular mesh with a constant number of different edge lengths. [Citation Graph (0, 0)][DBLP]
    CCCG, 2005, pp:274-277 [Conf]
  69. Jean Cardinal, Sébastien Collette, Stefan Langerman
    Region Counting Distances and Region Counting Circles. [Citation Graph (0, 0)][DBLP]
    CCCG, 2005, pp:278-281 [Conf]
  70. Démian Nave, Nikos Chrisochoides
    Boundary Refinement in Delaunay Mesh Generation Using Arbitrarily Ordered Vertex Insertion. [Citation Graph (0, 0)][DBLP]
    CCCG, 2005, pp:282-285 [Conf]
  71. Lilian Buzer
    Solving online feasibility problem in constant amortized time per update. [Citation Graph (0, 0)][DBLP]
    CCCG, 2005, pp:286-289 [Conf]
  72. Valentin Polishchuk, Joseph S. B. Mitchell
    Touring Convex Bodies - A Conic Programming Solution. [Citation Graph (0, 0)][DBLP]
    CCCG, 2005, pp:290-293 [Conf]
  73. Luc Habert
    Computing bitangents for ellipses. [Citation Graph (0, 0)][DBLP]
    CCCG, 2005, pp:294-297 [Conf]
  74. Hazel Everett, Sylvain Lazard, Sylvain Petitjean, Linqiao Zhang
    An Experimental Assessment of the 2D Visibility Complex. [Citation Graph (0, 0)][DBLP]
    CCCG, 2005, pp:298-301 [Conf]
  75. Olivier Devillers, Vida Dujmovic, Hazel Everett, Samuel Hornus, Sue Whitesides, Steve Wismath
    Maintaining Visibility Information of Planar Point Sets with a Moving Viewpoint. [Citation Graph (0, 0)][DBLP]
    CCCG, 2005, pp:302-305 [Conf]
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