Computing 3D Periodic Triangulations

DOI10.1007/978-3-642-04128-0_6MaRDI QIDQ3639235zbMATH OpenOpenAlexFDO

Authors Manuel Caroli, Monique Teillaud

Publication date 29 October 2009

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-04128-0_6

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Decoupling the \textsc{Cgal} 3D triangulations from the underlying space
• Delaunay triangulations of closed Euclidean d-orbifolds
• Delaunay triangulations of point sets in closed Euclidean d-manifolds
• Fast and robust Delaunay tessellation in periodic domains
• Implementing Delaunay triangulations of the Bolza surface

Cited in

(9)

• Periodic triangulations of \(\mathbb{Z}^{n}\)
• An optimal transport approach to Monge-Ampère equations on compact Hessian manifolds
• Delaunay triangulations of closed Euclidean d-orbifolds
• Centroidal Voronoi tessellation in universal covering space of manifold surfaces
• Fully peer-to-peer virtual environments with 3D Voronoi diagrams
• A simple geometric method for navigating the energy landscape of centroidal Voronoi tessellations
• Decoupling the \textsc{Cgal} 3D triangulations from the underlying space
• Arrangements on parametric surfaces. II: Concretizations and applications
• Representing infinite periodic hyperbolic Delaunay triangulations using finitely many Dirichlet domains

Describes a project that uses

Uses Software

• CGAL
• VRONI

This page was built for publication: Computing 3D Periodic Triangulations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3639235)