The SCEAS System
Navigation Menu

Conferences in DBLP

Symposium on Computational Geometry (compgeom)
1998 (conf/compgeom/98)

  1. Victor Milenkovic
    Rotational Polygon Containment and Minimum Enclosure. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1998, pp:1-8 [Conf]
  2. Dan Halperin, Jean-Claude Latombe, Randall H. Wilson
    A General Framework for Assembly Planning: The Motion Space Approach. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1998, pp:9-18 [Conf]
  3. Jayanth Majhi, Ravi Janardan, Michiel H. M. Smid, Jörg Schwerdt
    Multi-Criteria Geometric Optimization Problems in Layered Manufacturing. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1998, pp:19-28 [Conf]
  4. Siu-Wing Cheng, Herbert Edelsbrunner, Ping Fu, Ka-Po Lam
    Design and Analysis of Planar Shape Deformation. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1998, pp:29-38 [Conf]
  5. Nina Amenta, Marshall W. Bern
    Surface Reconstruction by Voronoi Filtering. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1998, pp:39-48 [Conf]
  6. Jack Snoeyink
    Cross-Ratios and Angles Determine a Polygon. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1998, pp:49-57 [Conf]
  7. David Eppstein, Jeff Erickson
    Raising Roofs, Crashing Cycles, and Playing Pool: Applications of a Data Structure for Finding Pairwise Interactions. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1998, pp:58-67 [Conf]
  8. Sergey P. Tarasov, Michael N. Vyalyi
    Construction of Contour Trees in 3D in O(n log n) Steps. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1998, pp:68-75 [Conf]
  9. Jonathan Richard Shewchuk
    A Condition Guaranteeing the Existence of Higher-Dimensional Constrained Delaunay Triangulations. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1998, pp:76-85 [Conf]
  10. Jonathan Richard Shewchuk
    Tetrahedral Mesh Generation by Delaunay Refinement. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1998, pp:86-95 [Conf]
  11. Ronald Beirouti, Jack Snoeyink
    Implementations of the LMT Heuristic for Minimum Weight Triangulation. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1998, pp:96-105 [Conf]
  12. Olivier Devillers
    Improved Incremental Randomized Delaunay Triangulation. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1998, pp:106-115 [Conf]
  13. Steven Fortune
    Vertex-Rounding a Three-Dimensional Polyhedral Subdivision. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1998, pp:116-125 [Conf]
  14. Marcus Vinícius A. Andrade, Jorge Stolfi
    Exact Algorithms for Circles on the Sphere. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1998, pp:126-134 [Conf]
  15. Alexandra Solan
    Cutting Cylces of Rods in Space. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1998, pp:135-142 [Conf]
  16. Alon Efrat, Sariel Har-Peled
    Fly Cheaply: On the Minimum Fuel-Consumption Problem. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1998, pp:143-145 [Conf]
  17. Lutz Kettner
    Designing a Data Structure for polyhedral Surfaces. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1998, pp:146-154 [Conf]
  18. David M. Mount, Nathan S. Netanyahu, Jacqueline Le Moigne
    Improved Algorithms for Robust Point Pattern Matching and Applications to Image Registration. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1998, pp:155-164 [Conf]
  19. Hervé Brönnimann, Christoph Burnikel, Sylvain Pion
    Interval Arithmetic Yields Efficient Dynamic Filters for Computational Geometry. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1998, pp:165-174 [Conf]
  20. Christoph Burnikel, Stefan Funke, Michael Seel
    Exact Geometric Predicates Using Cascaded Computation. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1998, pp:175-183 [Conf]
  21. Géza Tóth, Pavel Valtr
    Geometric Graphs with Few Disjoint Edges. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1998, pp:184-191 [Conf]
  22. Artur Andrzejak, Boris Aronov, Sariel Har-Peled, Raimund Seidel, Emo Welzl
    Results on k-Sets and j-Facets via Continuous Motion. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1998, pp:192-199 [Conf]
  23. Helmut Alt, Stefan Felsner, Ferran Hurtado, Marc Noy
    Point-Sets with few k-Sets. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1998, pp:200-205 [Conf]
  24. Alon Efrat, Matthew J. Katz
    On the Union of k-Curved Objects. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1998, pp:206-213 [Conf]
  25. Fred L. Bookstein
    Features of Deformation Grids: An Approach via Singularity Theory. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1998, pp:214-221 [Conf]
  26. Frédéric Cazals
    Effective Nearest Neighbors Searching on the Hyper-Cube, with Applications to Molecular Clustering. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1998, pp:222-230 [Conf]
  27. Frank Hoffmann, Klaus Kriegel, Carola Wenk
    Matching 2D Patterns of Protein Spots. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1998, pp:231-239 [Conf]
  28. James D. Fix, Richard E. Ladner
    Multiresolution Banded Refinement to Accelerate Surface Reconstruction from Polygons. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1998, pp:240-248 [Conf]
  29. Hervé Brönnimann
    Degenerate Convex Hulls On-Line in Any Fixed Dimension. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1998, pp:249-258 [Conf]
  30. Andreas Crauser, Paolo Ferragina, Kurt Mehlhorn, Ulrich Meyer, Edgar A. Ramos
    Randomized External-Memory Algorithms for Some Geometric Problems. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1998, pp:259-268 [Conf]
  31. Timothy M. Chan
    Geometric Applications of a Randomized Optimization Technique. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1998, pp:269-278 [Conf]
  32. Timothy M. Chan
    On Enumerating and Selecting Distances. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1998, pp:279-286 [Conf]
  33. Therese C. Biedl
    Drawing Planar Partitions I: LL-Drawings and LH-Drawings. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1998, pp:287-296 [Conf]
  34. Sunil Arya, Siu-Wing Cheng, David M. Mount
    Approximation Algorithms for Multiple-Tool Miling. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1998, pp:297-306 [Conf]
  35. Esther M. Arkin, Joseph S. B. Mitchell, Giri Narasimhan
    Resource-Constrained Geometric Network Optimization. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1998, pp:307-316 [Conf]
  36. Gill Barequet, Michael T. Goodrich
    Efficiently Approximating Polygonal Paths in Three and Higher Dimensions. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1998, pp:317-326 [Conf]
  37. Sariel Har-Peled
    Constructing Cuttings in Theory and Practice. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1998, pp:327-336 [Conf]
  38. Marc J. van Kreveld, Tycho Strijk, Alexander Wolff
    Point Set Labeling with Sliding Labels. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1998, pp:337-346 [Conf]
  39. Konstantinos G. Kakoulis, Ioannis G. Tollis
    A Unified Approach to Labeling Graphical Features. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1998, pp:347-356 [Conf]
  40. Sariel Har-Peled
    An Output Sensitive Algorithm for Discrete Convex Hulls. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1998, pp:357-364 [Conf]
  41. Edward J. Anderson, Sándor P. Fekete
    Asymmetric Rendezvous on the Plane. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1998, pp:365-373 [Conf]
  42. Boris Aronov, Mark de Berg, A. Frank van der Stappen, Petr Svestka, Jules Vleugels
    Motion Planning for Multiple Robots. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1998, pp:374-382 [Conf]
  43. Sariel Har-Peled
    Constructing Approximate Shortest Path Maps in Three Dimensions. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1998, pp:383-391 [Conf]
  44. Pankaj K. Agarwal, Therese C. Biedl, Sylvain Lazard, Steve Robbins, Subhash Suri, Sue Whitesides
    Curvature-Constrained Shortest Paths in a Convex Polygon (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1998, pp:392-401 [Conf]
  45. Kunihiko Sadakane, Hiroshi Imai, Kensuke Onishi, Mary Inaba, Fumihiko Takeuchi, Keiko Imai
    Voronoi Diagrams by Divergences with Additive Weights. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1998, pp:403-404 [Conf]
  46. Maria Shneerson, Ayellet Tal
    GASP-II - A Geometric Algorithm Animation System for an Electronic Classroom. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1998, pp:405-406 [Conf]
  47. Luiz Velho, Jonas Gomes, Marcos Vinicius Rayol Sobreiro
    Visualization of Color Image Quantization Using Pairwise Clustering. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1998, pp:407-408 [Conf]
  48. Felipe Contreras, Jurek Czyzowicz, Eduardo Rivera-Campo, Jorge Urrutia
    Optimal Floodlight Illumination of Stages. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1998, pp:409-410 [Conf]
  49. Alejo Hausner, David P. Dobkin
    GAWAIN: Visualizing Geometric Algorithms with Web-Based Animation. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1998, pp:411-412 [Conf]
  50. Yiorgos Chrysanthou, Daniel Cohen-Or, Eyal Zadicario
    Viewspace Partitioning of Densely Occluded Scenes. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1998, pp:413-414 [Conf]
  51. David P. Dobkin, Emden R. Gansner
    A Path Router for Graph Drawing. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1998, pp:415-416 [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