The SCEAS System
Navigation Menu

Conferences in DBLP

Symposium on Computational Geometry (compgeom)
2003 (conf/compgeom/2003)

  1. Artur Czumaj, Hairong Zhao
    Fault-tolerant geometric spanners. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2003, pp:1-10 [Conf]
  2. Timothy M. Chan
    Euclidean bounded-degree spanning tree ratios. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2003, pp:11-19 [Conf]
  3. Sergio Cabello, Marc J. van Kreveld
    Approximation algorithms for aligning points. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2003, pp:20-28 [Conf]
  4. Sariel Har-Peled, Yusu Wang
    Shape fitting with outliers. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2003, pp:29-38 [Conf]
  5. Sariel Har-Peled, Kasturi R. Varadarajan
    High-dimensional shape fitting in linear time. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2003, pp:39-47 [Conf]
  6. John Hershberger
    Smooth kinetic maintenance of clusters. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2003, pp:48-57 [Conf]
  7. Mirela Tanase, Remco C. Veltkamp
    Polygon decomposition based on the straight line skeleton. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2003, pp:58-67 [Conf]
  8. Sariel Har-Peled, Vladlen Koltun, Dezhen Song, Kenneth Y. Goldberg
    Efficient algorithms for shared camera control. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2003, pp:68-77 [Conf]
  9. Marc J. van Kreveld, Iris Reinbacher
    Good NEWS: partitioning a simple polygon by compass directions. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2003, pp:78-87 [Conf]
  10. Danny Z. Chen, Xiaobo Hu, Shuang Luan, Chao Wang, Xiaodong Wu
    Geometric algorithms for static leaf sequencing problems in radiation therapy. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2003, pp:88-97 [Conf]
  11. Rom Pinchasi, Rados Radoicic
    Topological graphs with no self-intersecting cycle of lenth 4. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2003, pp:98-103 [Conf]
  12. József Solymosi, Van H. Vu
    Distinct distances in homogeneous sets. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2003, pp:104-105 [Conf]
  13. János Pach, Rom Pinchasi, Micha Sharir
    A tight bound for the number of different directions in three dimensions. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2003, pp:106-113 [Conf]
  14. Sariel Har-Peled, Shakhar Smorodinsky
    On conflict-free coloring of points and simple regions in the plane. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2003, pp:114-123 [Conf]
  15. József Balogh, Oded Regev, Clifford D. Smyth, William L. Steiger, Mario Szegedy
    Long monotone paths in line arrangements. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2003, pp:124-128 [Conf]
  16. Jivri Matouaek
    New constructions of weak epsilon-nets. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2003, pp:129-135 [Conf]
  17. Vladlen Koltun, Micha Sharir
    Curve-sensitive cuttings. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2003, pp:136-143 [Conf]
  18. Oswin Aichholzer, Franz Aurenhammer, Peter Braay
    Spatial embedding of pseudo-triangulations. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2003, pp:144-153 [Conf]
  19. Ruth Haas, David Orden, Günter Rote, Francisco Santos, Brigitte Servatius, Herman Servatius, Diane L. Souvaine, Ileana Streinu, Walter Whiteley
    Planar minimally rigid graphs and pseudo-triangulations. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2003, pp:154-163 [Conf]
  20. Helmut Alt, Christian Knauer, Günter Rote, Sue Whitesides
    The complexity of (un)folding. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2003, pp:164-170 [Conf]
  21. Jeff Erickson
    Local polyhedra and geometric graphs. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2003, pp:171-180 [Conf]
  22. Jonathan Richard Shewchuk
    Updating and constructing constrained delaunay and constrained regular triangulations by flips. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2003, pp:181-190 [Conf]
  23. François Labelle, Jonathan Richard Shewchuk
    Anisotropic voronoi diagrams and guaranteed-quality anisotropic mesh generation. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2003, pp:191-200 [Conf]
  24. Dominique Attali, Jean-Daniel Boissonnat, André Lieutier
    Complexity of the delaunay triangulation of points on surfaces the smooth case. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2003, pp:201-210 [Conf]
  25. Nina Amenta, Sunghee Choi, Günter Rote
    Incremental constructions con BRIO. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2003, pp:211-219 [Conf]
  26. John Iacono, Stefan Langerman
    Proximate planar point location. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2003, pp:220-226 [Conf]
  27. Boris Aronov, Hervé Brönnimann, Allen Y. Chang, Yi-Jen Chiang
    Cost-driven octree construction schemes: an experimental study. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2003, pp:227-236 [Conf]
  28. Pankaj K. Agarwal, Lars Arge, Andrew Danner, Bryan Holland-Minkley
    Cache-oblivious data structures for orthogonal range searching. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2003, pp:237-245 [Conf]
  29. Laurent Dupont, Daniel Lazard, Sylvain Lazard, Sylvain Petitjean
    Near-optimal parameterization of the intersection of quadrics. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2003, pp:246-255 [Conf]
  30. Sylvain Pion, Chee-Keng Yap
    Constructive root bound for k-ary rational input numbers. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2003, pp:256-263 [Conf]
  31. Dan Halperin, Eran Leiserowitz
    Controlled perturbation for arrangements of circles. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2003, pp:264-273 [Conf]
  32. Marshall W. Bern, David Eppstein
    Optimized color gamuts for tiled displays. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2003, pp:274-281 [Conf]
  33. Pankaj K. Agarwal, Sariel Har-Peled, Micha Sharir, Yusu Wang
    Hausdorff distance under translation for points and balls. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2003, pp:282-291 [Conf]
  34. Kaspar Fischer, Bernd Gärtner
    The smallest enclosing ball of balls: combinatorial structure and algorithms. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2003, pp:292-301 [Conf]
  35. Siu-Wing Cheng, Stefan Funke, Mordecai J. Golin, Piyush Kumar, Sheung-Hung Poon, Edgar A. Ramos
    Curve reconstruction from noisy samples. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2003, pp:302-311 [Conf]
  36. David Cohen-Steiner, Jean-Marie Morvan
    Restricted delaunay triangulations and normal cycle. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2003, pp:312-321 [Conf]
  37. Niloy J. Mitra, An Nguyen
    Estimating surface normals in noisy point cloud data. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2003, pp:322-328 [Conf]
  38. Joachim Giesen, Uli Wagner
    Shape dimension and intrinsic metric from samples of manifolds with high co-dimension. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2003, pp:329-337 [Conf]
  39. David E. Cardoze
    An optimal algorithm for the minimum edge cardinality cut surface problem. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2003, pp:338-343 [Conf]
  40. Kree Cole-McLaughlin, Herbert Edelsbrunner, John Harer, Vijay Natarajan, Valerio Pascucci
    Loops in reeb graphs of 2-manifolds. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2003, pp:344-350 [Conf]
  41. Frédéric Cazals, Frédéric Chazal, Thomas Lewiner
    Molecular shape analysis based upon the morse-smale complex and the connolly function. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2003, pp:351-360 [Conf]
  42. Herbert Edelsbrunner, John Harer, Vijay Natarajan, Valerio Pascucci
    Morse-smale complexes for piecewise linear 3-manifolds. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2003, pp:361-370 [Conf]
  43. Timothy M. Chan, Alexander Golynski, Alejandro López-Ortiz, Claude-Guy Quimper
    the asteroid surveying problem and other puzzles. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2003, pp:372-373 [Conf]
  44. Frantisek Brabec, Hanan Samet, Cemal Yilmaz
    VASCO: visualizing and animating spatial constructs and operations. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2003, pp:374-375 [Conf]
  45. Xavier Décoret, Frédo Durand, François X. Sillion
    Billboard clouds. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2003, pp:376- [Conf]
  46. John Iacono
    A 3-D visualization of kirkpatrick's planar point location algorithm. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2003, pp:377- [Conf]
  47. Gill Barequet, Evgeny Yakersberg
    Morphing between shapes by using their straight skeletons. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2003, pp:378-379 [Conf]
  48. Tom Murtagh, Seok-Hee Hong
    3DTreeDraw: a thjree dimensional tree drawing system. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2003, pp:380-381 [Conf]
  49. Tien-Ruey Hsiang, Esther M. Arkin, Michael A. Bender, Sándor P. Fekete, Joseph S. B. Mitchell
    Online dispersion algorithms for swarms of robots. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2003, pp:382-383 [Conf]
  50. Carola Wenk, Helmut Alt, Alon Efrat, Lingeshwaran Palaniappan, Günter Rote
    Finding a curve in a map. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2003, pp:384-385 [Conf]
  51. Young J. Kim, Miguel A. Otaduy, Ming C. Lin, Dinesh Manocha
    Fast penetration depth estimation using rasterization hardware and hierarchical refinement. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2003, pp:386-387 [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