LOOK: A lazy object-oriented kernel design for geometric computation
From MaRDI portal
Recommendations
- Automated Deduction in Geometry
- An adaptable and extensible geometry kernel
- scientific article; zbMATH DE number 1848394
- Towards in-place geometric algorithms and data structures
- On the design of CGAL a computational geometry algorithms library
- Finding coarse grained parallelism in computational geometry algorithms
- A tutorial for designing flexible geometric algorithms
Cites work
- A faster divide-and-conquer algorithm for constructing Delaunay triangulations
- EXACT GEOMETRIC COMPUTATION USING CASCADING
- Further results on arithmetic filters for geometric predicates
- Interval arithmetic yields efficient dynamic filters for computational geometry
- Structural filtering: a paradigm for efficient and exact geometric programs
- Vertex-rounding a three-dimensional polyhedral subdivision
Cited in
(4)
This page was built for publication: LOOK: A lazy object-oriented kernel design for geometric computation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1602944)