Symposium on Geometry Processing

Symposium on Geometry Processing (SGP) is an annual symposium hosted by the European Association For Computer Graphics (Eurographics) and primarily organized by Leif Kobbelt. The goal of the symposium is to present and discuss new research ideas and results in geometry processing. The conference is geared toward the discussion of mathematical foundations and practical algorithms for the processing of complex geometric data sets, ranging from acquisition and editing all the way to animation, transmission and display. As such, it draws on many disciplines spanning pure and applied mathematics, computer science, and engineering. The proceedings of SGP appear in a special issue of the Computer Graphics Forum, the International Journal of the Eurographics Association. Since 2011, SGP has held a two-day "graduate school" preceding the conference, typically composed of workshop-style courses from subfield experts.

Venues

YearLocationLinksDateSubmittedAcceptedRate[1]
2020 Utrecht, The Netherlands Webpage Papers 6-8 Jul
2019 Milan, Italy Webpage Papers 8-10 Jul 49 15 30%
2018 Paris, France Webpage Papers 9-11 Jul 67 20 29%
2017 London, UK Webpage Papers 1-5 Jul 50 17 34%
2016 Berlin, Germany Webpage Papers 20-24 Jul 81 26 32%
2015Graz, AustriaWebpage Papers6-8 Jul722231%
2014Cardiff, UKWebpage Papers9-11 Jul892831%
2013Genova, ItalyWebpage Papers3-5 Jul562341%
2012Tallinn, EstoniaWebpage Papers16-18 Jul722535%
2011Lausanne, SwitzerlandWebpage Papers20-22 Jul772330%
2010Lyon, FranceWebpage Papers5-7 Jul702434%
2009Berlin, GermanyWebpage Papers15-17 Jul752635%
2008Copenhagen, DenmarkWebpage Papers2-4 Jul962324%
2007Barcelona, SpainWebpage Papers4-6 Jul742128%
2006Cagliari, SardiniaWebpage Papers26-28 Jun792127%
2005Vienna, AustriaWebpage Papers4-6 Jul872225%
2004Nice, FranceWebpage Papers8-10 Jul852529%
2003Aachen, GermanyWebpage Papers23-25 Jun722535%

Best Paper Awards

Each year up to three papers are recognized with a Best Paper Award.[2]

YearAuthorTitle
2019 Yan and Schaefer A Family of Barycentric Coordinates for Co-Dimension 1 Manifolds with Simplicial Facets
Shoham et al. Hierarchical Functional Maps between Subdivision Surfaces
2018 Ye et al. A unified discrete framework for intrinsic and extrinsic Dirac operators for geometry processing
Huang et al. QuadFlow: A Scalable and Robust Method for Quadrangulation
Comino et al. Sensor-aware Normal Estimation for Range Scan Point Clouds
2017 Hamid Laga and Hedi Tabia Modeling and Exploring Co-Variations in the Geometry and Configuration of Man-made 3D Shape Families
Max Budninskiy et al. Spectral Affine-Kernel Embeddings
Sebstian Claici et al. Isometry-Aware Preconditioning for Mesh Parameterization
2016 Behrend Heeren et al. Splines in the Space of Shells
Or Litany et al. Non-Rigid Puzzles
Zeyun Shi et al. Symmetry and Orbit Detection via Lie-Algebra Voting
2015Itay Kezurer et al.Tight Relaxation of Quadratic Matching
Andrea Tagliasacchi et al.Robust Articulated-ICP for Real-Time Hand Tracking
2014Olga Diamanti et al.Designing N-PolyVector Fields with Complex Polynomials
Nicolas Mellado et al.Super 4PCS: Fast Global Pointcloud Registration via Smart Indexing
2013Qixing Huang and Leonidas GuibasConsistent Shape Maps via Semidefinite Programming
Simon Giraudot et al.Noise-Adaptive Shape Reconstruction from Raw Point Sets
Marcel Campen et al.Practical Anisotropic Geodesy
2012Ofir Weber et al.Computing Extremal Quasiconformal Maps
Amir VaxmanModeling Polyhedral Meshes with Affine Maps
Maik Schulze et al.Stream Surface Parametrization by Flow-Orthogonal Front Lines
2011Klaus Hildebrandt and Konrad PolthierOn approximation of the Laplace–Beltrami operator and the Willmore energy of surfaces
Ofir Weber et al.A Complex View of Barycentric Mappings
Raif M. RustamovMultiscale Biharmonic Kernels
2010Keenan Crane et al.Trivial Connections on Discrete Surfaces
Mirela Ben-Chen et al.On Discrete Killing Vector Fields and Patterns on Surfaces
Marcel Campen and Leif KobbeltPolygonal Boundary Evaluation of Minkowski Sums and Swept Volumes
2009Jian Sun et al.A Concise and Provably Informative Multi-scale Signature Based on Heat Diffusion
Fatemeh Abbasinejad et al.Rotating Scans for Systematic Error Removal
Ming Chuang et al.Estimating the Laplace-Beltrami Operator by Restricting 3D Functions
2008Ramsay Dyer et al.Surface sampling and the intrinsic Voronoi diagram
Sebastian Martin et al.Polyhedral Finite Elements Using Harmonic Basis Functions (student paper)
Maks Ovsjanikov et al.Global Intrinsic Symmetries of Shapes (student paper)
2007Alliez et al.Voronoi-based Variational Reconstruction for Unoriented Point Sets
2006Botsch et al.PriMo: Coupled Prisms for Intuitive Surface Modeling

SGP Software Award

Each year, since 2011, SGP also awards a prize for the best freely available software related to or useful for geometry processing.[2]

YearAuthorTitle
2019 Rohan Sawhney and Keenan Crane Boundary First Flattening
2018 Tyson Brochu and Robert Bridson El Topo
2017Nicolas Mellado, Dror Aiger, Niloy J. MitraSuper4PCS
2017Paolo CignoniMeshLab
2016David Coeurjolly, Jacques-Olivier Lachaud et al.DGtal
2015Alec Jacobson, Daniele Panozzo, Olga Diamanti et al.libigl
2014Marco AtteneMeshFix
2013Benoît Jacob and Gael GuennebaudEigen
2012Hang SiTetGen
2011Michael Kazhdan and Matthew BolithoPoisson Surface Reconstruction

SGP Dataset Award

Each year, since 2016, SGP also awards a prize for the best freely available dataset related to or useful for geometry processing.

YearAuthorTitle
2019 Sebastian Koch, Albert Matveev, Zhongshi Jiang, Francis Williams, Alexey Artemov, Evgeny Burnaev, Marc Alexa, Denis Zorin, Daniele Panozzo ABC Dataset
2018 Angel X. Chang, Thomas Funkhouser, Leonidas Guibas, Pat Hanrahan, Qixing Huang, Zimo Li, Silvio Savarese, Manolis Savva, Shuran Song, Hao Su, Jianxiong Xiao, Li Yi, and Fisher Yu ShapeNet
2017Qingnan Zhou, Alec JacobsonThingi10k
2016Federica Bogo, Javier Romero, Matthew Loper, Michael J. BlackFAUST


gollark: Geoengineering would be good if it's workable, although nuclear is just pretty good generally even if it will not fix everything instantly.
gollark: A significant amount of energy use is electricity. If we make that cleanly, that is a significant step toward reducing climate change, and you can then throw cheap electricity at other problems.
gollark: "This wouldn't fix literally all problems at once so why even do it?"
gollark: Since a lot of them are.
gollark: No, it's useful before then.

References

  1. "Resource for Computer Graphics - Ke-Sen Huang's Home Page". kesen.realtimerendering.com. Retrieved 2016-08-07.
  2. "Symposium on Geometry Processing - Awards". awards.geometryprocessing.org.


This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.