On the computation of 3d periodic triangulations

Authors:
Manuel Caroli;Monique Teillaud
Affiliations:
INRIA, Sophia-Antipolis, France;INRIA, Sophia-Antipolis, France
Venue:
Proceedings of the twenty-fourth annual symposium on Computational geometry
Year:
2008

Citing 5
Cited 0

Algorithmic geometry

Algorithmic geometry
VRONI: an engineering approach to the reliable and efficient computation of voronoi diagrams of points and line segments

Computational Geometry: Theory and Applications
Triangle: Engineering a 2D Quality Mesh Generator and Delaunay Triangulator

FCRC '96/WACG '96 Selected papers from the Workshop on Applied Computational Geormetry, Towards Geometric Engineering
Topology for Computing (Cambridge Monographs on Applied and Computational Mathematics)

Topology for Computing (Cambridge Monographs on Applied and Computational Mathematics)
Computational Geometry: Algorithms and Applications

Computational Geometry: Algorithms and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this video, we first review the incremental algorithm to compute Delaunay triangulations in R3. Then we examine the case of the periodic space T3, focusing on the differences with R3.