An adaptable and extensible geometry kernel
From MaRDI portal
Publication:2371334
DOI10.1016/J.COMGEO.2006.11.004zbMath1114.65309OpenAlexW2161558549MaRDI QIDQ2371334
Publication date: 4 July 2007
Published in: Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://hal.inria.fr/inria-00344363/file/kernel.pdf
Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Packaged methods for numerical algorithms (65Y15)
Related Items (2)
A Low Arithmetic-Degree Algorithm for Computing Proximity Graphs ⋮ Design of the CGAL 3D spherical kernel and application to arrangements of circles on a sphere
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Another efficient algorithm for convex hulls in two dimensions
- Using generic programming for designing a data structure for polyhedral surfaces
- Adaptive precision floating-point arithmetic and fast robust geometric predicates
- LOOK: A lazy object-oriented kernel design for geometric computation
- Recent progress in exact geometric computation
- On the design of CGAL a computational geometry algorithms library
- The Exact Solution of Systems of Linear Equations with Polynomial Coefficients
- The computational geometry algorithms library CGAL
- Towards and open curved kernel
- Algorithms – ESA 2004
- Algorithms – ESA 2005
- Systems of distinct representatives and linear algebra
- Computational Solutions of Matrix Problems Over an Integral Domain
- Interval arithmetic yields efficient dynamic filters for computational geometry
This page was built for publication: An adaptable and extensible geometry kernel