CGAL
From MaRDI portal
Cited in
(only showing first 100 items - show all)- Translational packing of arbitrary polytopes
- Provably correct reconstruction of surfaces from sparse noisy samples
- On the degree of standard geometric predicates for line transversals in 3D
- The Voronoi diagram of three lines
- Delaunay triangulation of imprecise points in linear time after preprocessing
- An efficient algorithm for the stratification and triangulation of an algebraic surface
- FEView
- GEANT4
- gmp
- GrAL
- LEDA
- mri2fem
- orderkdelaunay
- rhomboidtiling
- PALP
- UnitDiskCoverAlgorithms
- RAGlib
- ParMoonolith
- AVATREE
- Preconditioners.jl
- MeshIO.jl
- NBODY6
- Scilab
- SingSurf
- STAPL
- STRIPACK
- SYNAPS
- XFEM
- GeoBench
- DeWall
- LOOK
- EXACUS
- GUIDE
- TPIE
- A tutorial for designing flexible geometric algorithms
- Triangulations in CGAL
- LOOK: A lazy object-oriented kernel design for geometric computation
- Smooth surface reconstruction via natural neighbour interpolation of distance functions
- Two optimization problems for unit disks
- Persistence diagrams with linear machine learning models
- Improved upper bounds in the moving sofa problem
- TetGen
- JavaView
- Boost C++ Libraries
- Geomview
- Edgebreaker
- Subdivision surface fitting to a dense mesh using ridges and umbilics
- Poisson-driven seamless completion of triangular meshes
- Watertight conversion of trimmed CAD surfaces to Clough-Tocher splines
- Tetrahedral meshing via maximal Poisson-disk sampling
- PBGL
- A linear-time algorithm to compute the conjugate of convex piecewise linear-quadratic bivariate functions
- Accelerated robust Boolean operations based on hybrid representations
- Shock-conforming mesh generation for aerodynamic analyses at supersonic regimes
- Qhull
- FastJet user manual (for version 3.0.2)
- Computation of the metric average of 2D sets with piecewise linear boundaries
- An exact algorithm for the minimum dilation triangulation problem
- azove
- lrs
- TOPCOM
- barvinok
- Overview of shelling for 2-manifold surface reconstruction based on 3D Delaunay triangulation
- Practical and efficient algorithms for the geometric hitting set problem
- DEpthLAUNAY
- core 2
- MAPC
- Differentiation and regularity of semi-discrete optimal transport with respect to the parameters of the discrete measure
- Consistently oriented dart-based 3D modelling by means of geometric algebra and combinatorial maps
- \((\delta ,\varepsilon)\)-ball approximation of a shape: definition and complexity
- Miniball
- High-quality 2D mesh generation without obtuse and small angles
- Extending linear finite elements to quadratic precision on arbitrary meshes
- GTS
- On convergence rate of a rectangular partition based global optimization algorithm
- Improved bounds on equilibria solutions in the network design game
- Recent progress in exact geometric computation
- CImg
- Methods for mining co-location patterns with extended spatial objects
- Vaucanson
- Eigen
- Open Dynamics Engine
- SLEEF
- VRONI
- MESA
- A probabilistic result on multi-dimensional Delaunay triangulations, and its application to the 2D case
- GeoWin
- tess3
- LSMLIB
- Reporting intersections among thick objects.
- Axel
- G23FM
- Netgen
- YADE
- MCSTL
- Voronoi diagrams and Delaunay triangulations: ubiquitous siamese twins
- A weighted \(k\)-nearest neighbor density estimate for geometric inference
- Qsplat
- MESH
- Metro
This page was built for software: CGAL
