BSP-fields: An Exact Representation of Polygonal Objects by Differentiable Scalar Fields Based on Binary Space Partitioning.

Fryazinov, O., Pasko, A. and Adzhiev, V., 2011. BSP-fields: An Exact Representation of Polygonal Objects by Differentiable Scalar Fields Based on Binary Space Partitioning. Computer-Aided Design, 43 (3), pp. 265-277.

This is the latest version of this eprint.

Full text available as:

[img]
Preview
PDF (preprint) - Accepted Version
1003kB

DOI: 10.1016/j.cad.2010.11.011

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 the function-based modeling to already existing legacy objects from CAD and computer animation areas, which is illustrated by several examples.

Item Type:Article
ISSN:0010-4485
Uncontrolled Keywords:Implicit surfaces; Boundary representation; Function representation; Binary space partitioning; BSP-field; Exact conversion
Subjects:Generalities > Computer Science and Informatics
Group:Media School > National Centre for Computer Animation
ID Code:18561
Deposited By:Dr Oleg Fryazinov
Deposited On:30 Sep 2011 11:56
Last Modified:07 Mar 2013 15:48

Document Downloads

More statistics for this item...
Repository Staff Only -
BU Staff Only -
Help Guide - Editing Your Items in BURO