CGAL

swMATH118WikidataQ2718971 ScholiaQ2718971MaRDI QIDQ12888FDOQ12888

Author name not available (Why is that?)

Described by source

• CGAL – Reliable Geometric Computing for Academia and Industry
• On the design of CGAL a computational geometry algorithms library
• Exact geometric and algebraic computations in CGAL
• CGAL Arrangements and their applications. A step-by-step guide

Cited In (only showing first 100 items - show all)

• A generic software design for Delaunay refinement meshing
• Patient-specific vascular NURBS modeling for isogeometric analysis of blood flow
• Title not available (Why is that?)
• Optimality Conditions and Error Analysis of Semilinear Elliptic Control Problems with $L^1$ Cost Functional
• Second Order Analysis of Geometric Functionals of Boolean Models
• Computing 3D Periodic Triangulations
• Open-source immersogeometric analysis of fluid-structure interaction using FEniCS and tIGAr
• The visibility--voronoi complex and its applications
• The meshing framework ViennaMesh for finite element applications
• An efficient algorithm for the stratification and triangulation of an algebraic surface
• Fast methods for computing centroidal Voronoi tessellations
• The \texttt{deal.II} library, version 9.4
• The numerical solution of Newton's problem of least resistance
• An Elimination Method for Solving Bivariate Polynomial Systems: Eliminating the Usual Drawbacks
• CGALmesh: a generic framework for Delaunay mesh generation
• Faster geometric algorithms via dynamic determinant computation
• The visibility-Voronoi complex and its applications
• Improved Implementation of Point Location in General Two-Dimensional Subdivisions
• Recent progress in exact geometric computation
• A stabilized Nitsche fictitious domain method for the Stokes problem
• Exact Fast Parallel Intersection of Large 3-D Triangular Meshes
• The computational geometry algorithms library CGAL
• Visualizing and exploring planar algebraic arrangements
• Numerical integration of discontinuities on arbitrary domains based on moment fitting
• Title not available (Why is that?)
• Molecular dynamics in arbitrary geometries: Parallel evaluation of pair forces
• Delaunay triangulations of closed Euclidean \(d\)-orbifolds
• Efficient and robust persistent homology for measures
• Adaptive tetrahedral mesh generation by constrained Delaunay refinement
• Approximation of Sparse Controls in Semilinear Elliptic Equations
• An efficient, exact, and generic quadratic programming solver for geometric optimization
• Centroidal Voronoi tessellation in universal covering space of manifold surfaces
• Computing convex hulls and counting integer points with \texttt{polymake}
• Far-field reflector problem and intersection of paraboloids
• \(hp\)-boundary layer mesh sequences with applications to shell problems
• Algorithm 976
• Perturbations for Delaunay and weighted Delaunay 3D triangulations
• Theory of Real Computation According to EGC
• Analytic Root Clustering: A Complete Algorithm Using Soft Zero Tests
• THE SMALLEST ENCLOSING BALL OF BALLS: COMBINATORIAL STRUCTURE AND ALGORITHMS
• Efficient Random-Walk Methods for Approximating Polytope Volume
• Efficient Implementation of Finite Element Methods on Nonmatching and Overlapping Meshes in Three Dimensions
• Arrangement computation for planar algebraic curves
• Efficient and accurate simulations of deformable particles immersed in a fluid using a combined immersed boundary lattice Boltzmann finite element method
• Approximation of sparse controls in semilinear equations by piecewise linear functions
• Title not available (Why is that?)
• Title not available (Why is that?)
• DEpthLAUNAY
• Algorithm 872
• On the complexity of computing with planar algebraic curves
• Exact algorithms and software in optimization and polyhedral computation
• Rational Points on the Unit Sphere
• Translational packing of arbitrary polytopes
• Algorithm 966
• Algorithms – ESA 2005
• Mechanical modeling of collective cell migration: an agent-based and continuum material approach
• Optimal randomized incremental construction for guaranteed logarithmic planar point location
• The Design of Core 2: A Library for Exact Numeric Computation in Geometry and Algebra
• Exact and approximate construction of offset polygons
• Title not available (Why is that?)
• The design and implementation of panar maps in CGAL
• Consistent digital rays
• Certifying algorithms
• Convex combinations for diffusion schemes
• Discontinuous finite element solution of the radiation diffusion equation on arbitrary polygonal meshes and locally adapted quadrilateral grids
• Computing the conjugate of convex piecewise linear-quadratic bivariate functions
• The design of the Boost interval arithmetic library
• Classroom examples of robustness problems in geometric computations
• The multi-facility median problem with Pos/Neg weights on general graphs
• Robust Geometry Estimation Using the Generalized Voronoi Covariance Measure
• \texttt{ColDICE}: A parallel Vlasov-Poisson solver using moving adaptive simplicial tessellation
• Design of the CGAL 3D spherical kernel and application to arrangements of circles on a sphere
• A weighted \(k\)-nearest neighbor density estimate for geometric inference
• Improvements of explicit crack surface representation and update within the generalized finite element method with application to three-dimensional crack coalescence
• Geometric approximation algorithms
• On the topology of real algebraic plane curves
• An oracle-based, output-sensitive algorithm for projections of resultant polytopes
• The smallest enclosing ball of balls
• Packing spherical discrete elements for large scale simulations
• Title not available (Why is that?)
• A topological measurement of protein compressibility
• LOOK: A lazy object-oriented kernel design for geometric computation
• Exact Minkowski sums of polygons with holes
• FastJet user manual (for version 3.0.2)
• Exact medial axis computation for triangulated solids with respect to piecewise linear metrics
• OpenFlipper: an open source geometry processing and rendering framework
• Branch-and-price for staff rostering: an efficient implementation using generic programming and nested column generation
• Euclidean Voronoi diagrams of 3D spheres and applications to protein structure analysis
• A trilinear immersed finite element method for solving the electroencephalography forward problem
• Multilevel interpolation of scattered data using \(\mathcal{H}\)-matrices
• Exact Minkowksi Sums of Polyhedra and Exact and Efficient Decomposition of Polyhedra in Convex Pieces
• Title not available (Why is that?)
• Fully scalable implementation of a volume coupling scheme for the modeling of multiscale materials
• Parallel geometric algorithms for multi-core computers
• Parallel geometric algorithms for multi-core computers
• Soft subdivision motion planning for complex planar robots
• An adaptable and extensible geometry kernel
• Two-phase free-surface fluid dynamics on moving domains
• Polyhedral and algebraic methods in computational geometry
• Almost-Delaunay simplices: Robust neighbor relations for imprecise 3D points using CGAL

This page was built for software: CGAL