Skip to main content
Article thumbnail
Location of Repository

An Exact Representation of Polygonal Objects by C1-continuous Scalar Fields Based on Binary Space Partitioning

By Oleg Fryazinov, Alexander Pasko and Valery Adzhiev

Abstract

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

Suggested articles

Citations

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

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