Conferences in DBLP

European Workshop on Computational Geometry (ewcg)
2005 (conf/ewcg/2005)

1. 
   A unified algorithm for adaptive spacetime meshing with nonlocal cone constraints. [Citation Graph (, )][DBLP]
   
   
2. 
   Quality triangulations made smaller. [Citation Graph (, )][DBLP]
   
   
3. 
   The relative neighbourhood graph is a part of every 30°-triangulation. [Citation Graph (, )][DBLP]
   
   
4. 
   Bounds on optimally triangulating connected subsets of the minimum weight convex partition. [Citation Graph (, )][DBLP]
   
   
5. 
   Incremental construction along space-filling curves. [Citation Graph (, )][DBLP]
   
   
6. 
   Region counting graphs. [Citation Graph (, )][DBLP]
   
   
7. 
   Homotopic spanners. [Citation Graph (, )][DBLP]
   
   
8. 
   Finding the best shortcut in a geometric network. [Citation Graph (, )][DBLP]
   
   
9. 
   An exclusion region for minimum dilation triangulations. [Citation Graph (, )][DBLP]
   
   
10. 
    Improved lower bound on the geometric dilation of point sets. [Citation Graph (, )][DBLP]
    
    
11. 
    On computing Fréchet distance of two paths on a convex polyhedron. [Citation Graph (, )][DBLP]
    
    
12. 
    Semi-computability of the Fréchet distance between surfaces. [Citation Graph (, )][DBLP]
    
    
13. 
    Matching surfaces with characteristic points. [Citation Graph (, )][DBLP]
    
    
14. 
    Approximation algorithms for the Earth mover's distance under transformations using reference points. [Citation Graph (, )][DBLP]
    
    
15. 
    Matching point sets with respect to the Earth mover's distance. [Citation Graph (, )][DBLP]
    
    
16. 
    Abstract order type extension and new results on the rectilinear crossing number. [Citation Graph (, )][DBLP]
    
    
17. 
    Quadrangulations and 2-colorations. [Citation Graph (, )][DBLP]
    
    
18. 
    Discrete curvatures and Gauss maps for polyhedral surfaces. [Citation Graph (, )][DBLP]
    
    
19. 
    On the number of facets of three-dimensional Dirichlet stereohedra III: Cubic group. [Citation Graph (, )][DBLP]
    
    
20. 
    A pointed Delaunay pseudo-triangulation of a simple polygon. [Citation Graph (, )][DBLP]
    
    
21. 
    Transforming spanning trees and pseudo-triangulations. [Citation Graph (, )][DBLP]
    
    
22. 
    Pseudo-tetrahedral complexes. [Citation Graph (, )][DBLP]
    
    
23. 
    On pseudo-convex decompositions, partitions, and coverings. [Citation Graph (, )][DBLP]
    
    
24. 
    Pointed binary encompassing trees: Simple and optimal. [Citation Graph (, )][DBLP]
    
    
25. 
    Approximate multi-visibility map computation. [Citation Graph (, )][DBLP]
    
    
26. 
    Approximation schemes for the generalized geometric problems with geographic clustering. [Citation Graph (, )][DBLP]
    
    
27. 
    Approximation algorithm for the L1-fitting circle problem. [Citation Graph (, )][DBLP]
    
    
28. 
    Competitive online searching for a ray in the plane. [Citation Graph (, )][DBLP]
    
    
29. 
    On optimizing multi-sequence functionals for competitive analysis. [Citation Graph (, )][DBLP]
    
    
30. 
    Minimizing local minima in terrains with higher-order Delaunay triangulations. [Citation Graph (, )][DBLP]
    
    
31. 
    On properties of higher-order Delaunay graphs with applications. [Citation Graph (, )][DBLP]
    
    
32. 
    Constructing higher-order Voronoi diagrams in parallel. [Citation Graph (, )][DBLP]
    
    
33. 
    Delineating boundaries for imprecise regions. [Citation Graph (, )][DBLP]
    
    
34. 
    An efficient algorithm for label updating in 2PM model to avoid a moving object. [Citation Graph (, )][DBLP]
    
    
35. 
    Exact analysis of optimal configurations in radii computations. [Citation Graph (, )][DBLP]
    
    
36. 
    Boolean operations on 3D selective Nef complexes: Optimized implementation and experiments. [Citation Graph (, )][DBLP]
    
    
37. 
    Ternary blending operations. [Citation Graph (, )][DBLP]
    
    
38. 
    Algebraic study of the Apollonius circle of three ellipses. [Citation Graph (, )][DBLP]
    
    
39. 
    The visibility-Voronoi complex and its applications. [Citation Graph (, )][DBLP]
    
    
40. 
    Constructing the city Voronoi diagram faster. [Citation Graph (, )][DBLP]
    
    
41. 
    Computing transportation Voronoi diagrams in optimal time. [Citation Graph (, )][DBLP]
    
    
42. 
    Approximations of 3D generalized Voronoi diagrams. [Citation Graph (, )][DBLP]
    
    
43. 
    Average case complexity of Voronoi diagrams of n sites from the unit cube. [Citation Graph (, )][DBLP]
    
    
44. 
    Lower bounds for kinetic sorting. [Citation Graph (, )][DBLP]
    
    
45. 
    Uncertainty envelopes. [Citation Graph (, )][DBLP]
    
    
46. 
    Covering point sets with two convex objects. [Citation Graph (, )][DBLP]
    
    
47. 
    Maximum line-pair stabbing problem and its variations. [Citation Graph (, )][DBLP]
    
    
48. 
    The fastest way to view a query point in simple polygons. [Citation Graph (, )][DBLP]
    
    
49. 
    The minimum area spanning tree problem. [Citation Graph (, )][DBLP]
    
    
50. 
    Spanning trees with few crossings in geometric and topological graphs. [Citation Graph (, )][DBLP]
    
    
51. 
    Bi-chromatic minimum spanning trees. [Citation Graph (, )][DBLP]
    
    
52. 
    Constructing interference-minimal networks. [Citation Graph (, )][DBLP]
    
    
53. 
    A note on simultaneous embedding of planar graphs. [Citation Graph (, )][DBLP]