Location of Repository

The problem considered in this work is to find a dimension independent algorithm for the generation of signed scalar fields exactly representing polygonal objects and satisfying the following requirements: the defining real function takes zero value exactly at the polygonal object boundary; no extra zero-value isosurfaces should be generated; C1 continuity of the function in the entire domain. The proposed algorithms are based on the binary space partitioning (BSP) of the object by the planes passing through the polygonal faces and are independent of the object genus, the number of disjoint components, and holes in the initial polygonal mesh. Several extensions to the basic algorithm are proposed to satisfy the selected optimization criteria. The generated BSP-fields allow for applying techniques of function-based modelling to already existing legacy objects from CAD and computer animation areas, which is illustrated by several examples

Topics:
csi

Publisher: National Centre for Computer Animation, Bournemouth University

Year: 2008

OAI identifier:
oai:eprints.bournemouth.ac.uk:7023

Provided by:
Bournemouth University Research Online

Downloaded from
http://eprints.bournemouth.ac.uk/7023/1/TR-NCCA-2008-03.pdf

- (1992). A convex decomposition using convex hulls and local cause of its nonconvergence.
- (2000). Adaptively sampled distance ﬁelds: a general representation of shape for computer graphics.
- (2006). AKKOUCHE S.: The HybridTree: Mixing skeletal implicit surfaces, triangle meshes, and point sets in a freeform modeling system.
- (1988). An efﬁcient algorithm for ﬁnding the csg representation of a simple polygon.
- (2000). Analytical versus voxelized phantom representation for monte carlo simulation in radiological imaging.
- (1974). Combinatorial aspects of piecewise-linear maps.
- (1984). Convex decomposition of simple polygons.
- (1992). Distance ﬁeld manipulation of surface models.
- (1995). Function representation of solids reconstructed from scattered surface points and contours.
- (1982). Graphical input to a boolean solid modeller.
- (2003). H.-P.: Multi-level partitionof unityimplicits.
- (1984). Halfspace representation of extrusions, solids of revolution, and pyramids.
- (2004). Interpolating and approximating implicit surfaces from polygon soup.
- Interpolating implicit surfaces from scattered surface data using compactly supported radial basis functions.
- (2003). KOBBELT L.: Piecewise linear approximation of signed distance ﬁelds.
- (1974). Methods of the algebra of logic in mathematical physics.
- (2006). MIRENKOV N.: Constructive heterogeneous object modeling using signed approximate real distance functions.
- (1980). On visible surface generation by a priori tree structures.
- (1996). PASKO A.: Function representation for sweeping by a moving solid.
- (2004). Robust repair of polygonal models.
- (2007). Semi-analytic geometry with rfunctions.
- (1993). Separation for boundary to csg conversion.
- (2004). SHAPIRO V.: Approximate distance ﬁelds with non-vanishing gradients.
- (1998). Three-dimensional distance ﬁeld metamorphosis.
- Threedimensional halfspace constructive solid geometry tree construction from implicit boundary representations.
- (2004). TSUKANOV I.: Heterogeneous material modeling with distance ﬁelds.
- (2002). TURK G.: Robust creation of implicit surfaces from polygonal meshes.
- (2002). Visualization, analysis and shape reconstruction of unorganized data sets.
- (1991). Volumetric shape description of range data using “blobby model”.

To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.