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 deterministic algorithm for isolating real roots of a real polynomial
• The computational geometry algorithms library CGAL
• Contributing vertices-based Minkowski sum computation of convex polyhedra
• Boolean operations on 3D selective Nef complexes: data structure, algorithms, optimized implementation and experiments
• A language for generic programming in the large
• Delaunay triangulation of imprecise points in linear time after preprocessing
• Multithread parallelization of LEPP-bisection algorithms
• Effective computational geometry for curves and surfaces
• Accelerating smooth molecular surface calculation
• Competing output-sensitive frame algorithms
• Sweeping and Maintaining Two-Dimensional Arrangements on Surfaces: A First Step
• Exact, efficient, and complete arrangement computation for cubic curves
• Succinct representations of planar maps
• Complete, Exact and Efficient Implementation for Computing the Adjacency Graph of an Arrangement of Quadrics
• Centroidal Voronoi diagrams for isotropic surface remeshing
• Locking-free numerical methods for nearly incompressible elasticity and incompressible flow on moving domains
• Provably correct reconstruction of surfaces from sparse noisy samples
• Geometric data structures for computer graphics.
• Title not available (Why is that?)
• Free-surface fluid dynamics on moving domains
• Optimizing the Layout of Proportional Symbol Maps: Polyhedra and Computation
• Modeling wildfire propagation with Delaunay triangulation and shortest path algorithms
• Triangulations in CGAL
• Computing a canonical polygonal schema of an orientable triangulated surface
• Title not available (Why is that?)
• Methods for mining co-location patterns with extended spatial objects
• Algorithms – ESA 2005
• CONTROLLED PERTURBATION FOR ARRANGEMENTS OF CIRCLES
• Coupled bulk-surface free boundary problems arising from a mathematical model of receptor-ligand dynamics
• A linear-time algorithm to compute the conjugate of convex piecewise linear-quadratic bivariate functions
• Approximating the pathway axis and the persistence diagrams for a collection of balls in 3-space
• Programming with C++ concepts
• Monte Carlo maximum likelihood circle fitting using circular density functions
• Smooth surface reconstruction via natural neighbour interpolation of distance functions
• Computing the arrangement of circles on a sphere, with applications in structural biology
• Fully peer-to-peer virtual environments with 3D Voronoi diagrams
• Selecting radiotherapy dose distributions by means of constrained optimization problems
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Robust, Generic and Efficient Construction of Envelopes of Surfaces in Three-Dimensional Spaces
• A pore-scale method for hydromechanical coupling in deformable granular media
• A low arithmetic-degree algorithm for computing proximity graphs
• A generic and flexible framework for the geometrical and topological analysis of (algebraic) surfaces
• Computing the Voronoi cells of planes, spheres and cylinders in \(\mathbb{R}^3\)
• An analysis and comparison of parameterization-based computation of differential quantities for discrete surfaces
• On the topology of planar algebraic curves
• Anisotropic mesh generation methods based on ACVT and natural metric for anisotropic elliptic equation
• Exact and efficient construction of Minkowski sums of convex polyhedra with applications
• Arrangements on parametric surfaces. I: General framework and infrastructure
• Practical and efficient algorithms for the geometric hitting set problem
• A Petri net based approach for multi-robot path planning
• On a global optimization algorithm for bivariate smooth functions
• Formal study of functional orbits in finite domains
• Efficient mesh optimization schemes based on optimal Delaunay triangulations
• A general approach to the analysis of controlled perturbation algorithms
• Planar lower envelope of monotone polygonal chains
• Interleaving Delaunay refinement and optimization for 2D triangle mesh generation
• The Offset Filtration of Convex Objects
• Parallelization alternatives and their performance for the convex hull problem
• Computing intersections between non-compatible curves and finite elements
• Constructing two-dimensional Voronoi diagrams via divide-and-conquer of envelopes in space
• Robustly and efficiently computing algebraic curves and surfaces
• Anisotropic Delaunay mesh generation
• Adaptive skin meshes coarsening for biomolecular simulation
• An immersed interface method for acoustic wave equations with discontinuous coefficients in complex geometries
• Exact symbolic-numeric computation of planar algebraic curves
• Hypermap specification and certified linked implementation using orbits
• Advanced programming techniques applied to CGAL's arrangement package
• Anisotropic mesh generation and adaptation for quads using the \(L_p\)-CVT method
• CONSTRAINED QUADRILATERAL MESHES OF BOUNDED SIZE
• Computing the partial conjugate of convex piecewise linear-quadratic bivariate functions
• Discretization of functionals involving the Monge-Ampère operator
• 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
• An algorithm for optimal transport between a simplex soup and a point cloud
• 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
• 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
• 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
• Automatic generation of multiblock decompositions of surfaces
• Multicast network design game on a ring
• Poisson-driven seamless completion of triangular meshes
• Subdivision surface fitting to a dense mesh using ridges and umbilics
• On the estimation of the medial axis and inner parallel body
• 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

This page was built for software: CGAL