BSP-fields: An exact representation of polygonal objects by differentiable scalar fields based on binary space partitioning

This source preferred by Oleg Fryazinov, Alexander Pasko and Valery Adzhiev

Authors: Fryazinov, O., Pasko, A. and Adzhiev, V.

http://eprints.bournemouth.ac.uk/18561/

Journal: Computer-Aided Design

Volume: 43

Pages: 265-277

ISSN: 0010-4485

DOI: 10.1016/j.cad.2010.11.011

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.

This data was imported from DBLP:

Authors: Fryazinov, O., Pasko, A.A. and Adzhiev, V.

http://eprints.bournemouth.ac.uk/18561/

Journal: Computer-Aided Design

Volume: 43

Pages: 265-277

DOI: 10.1016/j.cad.2010.11.011

This data was imported from Scopus:

Authors: Fryazinov, O., Pasko, A. and Adzhiev, V.

http://eprints.bournemouth.ac.uk/18561/

Journal: CAD Computer Aided Design

Volume: 43

Issue: 3

Pages: 265-277

ISSN: 0010-4485

DOI: 10.1016/j.cad.2010.11.011

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; C 1 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. © 2010 Elsevier Ltd. All rights reserved.

This data was imported from Web of Science (Lite):

Authors: Fryazinov, O., Pasko, A. and Adzhiev, V.

http://eprints.bournemouth.ac.uk/18561/

Journal: COMPUTER-AIDED DESIGN

Volume: 43

Issue: 3

Pages: 265-277

ISSN: 0010-4485

DOI: 10.1016/j.cad.2010.11.011

The data on this page was last updated at 04:42 on September 22, 2017.