An Exact Representation of Polygonal Objects by C(1)-continuous Scalar Fields Based on Binary Space Partitioning

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

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

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

http://hyperfun.org/TR-NCCA-2008-03.pdf

Publisher: National Centre for Computer Animation, Bournemouth University

Place of Publication: Poole

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.

This data was imported from DBLP:

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

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

http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=5164155

Pages: 132-139

Publisher: IEEE Computer Society

ISBN: 978-1-4244-4068-9

DOI: 10.1109/SMI.2009.5170174

This data was imported from Scopus:

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

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

Pages: 132-139

ISBN: 9781424440702

DOI: 10.1109/SMI.2009.5170174

The problem considered in this work isto 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 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. © 2009 IEEE.

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

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

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

Pages: 132-139

ISBN: 978-1-4244-4068-9

DOI: 10.1109/SMI.2009.5170174

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