Generalizing CGAL Periodic Delaunay Triangulations
From MaRDI portal
Publication:5874547
Recommendations
- Generalized Delaunay triangulation for planar graphs
- Generalized Delaunay triangulations of non-convex domains
- Fast and robust Delaunay tessellation in periodic domains
- Almost regular Delaunay-triangulations
- scientific article; zbMATH DE number 5507870
- Generalized triangulations
- Delaunay triangulations of generalized Bolza surfaces
- General-dimensional constrained Delaunay and constrained regular triangulations. I: Combinatorial properties
- General-dimensional constrained Delaunay and constrained regular triangulations. I: Combinatorial properties
- scientific article; zbMATH DE number 1670662
Cites work
- scientific article; zbMATH DE number 4078121 (Why is no real title available?)
- A deterministic single exponential time algorithm for most lattice problems based on Voronoi cell computations
- Delaunay triangulations of closed Euclidean \(d\)-orbifolds
- Finding the closest lattice point by iterative slicing
- Flipping geometric triangulations on hyperbolic surfaces
- Low-dimensional lattices. VI. Voronoi reduction of three-dimensional lattices
- Periodic Delone tilings
- Perturbations for Delaunay and weighted Delaunay 3D triangulations
Cited in
(3)
This page was built for publication: Generalizing CGAL Periodic Delaunay Triangulations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5874547)
