TY - GEN

T1 - Constructive tree recovery using genetic algorithms

AU - Fayolle, Pierre Alain

AU - Pasko, Alexander

AU - Mirenkov, Nikolay

AU - Rosenberger, Christophe

AU - Toinard, Christian

PY - 2006

Y1 - 2006

N2 - An algorithm is described for recovering a constructive tree representation of a solid from a segmented point-set. The term point-set refers here to a finite set of points on or near the surface of the solid. Constructive geometry refers to the construction of complex solids by recursively applying set operations to simple primitives. It can be implemented on a computer by using a tree data structure with geometric primitives (planes, spheres and others) in the leaves and set-operations in the internal nodes. This tree data structure is called a constructive tree. A constructive tree can be syntactically translated into representations of solids by real-valued functions with the theory of R-functions. The recovered constructive tree is a correct representation of the point-set if the solid defined by the corresponding function matches the solid defined by the point-set. The search for a constructive tree is performed by a genetic algorithm. The formulation of the problem, the genetic algorithm and its parameters are discussed here.

AB - An algorithm is described for recovering a constructive tree representation of a solid from a segmented point-set. The term point-set refers here to a finite set of points on or near the surface of the solid. Constructive geometry refers to the construction of complex solids by recursively applying set operations to simple primitives. It can be implemented on a computer by using a tree data structure with geometric primitives (planes, spheres and others) in the leaves and set-operations in the internal nodes. This tree data structure is called a constructive tree. A constructive tree can be syntactically translated into representations of solids by real-valued functions with the theory of R-functions. The recovered constructive tree is a correct representation of the point-set if the solid defined by the corresponding function matches the solid defined by the point-set. The search for a constructive tree is performed by a genetic algorithm. The formulation of the problem, the genetic algorithm and its parameters are discussed here.

KW - Constuctive modeling

KW - Function representation

KW - Genetic algorithms

KW - Modeling automation

KW - R-functions

UR - http://www.scopus.com/inward/record.url?scp=56349160616&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:56349160616

SN - 0889865981

SN - 9780889865983

T3 - Proceedings of the 6th IASTED International Conference on Visualization, Imaging, and Image Processing, VIIP 2006

SP - 349

EP - 353

BT - Proceedings of the 6th IASTED International Conference on Visualization, Imaging, and Image Processing, VIIP 2006

T2 - 6th IASTED International Conference on Visualization, Imaging, and Image Processing, VIIP 2006

Y2 - 28 August 2006 through 30 August 2006

ER -