Computational geometry algorithms library
By Pierre Alliez, Andreas Fabri, Efi Fogel. SIGGRAPH Classes, 2008
700 citations recorded by the source corpus.
Subfields: Computational Mechanics, Computer Graphics and Computer-Aided Design
View Paper: https://www.semanticscholar.org/paper/3a8701feb22b5eb8a6a3386546fcaeb6d125fc46
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Computational Mechanics
- Christian Häne
- Marc Pollefeys
- Brian Curless
- Susan A. Murphy
- S. M. Seitz
- Michael H. Bowling
- Daniel J. Lizotte
- Richard Szeliski
In Computer Graphics and Computer-Aided Design
- Marc Pollefeys
- Christian Häne
- Yasutaka Furukawa
- S. M. Seitz
- Andreas Geiger
- Brian Curless
- Richard Szeliski
- Nikolay Savinov
Citations in the corpus
- Linear Fitted-Q Iteration with Multiple Reward Functions (2012, methodology): “We take advantage of CGAL, the Computational Geometry Algorithms Library (CGAL, 2011), which is designed specifically to avoid these problems.”
- Class Specific 3D Object Shape Priors Using Surface Normals (2014, background): “The half spaces hs ∈ Hs are defined by a normal direction n ∈ S ⊂ S2 and distances to the origin dns .”
- Reconstructing building interiors from images (2009, background): “Indeed , there is a family of surfaces between these two that”
- Topological Data Analysis (2012, background): “The triangle is in the Delaunay complex because the Voronoi regions of its three vertices intersect in the white Voronoi vertex.”