CGAL
From MaRDI portal
Software:12888
swMATH118WikidataQ2718971MaRDI QIDQ12888
No author found.
Related Items (only showing first 100 items - show all)
Two optimization problems for unit disks ⋮ Exact Minkowski sums of polygons with holes ⋮ Persistence diagrams with linear machine learning models ⋮ Multilevel interpolation of scattered data using \(\mathcal{H}\)-matrices ⋮ Soft subdivision motion planning for complex planar robots ⋮ Improved upper bounds in the moving sofa problem ⋮ Faster geometric algorithms via dynamic determinant computation ⋮ Exact Minkowksi sums of polyhedra and exact and efficient decomposition of polyhedra into convex pieces ⋮ Numerical integration of discontinuities on arbitrary domains based on moment fitting ⋮ 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 ⋮ Delaunay triangulations of closed Euclidean \(d\)-orbifolds ⋮ A linear-time algorithm to compute the conjugate of convex piecewise linear-quadratic bivariate functions ⋮ Far-field reflector problem and intersection of paraboloids ⋮ \(hp\)-boundary layer mesh sequences with applications to shell problems ⋮ Accelerated robust Boolean operations based on hybrid representations ⋮ Shock-conforming mesh generation for aerodynamic analyses at supersonic regimes ⋮ Effective computational geometry for curves and surfaces ⋮ Efficient and robust persistent homology for measures ⋮ Optimal randomized incremental construction for guaranteed logarithmic planar point location ⋮ Convex combinations for diffusion schemes ⋮ Discontinuous finite element solution of the radiation diffusion equation on arbitrary polygonal meshes and locally adapted quadrilateral grids ⋮ FastJet user manual (for version 3.0.2) ⋮ Computing the conjugate of convex piecewise linear-quadratic bivariate functions ⋮ Computation of the metric average of 2D sets with piecewise linear boundaries ⋮ The visibility-Voronoi complex and its applications ⋮ Approximating the pathway axis and the persistence diagrams for a collection of balls in 3-space ⋮ A deterministic algorithm for isolating real roots of a real polynomial ⋮ Programming with C++ concepts ⋮ The multi-facility median problem with Pos/Neg weights on general graphs ⋮ An exact algorithm for the minimum dilation triangulation problem ⋮ Exact symbolic-numeric computation of planar algebraic curves ⋮ Accurate surface reconstruction in 3D using two-dimensional parallel cross sections ⋮ Perturbations for Delaunay and weighted Delaunay 3D triangulations ⋮ Multithread parallelization of LEPP-bisection algorithms ⋮ 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 ⋮ Arrangements on parametric surfaces. I: General framework and infrastructure ⋮ Arrangements on parametric surfaces. II: Concretizations and applications ⋮ On the topology of real algebraic plane curves ⋮ Exact and approximate construction of offset polygons ⋮ Exact and efficient construction of Minkowski sums of convex polyhedra with applications ⋮ Contributing vertices-based Minkowski sum computation of convex polyhedra ⋮ Competing output-sensitive frame algorithms ⋮ Topological mesh operators ⋮ Centroidal Voronoi tessellation in universal covering space of manifold surfaces ⋮ Kinetic Voronoi diagrams and Delaunay triangulations under polygonal distance functions ⋮ Overview of shelling for 2-manifold surface reconstruction based on 3D Delaunay triangulation ⋮ Locking-free numerical methods for nearly incompressible elasticity and incompressible flow on moving domains ⋮ Modeling wildfire propagation with Delaunay triangulation and shortest path algorithms ⋮ Free-surface fluid dynamics on moving domains ⋮ Efficient and accurate simulations of deformable particles immersed in a fluid using a combined immersed boundary lattice Boltzmann finite element method ⋮ Efficient mesh optimization schemes based on optimal Delaunay triangulations ⋮ Fully peer-to-peer virtual environments with 3D Voronoi diagrams ⋮ Selecting radiotherapy dose distributions by means of constrained optimization problems ⋮ Design of the CGAL 3D spherical kernel and application to arrangements of circles on a sphere ⋮ Computing the arrangement of circles on a sphere, with applications in structural biology ⋮ The numerical solution of Newton's problem of least resistance ⋮ Certifying algorithms ⋮ A general approach to the analysis of controlled perturbation algorithms ⋮ 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 ⋮ Packing spherical discrete elements for large scale simulations ⋮ Anisotropic mesh generation methods based on ACVT and natural metric for anisotropic elliptic equation ⋮ 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 ⋮ A stabilized Nitsche fictitious domain method for the Stokes problem ⋮ Transformation invariant local element size specification ⋮ Planar lower envelope of monotone polygonal chains ⋮ Computing intersections between non-compatible curves and finite elements ⋮ Accelerating smooth molecular surface calculation ⋮ Fully scalable implementation of a volume coupling scheme for the modeling of multiscale materials ⋮ Succinct representations of planar maps ⋮ Polyhedral and algebraic methods in computational geometry ⋮ A language for generic programming in the large ⋮ Approximation of sparse controls in semilinear equations by piecewise linear functions ⋮ Introducing VAUCANSON ⋮ Adaptive skin meshes coarsening for biomolecular simulation ⋮ Parallel geometric algorithms for multi-core computers ⋮ A Gabriel-Delaunay triangulation of 2D complex fractured media for multiphase flow simulations ⋮ \texttt{ColDICE}: A parallel Vlasov-Poisson solver using moving adaptive simplicial tessellation ⋮ Discretization of functionals involving the Monge-Ampère operator ⋮ Parallelized event chain algorithm for dense hard sphere and polymer systems ⋮ 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 ⋮ Hyperelastic membrane modelling based on data-driven constitutive relations ⋮ 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 ⋮ The design of the Boost interval arithmetic library
This page was built for software: CGAL
