Cited in
(only showing first 100 items - show all)- Rational points on the unit sphere. Approximation complexity and practical constructions
- Persistence modules on commutative ladders of finite type
- Discretization of functionals involving the Monge-Ampère operator
- A deterministic algorithm for isolating real roots of a real polynomial
- scientific article; zbMATH DE number 1800031 (Why is no real title available?)
- Contributing vertices-based Minkowski sum computation of convex polyhedra
- A trilinear immersed finite element method for solving the electroencephalography forward problem
- Multilevel interpolation of scattered data using \(\mathcal{H}\)-matrices
- Computational modeling of non-linear diffusion in cardiac electrophysiology: a novel porous-medium approach
- Implementing straight skeletons with exact arithmetic: challenges and experiences
- Surface reconstruction via cooperative evolutions
- Modeling continuous grain crushing in granular media: a hybrid peridynamics and physics engine approach
- scientific article; zbMATH DE number 1947415 (Why is no real title available?)
- Generalizing geometric graphs
- Boolean operations on 3D selective Nef complexes: data structure, algorithms, optimized implementation and experiments
- 3/4-discrete optimal transport
- Anisotropic Delaunay meshes of surfaces
- The computational geometry algorithms library CGAL
- Rods and Rings: Soft Subdivision Planner for R^3 x S^2.
- Exact Minkowksi Sums of Polyhedra and Exact and Efficient Decomposition of Polyhedra in Convex Pieces
- Fully scalable implementation of a volume coupling scheme for the modeling of multiscale materials
- Consistently oriented dart-based 3D modelling by means of geometric algebra and combinatorial maps
- Lagrangian/Eulerian numerical methods for fluid interface advection on unstructured meshes
- A generic software design for Delaunay refinement meshing
- 2-manifold tests for 3D Delaunay triangulation-based surface reconstruction
- An algorithm for optimal transport between a simplex soup and a point cloud
- Patient-specific vascular NURBS modeling for isogeometric analysis of blood flow
- Parallel geometric algorithms for multi-core computers
- A language for generic programming in the large
- scientific article; zbMATH DE number 2009914 (Why is no real title available?)
- Lexicographic optimal homologous chains and applications to point cloud triangulations
- Soft subdivision motion planning for complex planar robots
- scientific article; zbMATH DE number 2107521 (Why is no real title available?)
- Mesh sizing with additively weighted Voronoi diagrams
- Parallel geometric algorithms for multi-core computers
- An adaptable and extensible geometry kernel
- A tutorial for designing flexible geometric algorithms
- Open-source immersogeometric analysis of fluid-structure interaction using FEniCS and tIGAr
- An efficient algorithm for the stratification and triangulation of an algebraic surface
- Multitissue tetrahedral image-to-mesh conversion with guaranteed quality and fidelity
- Delaunay triangulation of imprecise points in linear time after preprocessing
- \((\delta ,\varepsilon)\)-ball approximation of a shape: definition and complexity
- Multithread parallelization of LEPP-bisection algorithms
- The numerical solution of Newton's problem of least resistance
- Computing 3D Periodic Triangulations
- Polyhedral and algebraic methods in computational geometry
- The meshing framework ViennaMesh for finite element applications
- Error control and adaptivity for the finite cell method
- Two-phase free-surface fluid dynamics on moving domains
- Surface reconstruction using umbrella filters
- Fast methods for computing centroidal Voronoi tessellations
- The \texttt{deal.II} library, version 9.4
- Vector-Based Morphological Operations on Polygons Using Straight Skeletons for Digital Pathology
- A finite element method of the self-consistent field theory on general curved surfaces
- Using machine learning for model benchmarking and forecasting of depletion-induced seismicity in the Groningen gas field
- Blended barycentric coordinates
- Effective computational geometry for curves and surfaces
- scientific article; zbMATH DE number 1956209 (Why is no real title available?)
- Almost-Delaunay simplices: Robust neighbor relations for imprecise 3D points using CGAL
- Persistence diagrams with linear machine learning models
- Guaranteed quality tetrahedral Delaunay meshing for medical images
- Extending linear finite elements to quadratic precision on arbitrary meshes
- CGALmesh: a generic framework for Delaunay mesh generation
- Competing output-sensitive frame algorithms
- Accelerating smooth molecular surface calculation
- scientific article; zbMATH DE number 1639663 (Why is no real title available?)
- Generalised primal-dual grids for unstructured co-volume schemes
- When Lipschitz Walks Your Dog: Algorithm Engineering of the Discrete Fréchet Distance under Translation
- The smallest enclosing ball of balls: combinatorial structure and algorithms
- Chebyshev multivariate polynomial approximation and point reduction procedure
- Persistent homology and the upper box dimension
- The minimum area spanning tree problem: formulations, Benders decomposition and branch-and-cut algorithms
- Introducing VAUCANSON
- Sweeping and Maintaining Two-Dimensional Arrangements on Surfaces: A First Step
- Faster geometric algorithms via dynamic determinant computation
- Robust geometric computing in motion
- The visibility-Voronoi complex and its applications
- An Assignment Procedure from Particles to Mesh that Preserves Field Values
- Reappraising the distribution of the number of edge crossings of graphs on a sphere
- Fast detection of degenerate predicates in free space construction
- Improved upper bounds in the moving sofa problem
- Point Integral Method for Solving Poisson-Type Equations on Manifolds from Point Clouds with Convergence Guarantees
- Exact, efficient, and complete arrangement computation for cubic curves
- P2MAT-NET: learning medial axis transform from sparse point clouds
- Holes and dependences in an ordered complex
- Representing implicit surfaces satisfying Lipschitz conditions by 4-dimensional point sets
- The visibility-Voronoi complex and its applications
- Implementation of linear minimum area enclosing triangle algorithm. Application note
- Kinetic Voronoi diagrams and Delaunay triangulations under polygonal distance functions
- Succinct representations of planar maps
- Table based detection of degenerate predicates in free space construction
- A stabilized Nitsche fictitious domain method for the Stokes problem
- Complete, Exact and Efficient Implementation for Computing the Adjacency Graph of an Arrangement of Quadrics
- Recent progress in exact geometric computation
- An adaptive rectangular mesh administration and refinement technique with application in cancer invasion models
- scientific article; zbMATH DE number 6954683 (Why is no real title available?)
- Load-Balancing for Parallel Delaunay Triangulations
- Automatic generation of multiblock decompositions of surfaces
- Introduction to geometric computing
- Poisson-driven seamless completion of triangular meshes
This page was built for software: CGAL
