Conferences in DBLP

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

1. 
   Lower bounds for weak epsilon-nets and stair-convexity. [Citation Graph (, )][DBLP]
   
   
2. 
   Epsilon nets and union complexity. [Citation Graph (, )][DBLP]
   
   
3. 
   PTAS for geometric hitting set problems via local search. [Citation Graph (, )][DBLP]
   
   
4. 
   Near-linear approximation algorithms for geometric hitting sets. [Citation Graph (, )][DBLP]
   
   
5. 
   Coresets for polytope distance. [Citation Graph (, )][DBLP]
   
   
6. 
   Kinetic spanners in R^d. [Citation Graph (, )][DBLP]
   
   
7. 
   Shooting permanent rays among disjoint polygons in the plane. [Citation Graph (, )][DBLP]
   
   
8. 
   Computing hereditary convex structures. [Citation Graph (, )][DBLP]
   
   
9. 
   Binary plane partitions for disjoint line segments. [Citation Graph (, )][DBLP]
   
   
10. 
    Optimal in-place algorithms for 3-D convex hulls and 2-D segment intersection. [Citation Graph (, )][DBLP]
    
    
11. 
    An IP solution to the art gallery problem. [Citation Graph (, )][DBLP]
    
    
12. 
    Quadrilateral meshes with bounded minimum angle. [Citation Graph (, )][DBLP]
    
    
13. 
    Animating a continuous family of two-site Voronoi diagrams (and a proof of a bound on the number of regions). [Citation Graph (, )][DBLP]
    
    
14. 
    The scale axis picture show. [Citation Graph (, )][DBLP]
    
    
15. 
    Rectangular cartograms: the game. [Citation Graph (, )][DBLP]
    
    
16. 
    Geometric tomography: a limited-view approach for computed tomography. [Citation Graph (, )][DBLP]
    
    
17. 
    Straight skeletons of three-dimensional polyhedra. [Citation Graph (, )][DBLP]
    
    
18. 
    Reconstructing sharp features of triangular meshes. [Citation Graph (, )][DBLP]
    
    
19. 
    High resolution surface reconstruction from overlapping multiple-views. [Citation Graph (, )][DBLP]
    
    
20. 
    The scale axis transform. [Citation Graph (, )][DBLP]
    
    
21. 
    Integral estimation from point cloud in d-dimensional space: a geometric view. [Citation Graph (, )][DBLP]
    
    
22. 
    Cut locus and topology from surface point data. [Citation Graph (, )][DBLP]
    
    
23. 
    An improved bound on the number of unit area triangles. [Citation Graph (, )][DBLP]
    
    
24. 
    Halving lines and measure concentration in the plane. [Citation Graph (, )][DBLP]
    
    
25. 
    Candle in the woods: asymptotic bounds on minimum blocking sets. [Citation Graph (, )][DBLP]
    
    
26. 
    Approximate center points with proofs. [Citation Graph (, )][DBLP]
    
    
27. 
    Computational origami: from flapping birds to space telescopes. [Citation Graph (, )][DBLP]
    
    
28. 
    Visibility maps of realistic terrains have linear smoothed complexity. [Citation Graph (, )][DBLP]
    
    
29. 
    Embedding rivers in polyhedral terrains. [Citation Graph (, )][DBLP]
    
    
30. 
    The Euclidean degree-4 minimum spanning tree problem is NP-hard. [Citation Graph (, )][DBLP]
    
    
31. 
    Divide-and-conquer for Voronoi diagrams revisited. [Citation Graph (, )][DBLP]
    
    
32. 
    The geodesic farthest-site Voronoi diagram in a polygonal domain with holes. [Citation Graph (, )][DBLP]
    
    
33. 
    Incremental construction of the delaunay triangulation and the delaunay graph in medium dimension. [Citation Graph (, )][DBLP]
    
    
34. 
    Parallel geometric algorithms for multi-core computers. [Citation Graph (, )][DBLP]
    
    
35. 
    Persistent cohomology and circular coordinates. [Citation Graph (, )][DBLP]
    
    
36. 
    Proximity of persistence modules and their diagrams. [Citation Graph (, )][DBLP]
    
    
37. 
    Zigzag persistent homology and real-valued functions. [Citation Graph (, )][DBLP]
    
    
38. 
    Distributed vision with smart pixels. [Citation Graph (, )][DBLP]
    
    
39. 
    Area-universal rectangular layouts. [Citation Graph (, )][DBLP]
    
    
40. 
    Cache-oblivious range reporting with optimal queries requires superlinear space. [Citation Graph (, )][DBLP]
    
    
41. 
    A general approach for cache-oblivious range reporting and approximate range counting. [Citation Graph (, )][DBLP]
    
    
42. 
    A proof of the molecular conjecture. [Citation Graph (, )][DBLP]
    
    
43. 
    Flattening single-vertex origami: the non-expansive case. [Citation Graph (, )][DBLP]
    
    
44. 
    Arrangements of double pseudolines: extended abstract. [Citation Graph (, )][DBLP]
    
    
45. 
    k-means requires exponentially many iterations even in the plane. [Citation Graph (, )][DBLP]
    
    
46. 
    Approximation algorithms for maximum independent set of pseudo-disks. [Citation Graph (, )][DBLP]
    
    
47. 
    On the set multi-cover problem in geometric settings. [Citation Graph (, )][DBLP]
    
    
48. 
    Adaptive isotopic approximation of nonsingular curves: the parametrizability and nonlocal isotopy approach. [Citation Graph (, )][DBLP]
    
    
49. 
    On the topology of planar algebraic curves. [Citation Graph (, )][DBLP]
    
    
50. 
    Randomly removing g handles at once. [Citation Graph (, )][DBLP]
    
    
51. 
    Minimum cuts and shortest homologous cycles. [Citation Graph (, )][DBLP]
    
    
52. 
    Diameter of polyhedra: limits of abstraction. [Citation Graph (, )][DBLP]
    
    
53. 
    Minimum Manhattan network is NP-complete. [Citation Graph (, )][DBLP]
    
    
54. 
    On grids in topological graphs. [Citation Graph (, )][DBLP]