DELAUNAY RECONSTRUCTION FROM MULTIAXIAL PLANAR CROSS-SECTIONS
Chris Dance and Richard Prager
January 1997
Algorithms for reconstruction of triangulated representations of shapes from their planar cross-sections have previously considered only the case of parallel cross-sections or have been restricted to simple object topologies. This report shows how existing Delaunay reconstruction methods can be efficiently generalised to the non-parallel (multiaxial) case, enabling the treatment of arbitrary topologies. This is achieved by first constructing a portion of a structure known as the arrangement of the planes of section. The algorithm assumes that points in space occuring on multiple cross-sections are consistently labelled as in or out of the object. Means of relaxing or enforcing this assumption are discussed. Results with synthetic and real data illustrate the generality of the method.
If you have difficulty viewing files that end '.gz',
which are gzip compressed, then you may be able to find
tools to uncompress them at the gzip
web site.
If you have difficulty viewing files that are in PostScript, (ending
'.ps' or '.ps.gz'), then you may be able to
find tools to view them at
the gsview
web site.
We have attempted to provide automatically generated PDF copies of documents for which only PostScript versions have previously been available. These are clearly marked in the database - due to the nature of the automatic conversion process, they are likely to be badly aliased when viewed at default resolution on screen by acroread.