The SCEAS System
Navigation Menu

Conferences in DBLP

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

  1. Pankaj K. Agarwal, Micha Sharir
    On the number of congruent simplices in a point. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2001, pp:1-9 [Conf]
  2. Oswin Aichholzer, Franz Aurenhammer, Hannes Krasser
    Enumerating order types for small sets with applications. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2001, pp:11-18 [Conf]
  3. János Pach, Ido Safruti, Micha Sharir
    The union of congruent cubes in three dimensions. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2001, pp:19-28 [Conf]
  4. József Solymosi, Csaba D. Tóth
    On the distinct distances determined by a planar point set. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2001, pp:29-32 [Conf]
  5. Sergio Cabello, Mark de Berg, Steven van Dijk, Marc J. van Kreveld, Tycho Strijk
    Schematization of road networks. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2001, pp:33-39 [Conf]
  6. Regina Estkowski, Joseph S. B. Mitchell
    Simplifying a polygonal subdivision while keeping it simple. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2001, pp:40-49 [Conf]
  7. Nabil H. Mustafa, Eleftherios Koutsofios, Shankar Krishnan, Suresh Venkatasubramanian
    Hardware-assisted view-dependent map simplification. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2001, pp:50-59 [Conf]
  8. Mihai Pop, Christian A. Duncan, Gill Barequet, Michael T. Goodrich, Wenjing Huang, Subodh Kumar
    Efficient perspective-accurate silhouette computation and applications. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2001, pp:60-68 [Conf]
  9. Thomas C. Hales
    Sphere packings and generative. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2001, pp:69- [Conf]
  10. Herbert Edelsbrunner, John Harer, Afra Zomorodian
    Hierarchical morse complexes for piecewise linear 2-manifolds. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2001, pp:70-79 [Conf]
  11. Francis Lazarus, Michel Pocchiola, Gert Vegter, Anne Verroust
    Computing a canonical polygonal schema of an orientable triangulated surface. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2001, pp:80-89 [Conf]
  12. Alan Saalfeld
    Area-preserving piecewise affine mappings. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2001, pp:90-95 [Conf]
  13. Jeff Erickson
    Nice point sets can have nasty Delaunay triangulations. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2001, pp:96-105 [Conf]
  14. Olivier Devillers, Sylvain Pion, Monique Teillaud
    Walking in a triangulation. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2001, pp:106-114 [Conf]
  15. Herbert Edelsbrunner, Damrong Guoy
    Sink-insertion for mesh improvement. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2001, pp:115-123 [Conf]
  16. Pankaj K. Agarwal, Mark de Berg, Joachim Gudmundsson, Mikael Hammar, Herman J. Haverkort
    Box-trees and R-trees with near-optimal query time. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2001, pp:124-133 [Conf]
  17. Mark de Berg, João Comba, Leonidas J. Guibas
    A segment-tree based kinetic BSP. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2001, pp:134-140 [Conf]
  18. Adrian Dumitrescu, Joseph S. B. Mitchell, Micha Sharir
    Binary space partitions for axis-parallel segments, rectangles, and hyperrectangles. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2001, pp:141-150 [Conf]
  19. Csaba D. Tóth
    A note on binary plane partitions. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2001, pp:151-156 [Conf]
  20. Helmut Alt, Laura Heinrich-Litan
    Exact Linfty Nearest Neighbor Search in High Dimensions. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2001, pp:157-163 [Conf]
  21. Boaz Ben-Moshe, Matthew J. Katz, Joseph S. B. Mitchell
    Farthest neighbors and center points in the presence of rectangular obstacles. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2001, pp:164-171 [Conf]
  22. Timothy M. Chan
    A fully dynamic algorithm for planar. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2001, pp:172-176 [Conf]
  23. Sariel Har-Peled
    A practical approach for computing the diameter of a point set. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2001, pp:177-186 [Conf]
  24. Frederic M. Richards
    Protein geometry as a function of time. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2001, pp:187- [Conf]
  25. Jie Gao, Leonidas J. Guibas, John Hershberger, Li Zhang, An Zhu
    Discrete mobile centers. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2001, pp:188-196 [Conf]
  26. Vladlen Koltun
    Segment intersection searching problems in general settings. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2001, pp:197-206 [Conf]
  27. Stefan Langerman
    On the complexity of halfspace area queries. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2001, pp:207-211 [Conf]
  28. Danny Z. Chen, Xiaobo Hu, Yingping Huang, Yifan Li, Jinhui Xu
    Algorithms for congruent sphere packing and applications. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2001, pp:212-221 [Conf]
  29. Ewgenij Gawrilow, Michael Joswig
    Polymake: an approach to modular software design in computational geometry. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2001, pp:222-231 [Conf]
  30. Héctor H. González-Baños
    A randomized art-gallery algorithm for sensor placement. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2001, pp:232-240 [Conf]
  31. Naoki Katoh, Takeshi Tokuyama
    Notes on computing peaks in k-levels and parametric spanning trees. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2001, pp:241-248 [Conf]
  32. Matthew J. Katz, Kasturi R. Varadarajan
    A tight bound on the number of geometric permutations of convex fat objects in Rd. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2001, pp:249-251 [Conf]
  33. Micha Sharir
    The Clarkson-Shor technique revisited and extended. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2001, pp:252-256 [Conf]
  34. Tamal K. Dey, Joachim Giesen
    Detecting undersampling in surface reconstruction. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2001, pp:257-263 [Conf]
  35. Nicola Geismann, Michael Hemmer, Elmar Schömer
    Computing a 3-dimensional cell in an arrangement of quadrics: exactly and actually! [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2001, pp:264-273 [Conf]
  36. Shankar Krishnan, Mark Foskey, Tim Culver, John Keyser, Dinesh Manocha
    PRECISE: efficient multiprecision evaluation of algebraic roots and predicates for reliable geometric computation. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2001, pp:274-283 [Conf]
  37. George W. Hart
    Computational geometry for sculpture. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2001, pp:284-287 [Conf]
  38. Saugata Basu
    Different bounds on the different Betti numbers of semi-algebraic sets. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2001, pp:288-292 [Conf]
  39. David P. Dobkin, Ayellet Tal
    Efficient and small representation of line arrangements with applications. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2001, pp:293-301 [Conf]
  40. Pierre Angelier, Michel Pocchiola
    A sum of squares theorem for visibility. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2001, pp:302-311 [Conf]
  41. Rados Radoicic, Géza Tóth
    Monotone paths in line arrangement. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2001, pp:312-314 [Conf]
  42. Micha Sharir, Emo Welzl
    Balanced lines, halving triangles, and the generalized lower bound theorem. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2001, pp:315-318 [Conf]
  43. David P. Dobkin, Ayellet Tal
    Small representation of line arrangements. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2001, pp:319-320 [Conf]
  44. Nicola Geismann, Michael Hemmer, Elmar Schömer
    The convex hull of ellipsoids. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2001, pp:321-322 [Conf]
  45. Gill Barequet, Robert L. Scot Drysdale, Matthew Dickerson, David S. Guertin
    2-point site Voronoi diagrams. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2001, pp:323-324 [Conf]
  46. Martin Isenburg, Stefan Gumhold, Craig Gotsman
    The connectivity shapes video. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2001, pp:325-326 [Conf]
  47. Lutz Kettner, Jack Snoeyink
    A prototype system for visualizing time-dependent volume data. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2001, pp:327-328 [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