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)

• 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
• Introducing VAUCANSON
• Point Integral Method for Solving Poisson-Type Equations on Manifolds from Point Clouds with Convergence Guarantees
• Kinetic Voronoi diagrams and Delaunay triangulations under polygonal distance functions
• An adaptive rectangular mesh administration and refinement technique with application in cancer invasion models
• Algorithms – ESA 2004
• Title not available (Why is that?)
• A Forward Approach to Numerical Data Assimilation
• A Gabriel-Delaunay triangulation of 2D complex fractured media for multiphase flow simulations
• Motion planning via manifold samples
• A probabilistic result on multi-dimensional Delaunay triangulations, and its application to the 2D case
• Parallelized event chain algorithm for dense hard sphere and polymer systems
• Power particles: an incompressible fluid solver based on power diagrams
• High-quality 2D mesh generation without obtuse and small angles
• Accurate surface reconstruction in 3D using two-dimensional parallel cross sections
• Motion Planning Under Uncertainty with Complex Agents and Environments via Hybrid Search
• An improved embedded discrete fracture model and domain connectivity algorithms on 3D unstructured grids
• On the degree of standard geometric predicates for line transversals in 3D
• The Voronoi diagram of three lines
• On the topology of planar algebraic curves
• A simple linear algorithm for computing rectilinear 3-centers
• High Order Discontinuous Galerkin Methods for Elliptic Problems on Surfaces
• Arrangements on parametric surfaces. II: Concretizations and applications
• Exact and efficient construction of Minkowski sums of convex polyhedra with applications
• Topological mesh operators
• Mathematical Modeling of the Human Brain
• Algorithms - ESA 2003
• A parallel implementation of fluid-solid interaction solver using an immersed boundary method
• Polygon decomposition for efficient construction of Minkowski sums
• Exact Minkowksi sums of polyhedra and exact and efficient decomposition of polyhedra into convex pieces
• Towards and open curved kernel
• Hyperelastic membrane modelling based on data-driven constitutive relations
• Title not available (Why is that?)
• An unstructured mesh convergent reaction-diffusion master equation for reversible reactions
• Parallel Geothermal Numerical Model with Fractures and Multi-Branch Wells
• Voronoi diagrams and Delaunay triangulations: ubiquitous siamese twins
• Deferring Dag Construction by Storing Sums of Floats Speeds-Up Exact Decision Computations Based on Expression Dags
• On design and implementation of a generic number type for real algebraic number computations based on expression dags
• Model selection for simplicial approximation
• Iterated snap rounding with bounded drift
• A boundary-partition-based Voronoi diagram of \(d\)-dimensional balls: definition, properties, and applications
• Title not available (Why is that?)
• Two optimization problems for unit disks
• Minimal Geodesics Along Volume-Preserving Maps, Through Semidiscrete Optimal Transport
• Computing the volume of a union of balls
• Soft Subdivision Motion Planning for Complex Planar Robots
• Multi-core Implementations of Geometric Algorithms
• Transformation invariant local element size specification
• A Hyperelastic Two-Scale Optimization Model for Shape Matching
• Generalizing geometric graphs
• 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
• 2-manifold tests for 3D Delaunay triangulation-based surface reconstruction
• Consistently oriented dart-based 3D modelling by means of geometric algebra and combinatorial maps
• A tutorial for designing flexible geometric algorithms
• \((\delta ,\varepsilon)\)-ball approximation of a shape: definition and complexity
• Hypergeometric Functions in Exact Geometric Computation
• Blended barycentric coordinates
• Persistence diagrams with linear machine learning models
• Extending linear finite elements to quadratic precision on arbitrary meshes
• Generalised primal-dual grids for unstructured co-volume schemes
• Chebyshev multivariate polynomial approximation and point reduction procedure
• Parametric Polynomial Preserving Recovery on Manifolds
• Improved upper bounds in the moving sofa problem
• 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
• Implementation of linear minimum area enclosing triangle algorithm. Application note
• Title not available (Why is that?)
• Automatic generation of multiblock decompositions of surfaces
• Poisson-driven seamless completion of triangular meshes
• Subdivision surface fitting to a dense mesh using ridges and umbilics
• Watertight conversion of trimmed CAD surfaces to Clough-Tocher splines
• Tetrahedral meshing via maximal Poisson-disk sampling
• Improved bounds on equilibria solutions in the network design game
• On the effectiveness of the genetic paradigm for polygonization
• Accelerated robust Boolean operations based on hybrid representations
• Shock-conforming mesh generation for aerodynamic analyses at supersonic regimes
• Geometric containers for efficient shortest-path computation
• Parallel computation of alpha complexes for biomolecules
• Computation of the metric average of 2D sets with piecewise linear boundaries
• Building Mathematics-Based Software Systems to Advance Science and Create Knowledge
• Computing equilibria in dynamic models with occasionally binding constraints
• An Algorithm for Optimal Transport between a Simplex Soup and a Point Cloud
• Practical distribution-sensitive point location in triangulations
• Adaptive discontinuous Galerkin methods on surfaces
• Geometrically nonlinear design of compliant mechanisms: topology and shape optimization with stress and curvature constraints
• Deconstructing approximate offsets

This page was built for software: CGAL