ACM SoCG 2012 Accepted Papers and Videos
(papers in random order)
Andrew Suk. Disjoint edges in complete topological graphs
Marek Elias and Jiri Matousek. Higher-order Erdos–Szekeres theorems
Natan Rubin. On topological changes in the Delaunay triangulation of moving points
Joseph M. Burdis and
Irina A. Kogan. Object-image correspondence for curves under central and parallel projections
Therese Biedl and Martin Vatshelle. The point-set embeddability problem for plane graphs
Abhijin Adiga and Sunil Chandran. Representing a cubic graph as the intersection graph of axis-parallel boxes in three dimensions
Sariel Har-Peled, Amir Nayyeri, Mohammad Salavatipour and
Anastasios Sidiropoulos. How to Walk Your Dog in the Mountains with No Magic Leash
Kenneth Clarkson, Wolfgang Mulzer and C. Seshadhri. Self-improving Algorithms for Coordinate-wise Maxima
Don Sheehy. Linear-Size Approximations to the Vietoris-Rips Filtration
Herbert Edelsbrunner and
Michael Kerber. Alexander Duality for Functions: the Persistent Behavior of Land and Water and Shore
Eric Colin De Verdière, Grégory Ginot and
Xavier Goaoc. Multinerves and Helly numbers of acyclic families
Guillermo D. Canas and Steven Gortler. Duals of Orphan-Free Anisotropic Voronoi Diagrams are Triangulations
Gert Vegter,
Chee Yap and Amit Chattopadhyay. Certified Computation of planar Morse-Smale Complexes
Jeff Erickson and Amir Nayyeri. Tracing Compressed Curves in Triangulated Surfaces
Michal Adamaszek and Juraj Stacho. Algorithmic complexity of finding cross-cycles in flag complexes
Yufei Tao. Stabbing Horizontal Segments with Vertical Rays
Siu-Wing Cheng, Jiongxin Jin and Man-Kit Lau. A Fast and Simple Surface Reconstruction Algorithm
Nabil Mustafa and Saurabh Ray. A theorem of Barany revisited and extended
Peyman Afshani. Improved Pointer Machine and I/O Lower Bounds for Simplex Range Reporting and Related Problems
Salman Parsa. A Deterministic O(m log m) Time Algorithm for the Reeb Graph
Haim Kaplan and Micha Sharir. Finding the Maximal Empty Disk Containing a Query Point
Timothy M. Chan. Conflict-Free Coloring of Points with Respect to Rectangles and Approximation Algorithms for Discrete Independent Set
Anna Gundert and Uli Wagner. On Laplacians of Random Complexes
Hakan Yıldız and Subhash Suri. On Klee’s Measure Problem on Grounded Boxes
Ciprian Borcea,
Ileana Streinu and Shin-Ichi Tanigawa. Periodic body-and-bar frameworks
Janos Pach and Jacob Fox. String graphs and incomparability graphs
Videos
The videos and links to accompanying material can be found at http://www.computational-geometry.org/SoCG-videos/socg12video/
====
Configuration Space Visualization
Dror Atariah; Günter Rote
====
Surface Patches from Unorganized Space Curves
Fatemeh Abbasinejad; Pushkar Joshi; Nina Amenta
====
Lang’s Universal Molecule Algorithm
John C. Bowers; Ileana Streinu
====
The Sticky Geometry of the Cosmic Web
Johan Hidding; Rien van de Weygaert; Gert Vegter; Bernard J.T. Jones; Monique Teillaud
University Operator: (919) 962-2211 | © 2021 The University of North Carolina at Chapel Hill |