A triangulation algorithm from arbitrary shaped multiple planar contours

DOI10.1145/108360.108363MaRDI QIDQ3981203zbMATH OpenOpenAlexFDO

Authors A. B. Ekoule, F. C. Peyrin, C. L. Odet

Publication date 26 June 1992

Published in ACM Transactions on Graphics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/108360.108363

zbMATH Keywords

display algorithmsobject modelingpicture/image generationslice interpolationtriangulation algorithms

Mathematics Subject Classification ID

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

Recommendations

• Triangulation of Branching Contours Using Area Minimization
• Surfaces from contours
• Adaptive contouring of three-dimensional surfaces
• Piecewise-Linear Interpolation between Polygonal Slices
• Reconstruction and Simplification of Surfaces from Contours

Cited in

(13)

• Reconstructing multishell solids from voxel-based contours
• Tetrahedral meshes from planar cross-sections
• Efficient rendering of breaking waves using MPS method
• 2D and 3D finite element meshing and remeshing. A bibliography (1990-2001)
• Geometric tomography with topological guarantees
• Triangulation of Branching Contours Using Area Minimization
• Volume triangulation from planar cross sections
• Volume reconstruction from slices
• A PARALLEL ALGORITHM FOR SURFACE TRIANGULATION
• scientific article; zbMATH DE number 5239206 (Why is no real title available?)
• Conformance criteria for validation of target volume surface reconstructed from delineation
• A contour tracing and coding algorithm for generating 2D contour codes from 3D classified objects
• Triangulating input-constrained planar point sets

This page was built for publication: A triangulation algorithm from arbitrary shaped multiple planar contours

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