Skip to search formSkip to main contentSkip to account menu

Symposium on Computational Geometry

The Annual Symposium on Computational Geometry (SoCG) is an academic conference in computational geometry. It was founded in 1985, and in most but… 
Wikipedia (opens in a new tab)

Related topics

Related topics

27 relations
ACM SIGACTDBL-BrowserEmo WelzlEuclidean shortest path

Broader (1)

Computational geometry

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
Behavioral Non-portability in Scientific Numeric Computing
The precise semantics of floating-point arithmetic programs depends on the execution platform, including the compiler and the… 
2014
2014
Proceedings of the thirtieth annual symposium on Computational geometry
The research papers, the abstracts of invited talks, and the descriptions of videos and multimedia presentations in this volume… 
2009
2009
Escaping offline searchers and isoperimetric theorems
Review
2007
Review
2007
Proceedings of the twenty-third annual symposium on Computational geometry
This volume collects the research papers and the short descriptions of the video presentations of the 23rd Annual Symposium on… 
Review
2006
Review
2006
Proceedings of the twenty-second annual symposium on Computational geometry
This volume collects the research papers and the short descriptions of the video/multimedia presentations of the 22nd Annual… 
Review
2005
Review
2005
Proceedings of the twenty-first annual symposium on Computational geometry
This volume collects the research papers and the short descriptions of the video/multimedia presentations of the 21st Annual… 
2005
2005
Accurate and Efficient Similarity Search on 3D Objects Using Point Sampling, Redundancy, and Proportionality
With fast evolving resources for 3D objects such as the Protein Data Bank (PDB) or the World Wide Web, new techniques, so-called… 
2004
2004
Proceedings of the twentieth annual symposium on Computational geometry
A twentieth anniversary is a cause for celebration!This proceedings of the Twentieth ACM Annual Symposium on Computational… 
Highly Cited
1998
Highly Cited
1998
Theorem proving with the real numbers
  • J. Harrison
  • CPHC/BCS distinguished dissertations
  • 1998
  • Corpus ID: 38754316
The Distinguished Dissertation series is published on behalf of the Conference of Professors and Heads of Computing and the… 
Review
1995
Review
1995
The Object Complexity Modelfor Hidden-Surface
We de ne a new complexity measure, called object complexity, for hidden-surface elimination algorithms. This model is more… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)