NDLI: Proceedings of the twenty-eighth annual symposium on Computational geometry (SoCG '12)

Please wait, while we are loading the content...

On topological changes in the delaunay triangulation of moving points

The point-set embeddability problem for plane graphs

Protein molecules in 3D: complex behavior from simple local geometry plus weak interactions

Higher-order Erdös: Szekeres theorems

How to walk your dog in the mountains with no magic leash

Approximating low-dimensional coverage problems

Mappings and meshes

Cubic plane graphs on a given point set

Linear-size approximations to the vietoris-rips filtration

Self-improving algorithms for coordinate-wise maxima

Tessellation analysis of the cosmic web

Stabbing horizontal segments with vertical rays

Periodic body-and-bar frameworks

Disjoint edges in complete topological graphs

Configuration space visualization

Geometric packing under non-uniform constraints

Algorithmic complexity of finding cross-cycles in flag complexes

Add isotropic Gaussian kernels at own risk: more and more resilient modes in higher dimensions

Tracing compressed curves in triangulated surfaces

Improved range searching lower bounds

Multinerves and helly numbers of acyclic families

Alexander duality for functions: the persistent behavior of land and water and shore

Finding the maximal empty disk containing a query point

Higher-dimensional orthogonal range reporting and rectangle stabbing in the pointer machine model

On sub-determinants and the diameter of polyhedra

Representing a cubic graph as the intersection graph of axis-parallel boxes in three dimensions

Surface patches from unorganized space curves

Computing cartograms with optimal complexity

Counting crossing-free structures

On the expected complexity of voronoi diagrams on terrains

Testing graph isotopies on surfaces

An output-sensitive algorithm for computing projections of resultant polytopes

Duals of orphan-free anisotropic voronoi diagrams are embedded meshes

Certified computation of planar morse-smale complexes

Conflict-free coloring of points with respect to rectangles and approximation algorithms for discrete independent set

A theorem of bárány revisited and extended

Optimal area-sensitive bounds for polytope approximation

The 2-page crossing number of $K_{n}$

Lang's universal molecule algorithm

Approximate bregman near neighbors in sublinear time: beyond the triangle inequality

A fast and simple surface reconstruction algorithm

On Klee's measure problem for grounded boxes

On laplacians of random complexes

Counting plane graphs: perfect matchings, spanning cycles, and Kasteleyn's technique

Stability of Delaunay-type structures for manifolds: [extended abstract]

A deterministic o(m log m) time algorithm for the reeb graph

Approximating Tverberg points in linear time for any fixed dimension

Improved pointer machine and I/O lower bounds for simplex range reporting and related problems

Object-image correspondence for curves under central and parallel projections

String graphs and incomparability graphs

The sticky geometry of the cosmic web

Proceedings of the twenty-eighth annual symposium on Computational geometry (SoCG '12)

Content Provider	ACM Digital Library
Editor	Dey, Tamal Whitesides, Sue
Copyright Year	2012
Abstract	This volume contains the abstracts of the 44 research papers, 4 video presentations, and 3 invited talks scheduled for presentation at the 28th Annual Symposium on Computational Geometry, to be held at the University of North Carolina, Chapel Hill, June 17-20, 2012. There were 126 paper submissions (with 2 withdrawn) among which the program committee selected 44 papers for presentation at the conference. The selection process mainly consisted of two phases. In the review phase, the program committee produced at least 3 reviews for each submitted paper. In many cases, program committee members called upon external subreviewers for assistance. In the deliberation phase, which lasted from January 17 to February 16, the program committee discussed the submitted papers and their reviews extensively, obtaining additional input from experts in some cases. The on-line submission process and the review and deliberation phases were conducted using the electronic tools provided by EasyChair. We acknowledge that the entire complex process, from paper submission to final notification of decisions, was aided significantly by this system. In addition to the paper submissions, six videos were submitted in response to the Call for Videos and Multimedia. All six were reviewed, and four of these were accepted for presentation. The videos use animation and graphics to communicate the behavior of specific algorithms. These proceedings contain a short, 2-page description for each of the videos accepted. The final videos for all accepted contributions will be archived at http://www.computational-geometry.org. In many cases, the papers in these proceedings do not contain full details of all results claimed, due to the 10-page limit for regular submissions. We hope that most of these papers will later appear with full details in refereed journals. Each of the three invited talks is represented in this volume by a 1-page description of the topic, the speaker, and some background references. We hope that this information will provide the reader with the means to explore further. This year, we are taking the initiative to confer three awards: two Best Paper awards and one Best Student Presentation award. The two Best Papers will be selected from the 44 accepted papers by a sub-committee of the program committee, based on the nominations of the program committee and the merits of the research results. The Best Student Presentation award will be determined at the symposium based on input from the attendees at the talks given by students. Student speakers must be authors or co-authors of the papers they present. We hope that all these awards will be seen as encouraging tokens for the authors. We note that this year, as an experiment, the symposium is being held in the mornings over a 4-day period, along with an afternoon series of geometry related events collectively called CG:APT (Computational Geometry: Applications, Practice, and Theory). CG:APT has its own program committee. The aim of holding the symposium together with CG:APT is to welcome a broader group of participants, including graduate students and those working in areas where mutual interaction with computational geometry could prove fruitful.
ISBN	9781450312998
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	2012-06-17
Access Restriction	Subscribed
Content Type	Text
Resource Type	Conference Proceedings

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Proceedings of the twenty-seventh annual symposium on Computational geometry (SoCG '11)

Proceedings of the twenty-sixth annual symposium on Computational geometry (SoCG '10)

Proceedings of the twenty-ninth annual symposium on Computational geometry (SoCG '13)

Proceedings of the thirtieth annual symposium on Computational geometry (SOCG'14)

Proceedings of the eighth annual symposium on Computational geometry (SCG '92)

Proceedings of the twenty-fifth annual symposium on Computational geometry (SCG '09)

Proceedings of the twenty-third annual symposium on Computational geometry (SCG '07)

Proceedings of the twenty-fourth annual symposium on Computational geometry (SCG '08)

Proceedings of the twenty-second annual symposium on Computational geometry (SCG '06)

Proceedings of the twenty-eighth annual symposium on Computational geometry (SoCG '12)

Similar Documents

Proceedings of the twenty-seventh annual symposium on Computational geometry (SoCG '11)

Proceedings of the twenty-sixth annual symposium on Computational geometry (SoCG '10)

Proceedings of the twenty-ninth annual symposium on Computational geometry (SoCG '13)

Proceedings of the thirtieth annual symposium on Computational geometry (SOCG'14)

Proceedings of the eighth annual symposium on Computational geometry (SCG '92)

Proceedings of the twenty-fifth annual symposium on Computational geometry (SCG '09)

Proceedings of the twenty-third annual symposium on Computational geometry (SCG '07)

Proceedings of the twenty-fourth annual symposium on Computational geometry (SCG '08)

Proceedings of the twenty-second annual symposium on Computational geometry (SCG '06)

Proceedings of the twenty-eighth annual symposium on Computational geometry (SoCG '12)