28. Symposium on Computational Geometry 2012: Chapel Hill, NC, USA

Sunday morning, June 17, before the break

• Natan Rubin:
  On topological changes in the delaunay triangulation of moving points. 1-10
  
• Alina Ene, Sariel Har-Peled, Benjamin Raichel:
  Geometric packing under non-uniform constraints. 11-20
  
• Md. Jawaherul Alam, Therese C. Biedl, Stefan Felsner, Michael Kaufmann, Stephen G. Kobourov, Torsten Ueckerdt:
  Computing cartograms with optimal complexity. 21-30
  
• Amirali Abdullah, John Moeller, Suresh Venkatasubramanian:
  Approximate bregman near neighbors in sublinear time: beyond the triangle inequality. 31-40
  

Sunday morning, June 17, after the break

• Therese C. Biedl, Martin Vatshelle:
  The point-set embeddability problem for plane graphs. 41-50
  
• Michal Adamaszek, Juraj Stacho:
  Algorithmic complexity of finding cross-cycles in flag complexes. 51-60
  
• Victor Alvarez, Karl Bringmann, Radu Curticapean, Saurabh Ray:
  Counting crossing-free structures. 61-68
  
• Siu-Wing Cheng, Jiongxin Jin, Man-Kit Lau:
  A fast and simple surface reconstruction algorithm. 69-78
  

Invited talk: sunday afternoon, June 17

• Jane S. Richardson, David C. Richardson:
  Protein molecules in 3D: complex behavior from simple local geometry plus weak interactions. 79-80
  

Monday morning, June 18, before the break

• Marek Eliáý, Jiõí Matouýek:
  Higher-order Erdös: Szekeres theorems. 81-90
  
• Herbert Edelsbrunner, Brittany Terese Fasy, Günter Rote:
  Add isotropic Gaussian kernels at own risk: more and more resilient modes in higher dimensions. 91-100
  
• Anne Driemel, Sariel Har-Peled, Benjamin Raichel:
  On the expected complexity of voronoi diagrams on terrains. 101-110
  
• Hakan Yildiz, Subhash Suri:
  On Klee's measure problem for grounded boxes. 111-120
  

Monday morning, June 18, after the break

• Sariel Har-Peled, Amir Nayyeri, Mohammad R. Salavatipour, Anastasios Sidiropoulos:
  How to walk your dog in the mountains with no magic leash. 121-130
  
• Jeff Erickson, Amir Nayyeri:
  Tracing compressed curves in triangulated surfaces. 131-140
  
• Arnaud de Mesmay, Éric Colin de Verdière:
  Testing graph isotopies on surfaces. 141-150
  
• Anna Gundert, Uli Wagner:
  On laplacians of random complexes. 151-160
  
• Ashwinkumar Badanidiyuru, Robert Kleinberg, Hooyeon Lee:
  Approximating low-dimensional coverage problems. 161-170
  
• Kasper Green Larsen, Huy Le Nguyen:
  Improved range searching lower bounds. 171-178
  
• Ioannis Z. Emiris, Vissarion Fisikopoulos, Christos Konaxis, Luis Mariano Peñaranda:
  An output-sensitive algorithm for computing projections of resultant polytopes. 179-188
  
• Micha Sharir, Adam Sheffer, Emo Welzl:
  Counting plane graphs: perfect matchings, spanning cycles, and Kasteleyn's technique. 189-198
  

Invited talk: monday afternoon, June 18

• Christopher J. Bishop:
  Mappings and meshes. 199-200
  

Tuesday morning, June 19, before the break

• Jens M. Schmidt, Pavel Valtr:
  Cubic plane graphs on a given point set. 201-208
  
• Éric Colin de Verdière, Grégory Ginot, Xavier Goaoc:
  Multinerves and helly numbers of acyclic families. 209-218
  
• Guillermo D. Cañas, Steven J. Gortler:
  Duals of orphan-free anisotropic voronoi diagrams are embedded meshes. 219-228
  
• Jean-Daniel Boissonnat, Ramsay Dyer, Arijit Ghosh:
  Stability of Delaunay-type structures for manifolds: [extended abstract]. 229-238
  

VIa: tuesday morning, June 19, after the break

• Donald Sheehy:
  Linear-size approximations to the vietoris-rips filtration. 239-248
  
• Herbert Edelsbrunner, Michael Kerber:
  Alexander duality for functions: the persistent behavior of land and water and shore. 249-258
  
• Gert Vegter, Amit Chattopadhyay, Chee-Keng Yap:
  Certified computation of planar morse-smale complexes. 259-268
  
• Salman Parsa:
  A deterministic o(m log m) time algorithm for the reeb graph. 269-276
  

VIb: tuesday morning, June 19, after the break

• Kenneth L. Clarkson, Wolfgang Mulzer, C. Seshadhri:
  Self-improving algorithms for coordinate-wise maxima. 277-286
  
• Haim Kaplan, Micha Sharir:
  Finding the maximal empty disk containing a query point. 287-292
  
• Timothy M. Chan:
  Conflict-free coloring of points with respect to rectangles and approximation algorithms for discrete independent set. 293-302
  
• Wolfgang Mulzer, Daniel Werner:
  Approximating Tverberg points in linear time for any fixed dimension. 303-310
  

Invited talk: tuesday afternoon, June 19

• Rien van de Weygaert:
  Tessellation analysis of the cosmic web. 311-312
  

VIIa: wednesday, June 20, before the break

• Yufei Tao:
  Stabbing horizontal segments with vertical rays. 313-322
  
• Peyman Afshani, Lars Arge, Kasper Green Larsen:
  Higher-dimensional orthogonal range reporting and rectangle stabbing in the pointer machine model. 323-332
  
• Nabil H. Mustafa, Saurabh Ray:
  A theorem of bárány revisited and extended. 333-338
  
• Peyman Afshani:
  Improved pointer machine and I/O lower bounds for simplex range reporting and related problems. 339-346
  

VIIb: wednesday, June 20, before the break

• Ciprian Borcea, Ileana Streinu, Shin-ichi Tanigawa:
  Periodic body-and-bar frameworks. 347-356
  
• Nicolas Bonifas, Marco Di Summa, Friedrich Eisenbrand, Nicolai Hähnle, Martin Niemeier:
  On sub-determinants and the diameter of polyhedra. 357-362
  
• Sunil Arya, Guilherme Dias da Fonseca, David M. Mount:
  Optimal area-sensitive bounds for polytope approximation. 363-372
  
• Joseph M. Burdis, Irina A. Kogan:
  Object-image correspondence for curves under central and parallel projections. 373-382
  

VIII: wednesday, June 20, after the break

• Andrew Suk:
  Disjoint edges in complete topological graphs. 383-386
  
• Abhijin Adiga, L. Sunil Chandran:
  Representing a cubic graph as the intersection graph of axis-parallel boxes in three dimensions. 387-396
  
• Bernardo M. Ábrego, Oswin Aichholzer, Silvia Fernández-Merchant, Pedro Ramos, Gelasio Salazar:
  The 2-page crossing number of K_n. 397-404
  
• Jacob Fox, János Pach:
  String graphs and incomparability graphs. 405-414
  

Video session: wednesday afternoon, June 20

• Dror Atariah, Günter Rote:
  Configuration space visualization. 415-416
  
• Fatemeh Abbasinejad, Pushkar Joshi, Nina Amenta:
  Surface patches from unorganized space curves. 417-418
  
• John Christopher Bowers, Ileana Streinu:
  Lang's universal molecule algorithm. 419-420
  
• Johan Hidding, Rien van de Weygaert, Gert Vegter, Bernard J. T. Jones, Monique Teillaud:
  The sticky geometry of the cosmic web. 421-422
  

Last update Mon May 20 22:39:45 2013 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page