Shape reconstruction from planar cross sections

Computer Vision, Graphics and Image Processing

Volumn 44, Issue 1, 1988, Pages 1-29

  Boissonnat, Jean Daniel ^a  

^a INRIA   (France)

Author keywords

[No Author keywords available]

Indexed keywords

CONTOUR; CROSS SECTION; DELAUNAY TRIANGULATION;

COMPUTER PROGRAMMING--ALGORITHMS; IMAGE PROCESSING--RECONSTRUCTION; MATHEMATICAL TECHNIQUES--GEOMETRY;

COMPUTATIONAL GEOMETRY; DELAUNAY TRIANGULATION; PLANAR CROSS SECTIONS; SHAPE RECONSTRUCTION;

COMPUTER GRAPHICS;

EID: 0024163841     PISSN: 0734189X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0734-189X(88)80028-8     Document Type: Article

References (29)

1. The theory, design, implementation and evaluation of a three-dimensional surface detection algorithm
2. Practical use of bucketing techniques in computational geometry
3. Shape reconstruction from planar cross-sections,
4. Geometric surfaces for 3-dimensional shape representation
5. Computing Dirichlet tesselations
6. Conversion of complex contour line definitions into polygonal element mosaics
7. A new point-location algorithm and its practical efficiency—Comparison with existing algorithms
8. Voronoi diagrams and arrangements
9. Voronoi diagrams and arrangements
10. Optimal surface reconstruction from planar contours
11. A new triangulation method for planar contours
12. computing Dirichlet tesselations in the plane
13. Computing convolutions by reciprocal search
14. Primitives for the manipulation of general subdivisions and the computation of Voronoi diagrams
15. Triangulation automatique d'un polyèdre en dimension N
16. Approximating complex surfaces by triangulation of contour lines
17. Optimal search in planar subdivisions
18. On the complexity of d-dimensional Voronoi diagrams
19. Two algorithms for constructing a Delaunay triangulation
20. Plane-sweeping algorithms for intersecting geometric figures
21. Numérisation et Modélisation Automatique d'Objets 3D
22. Computational Geometry
23. Surface defintion for branching contour-defined objects
24. Surface reconstruction from sparse data
25. An implementation of Watson's algorithm for computing 2-dimensional Delaunay triangulations
26. Computing the n-dimensional Delaunay triangulation with application to Voronoi polytopes
27. Surface reconstruction and representation of 3D scenes