An exact representation of polygonal objects by C1-continuous scalar fields based on binary space partitioning.

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

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

Editors: Yong, J.-H., Spagnuolo, M. and Wang, W.

Start date: 26 June 2009

Pages: 132-139

Publisher: IEEE Computer Society

ISBN: 978-1-4244-4068-9

DOI: 10.1109/SMI.2009.5170174

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 of the basic algorithm are proposed to satisfy the selected optimization criteria. The generated BSP-fields allow for applying techniques of the function-based modelling to already existing legacy objects from CAD and computer animation areas, which is illustrated by several examples.

The data on this page was last updated at 04:40 on November 19, 2017.